結果

問題 No.2325 Skill Tree
ユーザー ponjuiceponjuice
提出日時 2023-05-28 13:51:16
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 411 ms / 3,000 ms
コード長 6,424 bytes
コンパイル時間 5,697 ms
コンパイル使用メモリ 322,632 KB
実行使用メモリ 14,644 KB
最終ジャッジ日時 2023-08-27 08:33:12
合計ジャッジ時間 20,500 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 202 ms
4,584 KB
testcase_08 AC 115 ms
6,992 KB
testcase_09 AC 219 ms
5,804 KB
testcase_10 AC 133 ms
9,996 KB
testcase_11 AC 208 ms
7,780 KB
testcase_12 AC 377 ms
12,760 KB
testcase_13 AC 372 ms
12,732 KB
testcase_14 AC 382 ms
12,840 KB
testcase_15 AC 383 ms
12,856 KB
testcase_16 AC 383 ms
12,836 KB
testcase_17 AC 376 ms
12,648 KB
testcase_18 AC 381 ms
12,836 KB
testcase_19 AC 373 ms
12,680 KB
testcase_20 AC 383 ms
12,784 KB
testcase_21 AC 375 ms
12,772 KB
testcase_22 AC 372 ms
12,732 KB
testcase_23 AC 374 ms
12,704 KB
testcase_24 AC 371 ms
12,728 KB
testcase_25 AC 372 ms
12,956 KB
testcase_26 AC 371 ms
12,652 KB
testcase_27 AC 400 ms
14,160 KB
testcase_28 AC 398 ms
14,388 KB
testcase_29 AC 410 ms
14,132 KB
testcase_30 AC 403 ms
14,224 KB
testcase_31 AC 406 ms
14,644 KB
testcase_32 AC 395 ms
14,228 KB
testcase_33 AC 392 ms
14,076 KB
testcase_34 AC 390 ms
14,484 KB
testcase_35 AC 408 ms
14,068 KB
testcase_36 AC 397 ms
14,068 KB
testcase_37 AC 411 ms
14,144 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

//高速化 
struct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;
//#define endl '\n' //インタラクティブ問題の時は消す

//型
using ll = long long;
using ld = long double;
using mint = modint998244353;//1000000007;
template<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;
using vi = vc<int>;  using vvi = vvc<int>;  using vvvi = vvvc<int>;
using vl = vc<ll>;   using vvl = vvc<ll>;   using vvvl = vvvc<ll>;
using pi = pair<int, int>;  using pl = pair<ll, ll>;
using ull = unsigned ll;
template<class T>using priq = priority_queue<T>;
template<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;

// for文
#define overload4(a, b, c, d, e, ...) e
#define rep1(n)             for(ll i = 0; i < n; i++)
#define rep2(i, n)          for(ll i = 0; i < n; i++)
#define rep3(i, a, b)       for(ll i = a; i < b; i++)
#define rep4(i, a, b, step) for(ll i = a; i < b; i+= step)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define per1(n)             for(ll i = n-1; i >= 0; i--)
#define per2(i, n)          for(ll i = n-1; i >= 0; i--)
#define per3(i, a, b)       for(ll i = b-1; i >= a; i--)
#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)
#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)
#define fore1(a)       for(auto&& i : a)	
#define fore2(i,a)     for(auto&& i : a)
#define fore3(x,y,a)   for(auto&& [x, y] : a)
#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)
#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)

//関数
#define mp make_pair
#define mt make_tuple
#define a first
#define b second
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define si(x) (ll)(x).size()
template<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}
template<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}
template<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}
template<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}
template<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}
template<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}
template<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}

//入出力(operator)
template<int T>istream&operator>>(istream&is,static_modint<T>&a){ll v;is>>v;a=v;return is;}
istream&operator>>(istream&is,modint&a){ll v;cin>>v;a=v;return is;}
template<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}
template<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}

template<int T>ostream&operator<<(ostream&os,static_modint<T>a){return os<<a.val();}
ostream&operator<<(ostream&os,modint a){return os<<a.val();}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<" "<<a.b;}
template<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<" ";return os;}
template<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<"\n";return os;}

//入出力(関数)
vi readvi(ll n){vi a(n);cin>>a;return a;}
vl readvl(ll n){vl a(n);cin>>a;return a;}
vvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);if(bidirected)g[b].pb(a);}return g;}
vvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].pb(b,c);if(bidirected)g[b].pb(a,c);}return g;}
vvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}
vvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}

inline void yes(){cout << "Yes\n";}
inline void no(){cout << "No\n";}
inline void yesno(bool y = true){if(y)yes();else no();}
inline void print(){cout<<endl;}
template<class T>inline void print(T a){cout<<a<<endl;}
template<class T,class... Ts>inline void print(T a,Ts ...b){cout<<a;(cout<<...<<(cout<<' ',b));cout<<endl;}

//定数
constexpr ll mod = 998244353;
constexpr ll minf=-(1<<29);
constexpr ll inf=(1<<29);
constexpr ll MINF=-(1LL<<60);
constexpr ll INF=(1LL<<60);
constexpr ld EPS = 1e-8;
const ld PI = acosl(-1);
#define equals(a, b) (abs((a) - (b)) < EPS)
const int dx[4] ={-1, 0, 1, 0};
const int dy[4] ={ 0, 1, 0,-1};
const int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};
const int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};

void solve();
int main() {
	int t = 1;
    // cin >>t;
    while(t--)solve();
}

template<class T>
vector<pair<T, int>> RLE(vector<T> a){
    vector<pair<T, int>> res;
    for (int l = 0; l < a.size();) {
        int r = l + 1;
        for (; r < a.size() && a[l] == a[r]; r++) {};
        res.emplace_back(a[l], r - l);
        l = r;
    }
    return res;
}

void solve(){
    int n;
    cin>>n;
    vvc<pi> g(n);
    rep(i,1,n){
        int l,a;
        cin >> l >> a;
        g[a-1].emplace_back(i,l);
    }
    vi ans(n,-1);
    ans[0] = 0;
    queue<int>saw;
    saw.push(0);
    while(si(saw)){
        int pos = saw.front();
        saw.pop();
        rep(i,si(g[pos])){
            ans[g[pos][i].a] = max(ans[pos],g[pos][i].b);
            saw.push(g[pos][i].a);
        }
    }
    vi v;
    rep(i,si(ans)){
        if(ans[i] != -1){
            v.emplace_back(ans[i]);
        }
    }
    sort(all(v));
    vc<pi> rle = RLE(v);
    vc<pi> lans = {{0,1}};
    rep(i,1,si(rle)){
        lans.emplace_back(rle[i].a,lans.back().b+rle[i].b);
    }


    int q;
    cin>>q;
    rep(i,q){
        int t,x;
        cin>>t>>x;
        if(t == 1){
            auto itr = lower_bound(all(lans),mp(x+1,0));
            itr--;
            print(itr->second);
        }else{
            print(ans[x-1]);
        }
    }

}
0