結果
問題 | No.2325 Skill Tree |
ユーザー |
![]() |
提出日時 | 2023-05-28 14:09:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 661 ms / 3,000 ms |
コード長 | 1,997 bytes |
コンパイル時間 | 4,200 ms |
コンパイル使用メモリ | 259,120 KB |
最終ジャッジ日時 | 2025-02-13 10:57:51 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h>using namespace std;#include <atcoder/all>using namespace atcoder;using ll = long long;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<ll>;using VVL = vector<VL>;using VD = vector<double>;using VVD = vector<VD>;using VS = vector<string>;using P = pair<ll,ll>;using VP = vector<P>;#define rep(i, n) for (ll i = 0; i < ll(n); i++)#define out(x) cout << x << endl#define dout(x) cout << fixed << setprecision(10) << x << endl#define all(a) (a).begin(),(a).end()#define rall(a) (a).rbegin(),(a).rend()#define sz(x) (int)(x.size())#define re0 return 0#define pcnt __builtin_popcountlltemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }constexpr int inf = 1e9;constexpr ll INF = 1e18;//using mint = modint1000000007;//using mint = modint998244353;int di[4] = {1,0,-1,0};int dj[4] = {0,1,0,-1};int main(){ll n;cin >> n;VL a(n),l(n);VVL g(n);for(int i = 1;i < n;i++){cin >> l[i] >> a[i];a[i]--;g[a[i]].push_back(i);}VL dp(n,INF);VL seen(n);dp[0] = 0;queue<int> que;que.push(0);while(!que.empty()){int i = que.front();que.pop();for(auto j:g[i]){if(seen[j] == 0){seen[j] = 1;dp[j] = l[j];}chmax(dp[j],dp[i]);que.push(j);}}VL x = dp;sort(all(x));ll cnt = 0;rep(i,n) if(x[i] != INF) cnt++;ll q;cin >> q;rep(qi,q){ll t,y;cin >> t >> y;if(t == 1){auto itr = upper_bound(all(x),y);ll ans = itr-x.begin();chmin(ans,cnt);out(ans);}if(t == 2){y--;ll ans = dp[y];if(ans == INF) ans = -1;out(ans);}}}