Submission #401322

#	Time	Username	Problem	Language	Result	Execution time	Memory
401322		hgmhc	공주님의 정원 (KOI11_flower)	C++14	18 / 18	88 ms	1992 KiB

flower

#include <iostream>
#include <functional>
#include <algorithm>
#include <utility>
using namespace std;
using pi = pair<int,int>;
#define S first
#define F second
 
int main() {
    int s = 301, e = 1130;
    int n; cin >> n;
    pi flowers[n];
    for (auto& s : flowers) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        s = {100*c+d, 100*a+b};
    }
    sort(flowers, flowers+n, greater<pi>());
    int cnt = 0; bool chk = false;
    for (int i = s; i <= e; chk = false) {
        for (auto& f : flowers) {
            if (f.F <= i) {
                i = f.S;
                chk = true;
                f = {1232, 1232};
                break;
            }
        }
        if (!chk) {cout << 0; return 0;}
        ++cnt;
    }
    cout << cnt;
}

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