제출 #1306453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306453		ender_shayan	Passport (JOI23_passport)	C++20	0 / 100	2 ms	572 KiB

passport

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;

ll inf=1e18;
const int N=2500+100,L=21,bs=701,NN=1e6;
int B[N],C[N],D[N],E[N],n,m,k,q,pre[N],dist[N],vis[N];
vector<int>g[N];
pii A[N];
int dp[N][N],mn[N][N],mx[N][N];
int seg[N][N*4];
int main(){
    fast_io
    cin>>n;
    for1(n)for(int j=1;j<=n;j++)dp[i][j]=N;
    for1(n){
        cin>>A[i].F>>A[i].S;
        mn[i][i]=A[i].F;
        mx[i][i]=A[i].S;
    }
    dp[1][n]=0;
    for(int d=1;d<n;d++){
        for(int l=1;l<=n-d;l++){
            int r=l+d;
            mn[l][r]=min(mn[l][r-1],mn[l+1][r]);
            mx[l][r]=max(mx[l][r-1],mx[l+1][r]);
        }
    }
    for(int d=n-2;d>=0;d--){
        for(int l=1;l<=n-d;l++){
            int r=l+d;
            for(int i=l;i<=r;i++)
                dp[l][r]=min(dp[l][r],dp[A[i].F][A[i].S]+1);
        }
    }
    cin>>q;
    while(q--){
        int i;cin>>i;
        cout<<(dp[i][i]==N ? -1:dp[i][i])<<endl;
    }




}

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