Submission #544651

#	Time	Username	Problem	Language	Result	Execution time	Memory
544651		pokmui9909	공주님의 정원 (KOI11_flower)	C++17	18 / 18	44 ms	2048 KiB

flower

#include <bits/stdc++.h>
using namespace std;

pair<int, int> ar[100001];

int main()
{
    cin.tie(0); cout.tie(0);
    ios_base::sync_with_stdio(false);

    int n; cin >> n;
    for(int i = 0; i < n; i++)
    {
        int a, b, c, d; cin >> a >> b >> c >> d;
        ar[i] = {100 * a + b, 100*c + d};
    }
    int ans = 0;
    int now = 301;
    while(1)
    {
        if(now > 1130)
            break;
        int k = 0;
        for(int i = 0; i < n; i++)
        {
            if(ar[i].first <= now && now < ar[i].second)
                k = max(k, ar[i].second);
        }
        if(now >= k)
        {
            cout << 0;
            return 0;
        }
        now = k;
        ans++;
    }
    cout << ans;
}

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9