1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T7a5,#include #include #include #include #include using namespace std; int ccw(int* p1, int* p2, int* p3) { int dx1 = p2[0] - p1[0]; int dx2 = p3[0] - p2[0]; int dy1 = p2[1] - p1[1]; int dy2 = p3[1] - p2[1]; long k = (long)dx1*dy2 - dx2 * dy1; if (k > 0) {//반시계 //오른손법칙 생각 return 1; } else if (k == 0) { return 0; } else { return -1; } } bool isCross(int*** l) { int ccwVal[2][2]; for (size_t i = 0; i < 2; i++) { for (size_t j = 0; j < 2; j++) { ccwVal[i][j] = ccw(l[i][0], l[i][1], l[(i + 1) % 2][j]); } } if ( (ccwVal[0][0] * ccwVal[0][1] < 0) && (ccwVal[1][0] * ccwVal[1][1]<0)) { return true; } else { for (size_t i = 0; i < 2; i++) { for (size_t j = 0; j < 2; j++) { if (ccwVal[i][j] == 0) { //li선분위에 li'의 j번 점이 올라가있다면 크로스 if (l[i][0][0] == l[i][1][0]) { //y로 비교 int minY = min(l[

제출 #101415

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: