# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
888793 | 2023-12-18T07:54:27 Z | vjudge1 | Passport (JOI23_passport) | C++17 | 97 ms | 11344 KB |
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> using namespace std; //using namespace __gnu_pbds; bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; } void YES(){cout << "Yes\n" ;} void NO(){cout << "No\n" ;} void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} //#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> #define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0); #define int long long #define ld long double #define pii pair <int , int> #define ff first #define ss second #define endl '\n' const int N = 2e5 + 5 ; const int inf = 1e18 ; const int mod = 1e9 + 7 ; const double eps = 1e-8 ; int binpow( int a , int b ){ if ( b == 0 ) return 1 ; int x = binpow ( a , b/2 ) ; if ( !(b%2) ) return (x*x) ; return (x*x*a) ; } template <class T> bool chmax( T& x , const T& y ){ bool f = 0 ; if ( x < y ) x = y , f = 1 ; return f ; } template <class T> bool chmin( T &x , const T &y ){ bool f = 0 ; if ( x > y ) x = y , f = 1 ; return f ; } //code int n , q , x ; int l[N] , r[N] ; pii a[N] ; vector <int> vec[N] ; void solve(){ cin >> n ; for ( int i = 1 ; i <= n ; i ++ ){ cin >> l[i] >> r[i] ; a[i].ff = l[i] , a[i].ss = r[i] ; } cin >> q >> x ; int r = a[x].ss , cnt = 1 , l = a[x].ff ; while ( r != n ){ int cur = r ; for ( int i = l ; i <= r ; i ++ ) chmax ( cur , a[i].ss ) ; if ( cur == r ){ cout << -1 ; return ; }cnt ++ ; l = r ; r = cur ; } cout << cnt ; } signed main(){ //ios ; int t = 1 ; //cin >> t ; while ( t -- ) solve() ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 10840 KB | Output is correct |
2 | Correct | 2 ms | 10844 KB | Output is correct |
3 | Correct | 2 ms | 10844 KB | Output is correct |
4 | Correct | 97 ms | 11124 KB | Output is correct |
5 | Correct | 80 ms | 11116 KB | Output is correct |
6 | Correct | 82 ms | 11344 KB | Output is correct |
7 | Correct | 64 ms | 11124 KB | Output is correct |
8 | Correct | 71 ms | 11092 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 10844 KB | Output is correct |
2 | Incorrect | 3 ms | 10844 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 10844 KB | Output is correct |
2 | Incorrect | 3 ms | 10844 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 10844 KB | Output is correct |
2 | Incorrect | 3 ms | 10844 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 10840 KB | Output is correct |
2 | Correct | 2 ms | 10844 KB | Output is correct |
3 | Correct | 2 ms | 10844 KB | Output is correct |
4 | Correct | 97 ms | 11124 KB | Output is correct |
5 | Correct | 80 ms | 11116 KB | Output is correct |
6 | Correct | 82 ms | 11344 KB | Output is correct |
7 | Correct | 64 ms | 11124 KB | Output is correct |
8 | Correct | 71 ms | 11092 KB | Output is correct |
9 | Correct | 2 ms | 10844 KB | Output is correct |
10 | Incorrect | 3 ms | 10844 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |