結果

問題 No.2325 Skill Tree
ユーザー 👑 deuteridayodeuteridayo
提出日時 2023-05-28 14:11:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 592 ms / 3,000 ms
コード長 2,877 bytes
コンパイル時間 4,742 ms
コンパイル使用メモリ 267,064 KB
実行使用メモリ 14,684 KB
最終ジャッジ日時 2023-08-27 09:13:42
合計ジャッジ時間 24,072 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
9,360 KB
testcase_01 AC 4 ms
9,324 KB
testcase_02 AC 5 ms
9,376 KB
testcase_03 AC 4 ms
9,288 KB
testcase_04 AC 5 ms
9,132 KB
testcase_05 AC 6 ms
9,360 KB
testcase_06 AC 5 ms
9,348 KB
testcase_07 AC 266 ms
9,944 KB
testcase_08 AC 176 ms
11,232 KB
testcase_09 AC 295 ms
10,356 KB
testcase_10 AC 220 ms
12,052 KB
testcase_11 AC 302 ms
11,324 KB
testcase_12 AC 538 ms
13,244 KB
testcase_13 AC 543 ms
13,272 KB
testcase_14 AC 538 ms
13,268 KB
testcase_15 AC 540 ms
13,248 KB
testcase_16 AC 538 ms
13,328 KB
testcase_17 AC 534 ms
13,368 KB
testcase_18 AC 530 ms
13,584 KB
testcase_19 AC 523 ms
13,276 KB
testcase_20 AC 527 ms
13,588 KB
testcase_21 AC 532 ms
13,212 KB
testcase_22 AC 546 ms
13,332 KB
testcase_23 AC 548 ms
13,264 KB
testcase_24 AC 551 ms
13,304 KB
testcase_25 AC 546 ms
13,440 KB
testcase_26 AC 546 ms
13,276 KB
testcase_27 AC 590 ms
14,684 KB
testcase_28 AC 578 ms
14,572 KB
testcase_29 AC 586 ms
14,500 KB
testcase_30 AC 587 ms
14,684 KB
testcase_31 AC 581 ms
14,496 KB
testcase_32 AC 570 ms
14,648 KB
testcase_33 AC 563 ms
14,548 KB
testcase_34 AC 553 ms
14,572 KB
testcase_35 AC 581 ms
14,496 KB
testcase_36 AC 588 ms
14,548 KB
testcase_37 AC 592 ms
14,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include"bits/stdc++.h"
#include"atcoder/all"
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod107 = 1e9+7;
using mint107 = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define al(x) x.begin(),x.end()

struct edge{
    int to;
};
using graph = vector<vec<int>>;


	graph g(200000);
	vec<lint>L(200000,-1);
	vec<bool>went(200000,false);
	
lint f(int l,lint x){
	if(went[l])return 0;
	went[l]=true;
	L[l]=max(L[l],x);
	for(int v:g[l])f(v,L[l]);
	return 0;
}
	
int main(){
	lint n;
	cin>>n;
	repp(i,1,n){
		lint l,a;
		cin>>l>>a;
		a--;
		g[a].pb(i);
		L[i]=l;
	}
	f(0,0);
	vec<lint>S;
	rep(i,n){
		if(went[i])S.pb(L[i]);
	}
	sort(al(S));
	lint q;cin>>q;
	rep(i,q){
		int t;lint x;
		cin>>t>>x;
		if(t==1){
			auto it=upper_bound(al(S),x);
			cout<<it-S.begin()<<endl;
		}else{
			x--;
			if(went[x])cout<<L[x]<<endl;
			else cout<<-1<<endl;
		}
	}
}
0