#include #include #include #include #include using namespace std; #define MAXN 100000 struct flower { int start; int end; bool operator<(const flower &f) const{ return end < f.end; } }; int N; flower flowers[MAXN]; int calender[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31}; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> N; for(int i = 0; i < N; i++) { int m, d; cin >> m >> d; for(int j = m-1; j >= 0; j--) { d += calender[j]; } int start = d; cin >> m >> d; for(int j = m-1; j >= 0; j--) { d += calender[j]; } int end = d; flowers[i] = {start, end}; } sort(flowers, flowers + N); int curs = 1; for(int i = 2; i >= 0; i--) curs += calender[i]; int cure = 30; for(int i = 10; i >= 0; i--) cure += calender[i]; int ans = 0; int cnt = N; while(cnt) { int minStart = 98654321; int minPos = -1; for(int i = cnt-1; i >= 0; i--) { if(cnt == N && flowers[i].start <= cure && cure < flowers[i].end) { if(flowers[i].start < minStart) { minStart = flowers[i].start; minPos = i; } } else if(cnt != N && flowers[i].start <= cure && cure <= flowers[i].end) { if(flowers[i].start < minStart) { minStart = flowers[i].start; minPos = i; } } if(flowers[i].end <= cure) break; } if(minPos == -1) { cout << 0; return 0; } ans++; cnt = minPos; cure = flowers[minPos].start; if(flowers[minPos].start <= curs) break; } if(curs < cure) cout << 0; else cout << ans; }

제출 #30519

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: