結果
問題 | No.2325 Skill Tree |
ユーザー |
![]() |
提出日時 | 2023-05-28 14:39:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 158 ms / 3,000 ms |
コード長 | 3,529 bytes |
コンパイル時間 | 1,319 ms |
コンパイル使用メモリ | 131,860 KB |
最終ジャッジ日時 | 2025-02-13 11:51:26 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#ifndef LOCAL #define FAST_IO #endif // ============ #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cmath> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> #define OVERRIDE(a, b, c, d, ...) d #define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i) #define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i) #define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__) #define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i) #define ALL(x) begin(x), end(x) using namespace std; using u32 = unsigned int; using u64 = unsigned long long; using i32 = signed int; using i64 = signed long long; using f64 = double; using f80 = long double; template <typename T> using Vec = vector<T>; template <typename T> bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template <typename T> bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } template <typename T> Vec<tuple<i32, i32, T>> runlength(const Vec<T> &a) { if (a.empty()) { return Vec<tuple<i32, i32, T>>(); } Vec<tuple<i32, i32, T>> ret; i32 prv = 0; REP(i, 1, a.size()) { if (a[i - 1] != a[i]) { ret.emplace_back(prv, i, a[i - 1]); prv = i; } } ret.emplace_back(prv, (i32)a.size(), a.back()); return ret; } #ifdef INT128 using u128 = __uint128_t; using i128 = __int128_t; istream &operator>>(istream &is, i128 &x) { i64 v; is >> v; x = v; return is; } ostream &operator<<(ostream &os, i128 x) { os << (i64)x; return os; } istream &operator>>(istream &is, u128 &x) { u64 v; is >> v; x = v; return is; } ostream &operator<<(ostream &os, u128 x) { os << (u64)x; return os; } #endif [[maybe_unused]] constexpr i32 INF = 1000000100; [[maybe_unused]] constexpr i64 INF64 = 3000000000000000100; struct SetUpIO { SetUpIO() { #ifdef FAST_IO ios::sync_with_stdio(false); cin.tie(nullptr); #endif cout << fixed << setprecision(15); } } set_up_io; // ============ #ifdef DEBUGF #else #define DBG(x) (void)0 #endif int main() { i32 n; cin >> n; Vec<i32> l(n, 0), a(n, 0); REP(i, 1, n) { cin >> l[i] >> a[i]; --a[i]; } Vec<Vec<i32>> g(n); REP(i, 1, n) { g[a[i]].push_back(i); g[i].push_back(a[i]); } Vec<i32> ok(n, 0); const auto dfs = [&](const auto &dfs, i32 v, i32 p) -> void { ok[v] = 1; for (i32 u : g[v]) { if (u != p) { chmax(l[u], l[v]); dfs(dfs, u, v); } } }; dfs(dfs, 0, -1); Vec<i32> lvs; REP(i, n) { if (ok[i]) { lvs.push_back(l[i]); } } sort(ALL(lvs)); i32 q; cin >> q; while (q--) { i32 type; cin >> type; if (type == 1) { i32 x; cin >> x; cout << (upper_bound(ALL(lvs), x) - lvs.begin()) << '\n'; } else { i32 x; cin >> x; --x; if (!ok[x]) { cout << -1 << '\n'; } else { cout << l[x] << '\n'; } } } }