| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 793943 | vjudge1 | Passport (JOI23_passport) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 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][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;
cin>>k;
if(k == 1){
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;
return;
}
vector<pair<ll,ll>>v , v1;
v.pb({a[k], b[k]});
for(i = 1; i <= n; i++){
if(v.size() == 1 && v[0].fi == 1 && v[0].se == n){
cout<<i<<"\n";
return;
}
for(auto to :v)
for(j = to.fi; j <= to.se; j++)
if(a[j] < to.fi || b[j] > to.se)
v1.pb({min(a[j] , to.fi) , -max(b[j] , to.se)});
sort(all(v1));
v.clear();
multiset<ll>st , st1;
for(auto to : v1){
if(st.size() == 0){
st.insert(-to.se);
st1.insert(to.fi);
}
auto it = st.end();
it--;
if(*it < -to.se){
st.insert(-to.se);
st1.insert(to.fi);
}
}
while(st.size()){
v.pb({*st1.begin() , *st.begin()});
st.erase(st.begin());
st1.erase(st1.begin());
}
if(v.size() == 0)
continue;
sort(all(v));
v1.clear();
}
cout<<-1<<"\n";
}
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 : حسن