結果

問題 No.2325 Skill Tree
ユーザー 👑 AngrySadEight
提出日時 2023-05-28 14:05:29
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 671 ms / 3,000 ms
コード長 4,319 bytes
コンパイル時間 18,775 ms
コンパイル使用メモリ 270,744 KB
最終ジャッジ日時 2025-02-13 10:47:47
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <ctime>
#include <utility>
#include <random>
#include <tuple>
#include <bitset>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>
template<typename T> void debug(T e){
cerr << e << endl;
}
template<typename T> void debug(vector<T> &v){
rep(i, v.size()){
cerr << v[i] << " ";
}
cerr << endl;
}
template<typename T> void debug(vector<vector<T>> &v){
rep(i, v.size()){
rep(j, v[i].size()){
cerr << v[i][j] << " ";
}
cerr << endl;
}
}
template<typename T> void debug(vector<pair<T, T>> &v){
rep(i,v.size()){
cerr << v[i].first << " " << v[i].second << endl;
}
}
template<typename T> void debug(set<T> &st){
for (auto itr = st.begin(); itr != st.end(); itr++){
cerr << *itr << " ";
}
cerr << endl;
}
template<typename T> void debug(multiset<T> &ms){
for (auto itr = ms.begin(); itr != ms.end(); itr++){
cerr << *itr << " ";
}
cerr << endl;
}
template<typename T> void debug(map<T, T> &mp){
for (auto itr = mp.begin(); itr != mp.end(); itr++){
cerr << itr->first << " " << itr->second << endl;
}
}
void debug_out(){
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << H << " ";
debug_out(T...);
}
ll my_pow(ll x, ll n, ll mod){
// x^nmod
ll ret;
if (n == 0){
ret = 1;
}
else if (n % 2 == 1){
ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
}
else{
ret = my_pow((x * x) % mod, n / 2, mod);
}
return ret;
}
ll inv(ll x, ll mod){
return my_pow(x, mod - 2, mod);
}
int main(){
ll N;
cin >> N;
vl L(N);
vl A(N);
for (ll i = 1; i < N; i++){
cin >> L[i] >> A[i];
A[i]--;
}
vvl graph(N, vl(0));
vl count(N, 0);
for (ll i = 1; i < N; i++){
graph[A[i]].push_back(i);
count[i]++;
}
//debug(graph);
ll INF = 100000000000000000;
vl dp(N, INF);
dp[0] = 0;
queue<ll> que;
for (ll i = 0; i < N; i++){
if (count[i] == 0) que.push(i);
}
while (que.size()){
ll p = que.front();
que.pop();
for (ll i = 0; i < graph[p].size(); i++){
ll val = graph[p][i];
count[val]--;
if (count[val] == 0){
dp[val] = max(L[val], dp[p]);
que.push(val);
}
}
}
vl vec(0);
for (ll i = 0; i < N; i++){
vec.push_back(dp[i]);
}
sort(all(vec));
//debug(vec);
ll Q;
cin >> Q;
for (ll i = 0; i < Q; i++){
ll t, d;
cin >> t >> d;
if (t == 1){
auto itr = lower_bound(all(vec), d + 1);
ll idx = itr - vec.begin();
cout << idx << endl;
}
else{
d--;
if (dp[d] == INF){
cout << -1 << endl;
}
else{
cout << dp[d] << endl;
}
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0