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:T764,#include using namespace std; vector > v; bool comp(pair& a, pair& b) { if (a.first < b.first)return true; if (a.first == b.first) { return a.second > b.second; } return false; } // 새로운 스타트를 만족시키면서 ending이 가장 길게 하는 인자를 찾고,' // 그 인자를 기준으로 이전 꽃들 정보는 사용 안하기. int main() { ios::sync_with_stdio(0); cin.tie(0); int n; int start = 301; int ending = 1201; cin >> n; int x, y, z, w; //cout << "here.........0000000\n"; for (int i = 0; i < n; i++) { cin >> x >> y >> z >> w; //cout << "checccccccc\n"; int new_start; int new_ending; new_start = x * 100 + y; if (x * 100 + y < start) { new_start = start; } new_ending = z * 100 + w; if (z * 100 + w > ending) { new_ending = ending;

제출 #25990

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: