제출 #1213715

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1213715		thelegendary08	Passport (JOI23_passport)	C++17	40 / 100	2120 ms	1114112 KiB

passport

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
struct segtree{
	vi tree;
	int n;
	segtree(int N){
		n = N; tree.resize(n * 4 + 5);
		f0r(i, tree.size())tree[i] = 4e18;
	}
	void update(int k, int x){
		k += n; tree[k] = x;
		for(k/=2; k>=1; k/=2)tree[k] = min(tree[k*2], tree[k*2+1]);
	}
	int quer(int l, int r){
		if(l > r)return 4e18;
		l += n; r += n; int ret = 4e18;
		while(l <= r){
			if(l % 2 == 1)ret = min(ret, tree[l++]);
			if(r % 2 == 0)ret = min(ret, tree[r--]);
			l/=2; r/=2;
		}
		return ret;
	}
};
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	vpii v(n);
	vector<vpii>x(n);
	vector<vpii>y(n);
	vector<vector<vector<int>>> ful(n, vvi(n));
	f0r(i,n){
		cin>>v[i].first>>v[i].second;
		v[i].first--; v[i].second--;
		x[v[i].first].pb(mp(v[i].second, i));
		y[v[i].second].pb(mp(v[i].first, i));
		ful[v[i].first][v[i].second].pb(i);
	}
	
	vector<segtree>fixy;
	vector<segtree>fixx;
	f0r(i,n){
		fixy.pb(segtree(n));
		fixx.pb(segtree(n));
	}
	in(q);
	while(q--){
		in(X);
		X--;
		vvi dp(n, vi(n, 4e18));
		dp[v[X].first][v[X].second] = 1;
		FOR(l, 1, n+1){
			f0r(i, n - l + 1){
				//i to i + l - 1
				for(auto u : x[i]){
					if(u.first <= i + l - 1){
						//transition from [j, i+l-1], where j can take [i+1, u.second]
						dp[i][i + l - 1] = min(dp[i][i + l - 1], fixy[i+l-1].quer(i+1, u.second) + 1);
					}
				}
				for(auto u : y[i + l - 1]){
					if(u.first >= i){
						dp[i][i+l-1] = min(dp[i][i+l-1], fixx[i].quer(u.second, i+l-2) + 1);
					}
				}
				
				for(auto u : ful[i][i+l-1]){
					for(int j = i + 1; j <= u; j++){
						dp[i][i+l-1] = min(dp[i][i+l-1], fixx[j].quer(u, i+l-2) + 1);
					}
				}
				
				fixx[i].update(i+l-1, dp[i][i+l-1]);
				fixy[i+l-1].update(i, dp[i][i+l-1]);
			}
		}
		/*
		f0r(i, n){
			f0r(j,n){
				cout<<dp[i][j]<<' ';
			}
			cout<<'\n';
		}
		*/
		if(dp[0][n-1] == 4e18)out(-1);
		else out(dp[0][n-1]);
	}
}

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