Submission #1222126

#TimeUsernameProblemLanguageResultExecution timeMemory
1222126AvianshPassport (JOI23_passport)C++20
6 / 100
18 ms1864 KiB
#include <bits/stdc++.h>

using namespace std;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    array<int,2>rangs[n];
    for(int i = 0;i<n;i++){
        cin >> rangs[i][0];
        cin >> rangs[i][1];
        rangs[i][0]--;
        rangs[i][1]--;
        //inclusive range.
    }
    int curr = rangs[0][1];
    int curmx = 0;
    int ans = 1;
    for(int i = 0;i<n;i++){
        curmx = max(curmx,rangs[i][1]);
        if(curr==i&&i!=n-1){
            ans++;
            curr=curmx;
        }
    }
    if(curr!=n-1){
        ans=-1;
    }
    int q;
    cin >> q;
    while(q--){
        int x;
        cin >> x;
        x--;
        assert(x==0);
        cout << ans << "\n";
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...