Submission #1221482

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221482		gry3125	Bouquet (EGOI24_bouquet)	C++20	16 / 100	53 ms	1864 KiB

Main

#include <bits/stdc++.h>
#define f0r(i,n) for(int i=0;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef long long int ll; 
using namespace std;

int main() {
    int n; cin >> n;
    vector<pair<int,int>> v(n);
    for (int i = 0; i < n; i++) {
        int L, R; cin >> L >> R;
        L = max(0, i-L); R = min(n-1, i+R);
        v[i] = {R, L};
    }
    sort(all(v));
    ll cur = -1, ans = 0;
    for (int i = 0; i < n; i++) {
        if (v[i].se <= cur) continue;
        ans++; cur = v[i].fi;
    }
    cout << ans;
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 16 / 16
• Subtask 3: 0 / 28
• Subtask 4: 0 / 18
• Subtask 5: 0 / 30