#include #include #include #include using namespace std; map period; int blooming_period(int &starting_period, int sm, int sd, int em, int ed) { int total = 0, past = 0; ed -= 1, sd -= 1; for (int i = 1; i < em; i++) { total += period[i]; } total += ed; past += sd; if (sm > 1) { for (int i = 1; i < sm; i++) { past += period[i]; } } starting_period = past; //cout << "sm : " << sm << " sd : "<< sd << " em : " << em << " ed : " << ed << " total : " << total << " past : " << past << '\n'; return total - past; } int main() { int date[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; for (int i = 0; i < 12; i++) { period.insert(pair (i + 1, date[i])); } int N, sm, sd, em, ed; cin >> N; vector> flowers; for (int i = 0; i < N; i++) { cin >> sm >> sd >> em >> ed; int starting_period; int blooming = blooming_period(starting_period, sm, sd, em, ed); if (starting_period + blooming < 59 || starting_period > 334) continue; flowers.push_back({starting_period, blooming}); } sort(flowers.begin(), flowers.end(), [](const vector &a, const vector &b) { return a[0] < b[0]; }); int e = 59, pe = 59; int ans = 0; int ns, ne; for (int i = 0; i < flowers.size(); i++) { ns = flowers[i][0], ne = flowers[i][0] + flowers[i][1]; if (e < ns) { e = pe; ans += 1; //cout << "answer + 1 when ns is " << ns << '\n'; } if (e < ns) { ans = 0; break; } if (ns <= e && ne >= pe) { if (i == flowers.size() - 1 && pe < 334) { ans += 1; } pe = max(pe, ne); } //cout << "new s : " << ns << " new e : " << ne << " e : " << e << " pe : " << pe << '\n'; } if (pe < 334) ans = 0; cout << ans; return 0; }

제출 #72940

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: