19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T4cd,#include using namespace std; #define endl "\n" #define pii pair pair a, b; int ccw(pair p1, pair p2, pair p3) { int s = p1.first * p2.second + p2.first * p3.second + p3.first * p1.second; s -= (p1.second * p2.first + p2.second * p3.first + p3.second * p1.first); if (s > 0) return 1; // 반시계 else if (s == 0) return 0; // 일직선 return -1; // 시계 } bool isIntersect(pair l1, pair l2) { pii a = l1.first, b = l1.second; pii c = l2.first, d = l2.second; int ab_c = ccw(a, b, c); int ab_d = ccw(a, b, d); int cd_a = ccw(c, d, a); int cd_b = ccw(c, d, b); if (ab_c * ab_d == 0 && cd_a * cd_b == 0) { // 일직선 또는 한 점이 겹침 if (max(a, b) < min(c, d) || max(c, d) < min(a, b)) return false;

제출 #41864

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: