Submission #898089

#	Time	Username	Problem	Language	Result	Execution time	Memory
898089		vjudge1	Passport (JOI23_passport)	C++17	0 / 100	0 ms	348 KiB

passport

#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
 
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define str string
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define F first
#define S second
#define all(x) x.begin() , x.end()
#define setpr(x) cout << fixed << setprecision(x) 
#define endl '\n'
 
const int inf = INT_MAX;
const ld eps = 1e-9 , pi = acos(-1.0);
const ll mod = 1e9 + 7; // 998244353;
const int dx[4]{1 , 0 , -1 , 0} , dy[4]{0 , 1 , 0 , -1};

/*
    T_ai <= T_bi --> 
    ai < bi --> S_(ai + 1 , bi) <= S_(ai , bi - 1)
    ai > bi --> S_(bi + 1 , ai) >= S_(bi , ai - 1)
*/

void solution(){
    int n , x; cin >> n;
    vector<pair<int , int>> bu(n);
    for(int i = 0 ; i < n ; i ++) cin >> bu[i].F >> bu[i].S;
    int q; cin >> q;
    while(q --) cin >> x;
    int l = bu[x - 1].F , r = -1 , h = 0;
    multiset<int> st; st.insert(bu[x - 1].S);
    for(int i = 0 ; i < n ; i ++){
        r = *st.rbegin();
        if(r != -1) l = r;
        for(int i = l ; i <= r ; i ++) st.insert(bu[i].S);
        h ++;
        if(r == n) break;
    }
    cout << h << endl;
}  
 
signed main(){
    IOS;
    int t = 1; // cin >> t;
    while(t --) solution();
}   

• Subtask 1: 0 / 6
• Subtask 2: 0 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 8
• Subtask 5: 0 / 46