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:T73d,#include #include using namespace std; pair,pair> f[100005]; bool cmp(pair,pair> x, pair,pair> y){ if(x.first.first == y.first.first) { if(x.first.second == y.first.second) { if(x.second.first == y.second.first) { return x.second.second < y.second.second; } else return x.second.first < y.second.first; } else return x.first.second < y.first.second; } else return x.first.first < y.first.first; } int main() { int n; cin >> n; for(int i=0; i> f[i].first.first >> f[i].first.second >> f[i].second.first >> f[i].second.second; } sort(f,f+n,cmp); int month=3, day=1; int a=3,b=1; int ans = 0; bool istrue = false;//시작시간이 현재 꽃이 지는 시간보다 늦으면 false for(int i=0;

제출 #121880

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: