Submission #1158831

#	Time	Username	Problem	Language	Result	Execution time	Memory
1158831		vladilius	Worst Reporter 2 (JOI16_worst_reporter2)	C++20	0 / 100	1 ms	320 KiB

worst_reporter2

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define pb push_back
#define ff first
#define ss second

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

    int n; cin>>n;
    vector<int> a(n + 1), c(n + 1), f[n + 1];
    for (int i = 1; i <= n; i++){
        cin>>a[i]>>c[i];
        f[a[i]].pb(c[i]);
    }
    for (int i = 1; i <= n; i++){
        reverse(f[i].begin(), f[i].end());
    }
    vector<int> b(n + 1), d(n + 1);
    for (int i = 1; i <= n; i++){
        cin>>b[i]>>d[i];
    }
    
    set<int> s1, s2;
    for (int i = 1; i <= n; i++){
        s1.insert(c[i]);
        s2.insert(d[i]);
    }
    
    vector<int> s(n + 1);
    int out = n;
    for (int i = n; i > 0; i--){
        int x = b[i];
        if (s[x] != f[x].size() && f[x][s[x]] <= d[i]){
            out--;
            s1.erase(f[x][s[x]]);
            s2.erase(d[i]);
            s[x]++;
        }
    }
    
    auto it1 = s1.begin(), it2 = s2.begin();
    while (it1 != s1.end()){
        assert((*it1) <= (*it2));
        it1++; it2++;
    }
    cout<<out<<"\n";
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40