# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793840 | 2023-07-26T07:19:07 Z | vjudge1 | Passport (JOI23_passport) | C++17 | 27 ms | 3392 KB |
// Author : حسن #include <bits/stdc++.h> using namespace std; #define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); #define rall(s) s.rbegin(),s.rend() #define all(s) s.begin(),s.end() #define pb push_back #define fi first #define se second #define ll long long #define ld long double #define YES cout<<"YES\n" #define Yes cout<<"Yes\n" #define yes cout<<"yes\n" #define NO cout<<"NO\n" #define No cout<<"No\n" #define no cout<<"no\n" const int N = 2e5 + 9 , mod = 1e9 + 7; ll c[N] = {} , d[N] = {} , a[N] = {}, b[N] = {} , dp[N]; vector<pair<ll,ll>>v; void solve(){ ll q , i , j , m , n , z , s = 0, f, l , r , k , x , y , mn = 1e18 , mx = 0; cin>>n; for(i = 1; i <= n; i++){ cin>>a[i]>>b[i]; } cin>>q; while(q--){ cin>>k; s = 1; x = 1; y = b[k]; while(y < n){ mx = 0; for(j = x+ 1; j <= y; j++){ mx = max(mx , b[j]); } if(mx <= y) break; s++; x = y; y= mx; } if(y != n) cout<<-1; else cout<<s; } } int main(){ TL; /* #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif */ int t = 1; //cin>>t; while(t--) { solve(); } } // Author : حسن
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 24 ms | 3304 KB | Output is correct |
5 | Correct | 24 ms | 3376 KB | Output is correct |
6 | Correct | 27 ms | 3392 KB | Output is correct |
7 | Correct | 20 ms | 3336 KB | Output is correct |
8 | Correct | 17 ms | 2792 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 24 ms | 3304 KB | Output is correct |
5 | Correct | 24 ms | 3376 KB | Output is correct |
6 | Correct | 27 ms | 3392 KB | Output is correct |
7 | Correct | 20 ms | 3336 KB | Output is correct |
8 | Correct | 17 ms | 2792 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Incorrect | 0 ms | 340 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |