結果
問題 | No.2325 Skill Tree |
ユーザー |
|
提出日時 | 2023-05-28 14:19:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 441 ms / 3,000 ms |
コード長 | 4,054 bytes |
コンパイル時間 | 2,203 ms |
コンパイル使用メモリ | 207,568 KB |
最終ジャッジ日時 | 2025-02-13 11:15:15 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
/*** author: shu8Cream* created: 28.05.2023 12:45:17**/#include <bits/stdc++.h>using namespace std;#define overload3(a,b,c,d,...) d#define rep1(i,n) for (int i=0; i<(n); i++)#define rep2(i,a,n) for (int i=(a); i<(n); i++)#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)#define rrep1(i,n) for (int i=(n-1); i>=0; i--)#define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--)#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define sz(x) int((x).size())#define pcnt __builtin_popcountllusing ll = long long;using P = pair<ll,ll>;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;using vi = vc<ll>;using vvi = vv<ll>;const int INF = 1e9;const ll LINF = 8e18;template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}template<class T> inline bool chmax(T& a, T b) {if(a<b) { a=b;return true; } return false;}template<class T> inline bool chmin(T& a, T b) {if(a>b) { a=b;return true; } return false;}// stable sorttemplate <typename T>vc<int> argsort(const vc<T> &A) {vc<int> ids(sz(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(sz(I));rep(i, sz(I)) B[i] = A[I[i]];return B;}template <typename T, typename U>vc<T> cumsum(vc<U> &A, int off = 1) {vc<T> B(sz(A) + 1);rep(i, sz(A)) B[i + 1] = B[i] + A[i];if (off == 0) B.erase(B.begin());return B;}template <class T> string to_string(T s);template <class S, class T> string to_string(pair<S, T> p);string to_string(char c) { return string(1, c); }string to_string(string s) { return s; }string to_string(const char s[]) { return string(s); }template <class T>string to_string(T v) {if (v.empty()) return "{}";string ret = "{";for (auto x : v) ret += to_string(x) + ",";ret.back() = '}';return ret;}template <class S, class T>string to_string(pair<S, T> p) {return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";}void debug_out() { cout << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cout << to_string(H) << " ";debug_out(T...);}#ifdef _DEBUG#define debug(...) debug_out(__VA_ARGS__)#else#define debug(...)#endifint main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);ll n; cin >> n;vi L(n),A(n);vvi to(n);rep(i,1,n){cin >> L[i] >> A[i];to[A[i]-1].push_back(i);}int mx = 0;vi vis(n);auto dfs = [&](auto dfs, int s, int p=-1)->void{vis[s]=1;if(p!=-1) chmax(L[s],L[p]);for(auto nv:to[s]){if(nv==p) continue;dfs(dfs,nv,s);// in-order}// post-order};dfs(dfs,0);cerr << L << endl;vi waza;rep(i,n)if(vis[i]) waza.push_back(L[i]);sort(all(waza));sort(all(waza));int q; cin >> q;int op, x,y;rep(qi,q){cin >> op;if(op==1){cin >> x;int ans = upper_bound(all(waza),x) - waza.begin();cout << ans << endl;}if(op==2){cin >> y;if(vis[y-1]){cout<<L[y-1]<<endl;}else{cout<<-1<<endl;}}}}