結果

問題 No.2325 Skill Tree
ユーザー EtisEtis
提出日時 2023-05-28 14:11:07
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 169 ms / 3,000 ms
コード長 5,814 bytes
コンパイル時間 7,184 ms
コンパイル使用メモリ 269,808 KB
実行使用メモリ 15,456 KB
最終ジャッジ日時 2024-12-26 23:51:41
合計ジャッジ時間 12,859 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 43 ms
5,248 KB
testcase_08 AC 41 ms
8,320 KB
testcase_09 AC 50 ms
6,784 KB
testcase_10 AC 59 ms
11,976 KB
testcase_11 AC 61 ms
9,344 KB
testcase_12 AC 162 ms
15,324 KB
testcase_13 AC 169 ms
15,328 KB
testcase_14 AC 168 ms
15,336 KB
testcase_15 AC 160 ms
15,328 KB
testcase_16 AC 118 ms
15,328 KB
testcase_17 AC 109 ms
15,332 KB
testcase_18 AC 111 ms
15,324 KB
testcase_19 AC 116 ms
15,328 KB
testcase_20 AC 112 ms
15,320 KB
testcase_21 AC 111 ms
15,332 KB
testcase_22 AC 120 ms
15,452 KB
testcase_23 AC 115 ms
15,324 KB
testcase_24 AC 117 ms
15,328 KB
testcase_25 AC 116 ms
15,324 KB
testcase_26 AC 120 ms
15,456 KB
testcase_27 AC 134 ms
14,496 KB
testcase_28 AC 143 ms
14,688 KB
testcase_29 AC 134 ms
14,488 KB
testcase_30 AC 137 ms
14,700 KB
testcase_31 AC 150 ms
14,708 KB
testcase_32 AC 131 ms
14,712 KB
testcase_33 AC 138 ms
14,564 KB
testcase_34 AC 124 ms
14,568 KB
testcase_35 AC 144 ms
14,568 KB
testcase_36 AC 154 ms
14,576 KB
testcase_37 AC 152 ms
14,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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

//local debug
#ifdef LOCAL
#include <debug_print.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif

#define overload4(a, b, c, d, e, ...) e

//alias
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using mint = modint998244353;
using Mint = modint1000000007;

//constants
constexpr const long long MOD = 998244353;
constexpr const long long MODM = 1000000007;
constexpr const int INF = 1e9;
constexpr const ll LINF = 1e18;

//rep(for-loop) macro
#define rep2(i, n) for(ll i = 0; i < n; i++)
#define rep3(i, k, n) for(ll i = k; i < n; i++)
#define rep4(i, k, n, a) for(ll i = k; i < n; i += a)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2)(__VA_ARGS__)
#define rep1_2(i, n) for(ll i = 1; i <= n; i++)
#define rep1_3(i, k, n) for(ll i = k; i <= n; i++)
#define rep1_4(i, k, n, a) for(ll i = k; i <= n; i += a)
#define rep1(...) overload4(__VA_ARGS__, rep1_4, rep1_3, rep1_2)(__VA_ARGS__)
#define Rep2(i, n) for(ll i = n - 1; i >= 0; i--)
#define Rep3(i, k, n) for(ll i = n - 1; i >= k; i--)
#define Rep4(i, k, n, a) for(ll i = n - 1; i >= k; i -= a) 
#define Rep(...) overload4(__VA_ARGS__, Rep4, Rep3, Rep2)(__VA_ARGS__)
#define Rep1_2(i, n) for(ll i = n; i >= 1; i--)
#define Rep1_3(i, k, n) for(ll i = n; i >= k; i--)
#define Rep1_4(i, k, n, a) for(ll i = n; i >= k; i -= a) 
#define Rep1(...) overload4(__VA_ARGS__, Rep1_4, Rep1_3, Rep1_2)(__VA_ARGS__)
#define vfor(v, x) for(auto x : v)
#define mfor(map) for(auto &[key, value] : map)

//vector macro
#define vvecc(T, name, n, m) vector<vector<T>> name(n, vector<T>(m))
#define vvec(T, name, n) vector<vector<T>> name(n)
#define vvecs(T, name, n, m, s) vector<vector<T>> name(n, vector<T>(m, s))
#define all(x) begin(x), end(x)
#define LB(v, x) distance((v).begin(), lower_bound(all(v), (x)))
#define UB(v, x) distance((v).begin(), upper_bound(all(v), (x)))

//data structure macro
#define ef emplace_front
#define eb emplace_back
#define pf pop_front
#define pb pop_back
#define mp make_pair
#define fi first
#define se second
#define mt make_tuple
#define get(t, x) get<x - 1>(t)
#define lb lower_bound
#define ub upper_bound
template<class T> using pq = priority_queue<T>;
template<class T> using pqmin = priority_queue<T, vector<T>, greater<T>>;
template<class T, class U> using pqp = priority_queue<pair<T, U>>;
template<class T, class U> using pqpmin = priority_queue<pair<T, U>, vector<pair<T, U>>, greater<pair<T,U>>>;

//output
#define pl() cout << '\n'
template<class T> void print(const T& a) {cout << a;}
void printl(){}
template<class T> void printl(const T& t){print(t); pl();}
template<class Head, class... Tail> void printl(const Head& head, const Tail&... tail) {print(head); cout << " "; printl(tail...);}
template<class T> void fin(const T& t) {printl(t); exit(0);}
void Yes(bool a) {cout << (a ? "Yes" : "No") << '\n';}
template<class T, class U> void Out2(bool a, T yes, U no) {if(a) printl(yes); else printl(no);}

//functions
int ctoi(char c) {return c - '0';}
char to_char(int x) {return x + '0';}
template<class... T> constexpr auto Emin(T... a) {return min(initializer_list<common_type_t<T...>>{a...});}
template<class... T> constexpr auto Emax(T... a) {return max(initializer_list<common_type_t<T...>>{a...});}
template<class T, class U> bool chmax(T &a, const U &b) {if (a < b) { a = b; return true;} return false;}
template<class T, class U> bool chmin(T &a, const U &b) {if (a > b) { a = b; return true;} return false;}
template<class T, class U> ll Epow(T x, U y) {ll ans = 1; for(int i = 0; i < y; i++) ans *= x; return ans;}
template<class T, class U> ll Eceil(T x, U y) {return (ll)ceil((ld)x / (ld)y);}
template<class T, class U> ll Efloor(T x, U y) {return (ll)floor((ld)x / (ld)y);}
template<class T, class U> bool check_bit(T tar, U bit) {return ((tar & Epow(2, bit)) != 0);}

/*Graph Library*/
using Graph = vector<vector<int>>;
#define affix(v, a, b) v[a].emplace_back(b)

//辺の重みが1の時のstartから各点への距離を求める - O(N + M)
vector<int> BFS(int start, Graph &G) {
    vector<int> dist(G.size(), -1);
    queue<int> bfs;
    dist[start] = 0;
    bfs.push(start);
    while(!bfs.empty()) {
        int v = bfs.front(); bfs.pop();
        for(int next : G[v]) {
            if(dist[next] != -1)
            continue;
            dist[next] = dist[v] + 1;
            bfs.push(next);
        }
    }
    return dist;
}

//---------------------------------------------------------------------------------------------------
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(10);

    int N;
    cin >> N;
    vector<pair<int, int>> skill(N + 1);
    rep1(i, 2, N) cin >> skill[i].fi >> skill[i].se;
    int Q;
    cin >> Q;

    vector<vector<int>> G(N + 1);
    rep1(i, 2, N) {
        int v1 = i, v2 = skill[i].se;
        affix(G, v2, v1);
    }

    vector<int> need_lv(N + 1, INF);
    need_lv[1] = 0;
    queue<int> bfs;
    bfs.push(1);
    while(!bfs.empty()) {
        int v = bfs.front(); bfs.pop();
        int need = need_lv[v];
        for(auto next : G[v]) {
            need_lv[next] = Emax(skill[next].fi, need);
            bfs.push(next);
        }
    }

    vector<int> lvs;
    rep1(i, N) lvs.eb(need_lv[i]);
    sort(all(lvs));

    while(Q--) {
        int QR, x;
        cin >> QR >> x;
        
        if(QR == 1) printl(UB(lvs, x));
        if(QR == 2) Out2(need_lv[x] == INF, -1, need_lv[x]);
    }
}
0