/* 1.접근방식: 2.시간복잡도: */ #include const int MD[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int N, res; std::pair SEMD, flowers[100'005]; int main() { std::ios::sync_with_stdio(false); std::cin.tie(NULL); std::cin >> N; SEMD.first = 1; SEMD.second = 30; for(int i = 0; i < 3; i++) SEMD.first += MD[i]; for(int i = 0; i < 11; i++) SEMD.second += MD[i]; //std::cout << SEMD.first << ' ' << SEMD.second << '\n'; for(int n = 0; n < N; n++) { int sm, sd, em, ed; std::cin >> sm >> sd >> em >> ed; flowers[n].first = sd; flowers[n].second = ed; for(int i = 0; i < sm; i++) flowers[n].first += MD[i]; for(int i = 0; i < em; i++) flowers[n].second += MD[i]; //std::cout << flowers[n].first << ' ' << flowers[n].second << '\n'; } std::sort(flowers, flowers+N, [](const std::pair& a, const std::pair& b)->bool{ return a.first == b.first ? a.second > b.second : a.first < b.first; }); /* for(int n = 0; n < N; n++) { std::cout << flowers[n].first << ' ' << flowers[n].second << '\n'; } std::cout << '\n'; */ if(flowers[0].first > SEMD.first) { std::cout << 0; return 0; } std::pair cur(60,60); std::priority_queue, std::vector>, std::less>> pq; for(int n = 0; n < N; n++) { if(flowers[n].first > cur.second) { if(pq.empty()) { std::cout << 0; return 0; } cur = std::make_pair(pq.top().second, pq.top().first); //std::cout << n << ' ' << cur.first << ' ' << cur.second << '\n'; while(pq.size()) pq.pop(); res++; } pq.push({flowers[n].second, flowers[n].first}); } if(cur.second <= SEMD.second) { if(pq.empty() || (pq.size() && pq.top().first <= SEMD.second)) { std::cout << 0; return 0; } else if(pq.size() && pq.top().first > SEMD.second) { std::cout << res + 1; return 0; } } std::cout << res; return 0; }

제출 #121477

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: