oj.uz

Submission #793919

# Submission time Handle Problem Language Result Execution time Memory
793919 2023-07-26T08:05:43 Z vjudge1 Passport (JOI23_passport) C++17
0 / 100
 2 ms 468 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 = 2500 + 9 , mod = 1e9 + 7;
int c[N] = {} , d[N] = {} , a[N] = {}, b[N] = {} ;

void solve(){
    int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
    cin>>n;
    for(i = 1; i <= n; i++){
        cin>>a[i]>>b[i];
    }
    cin>>q;
    cin>>k;
    vector<pair<int,int>>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<int>st , st1;
        mx = 0;
        for(auto to : v1){
            mx = max(mx , -to.se);
            if(st.size() == 0){
            st.insert(-to.se);
            st1.insert(to.fi);
            }
            if(mx < -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 : حسن

Compilation message

passport.cpp: In function 'void solve()':
passport.cpp:31:21: warning: unused variable 'm' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                     ^
passport.cpp:31:29: warning: unused variable 'z' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                             ^
passport.cpp:31:33: warning: unused variable 's' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                                 ^
passport.cpp:31:41: warning: unused variable 'f' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                                         ^
passport.cpp:31:44: warning: unused variable 'l' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                                            ^
passport.cpp:31:48: warning: unused variable 'r' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                                                ^
passport.cpp:31:56: warning: unused variable 'x' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                                                        ^
passport.cpp:31:60: warning: unused variable 'y' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                                                            ^
passport.cpp:31:64: warning: unused variable 'mn' [-Wunused-variable]
   31 |     int q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 2e9 , mx = 0;
      |                                                                ^~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Runtime error 2 ms 468 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Runtime error 2 ms 468 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -