結果

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

ソースコード

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

#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using ll = long long;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
template <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;
}
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 62;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend std::ostream &operator<<(std::ostream &os, const ModInt &p) { return os << p.x; }
friend std::istream &operator>>(std::istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
constexpr int mod = (int)1e9 + 7;
using mint = ModInt<mod>;
ll power(ll x, ll n, ll p) {
if (n == 0) {
return 1 % p;
}
if (n % 2 == 0) {
return power(x * x % p, n / 2, p);
} else {
return x * power(x, n - 1, p) % p;
}
}
void solve() {
int n;
cin >> n;
std::vector<int> L(n), A(n), deg(n);
std::vector<std::vector<int>> g(n);
for (int i = 1; i < n; i++) {
cin >> L[i] >> A[i];
A[i] -= 1;
g[A[i]].emplace_back(i);
deg[i] += 1;
}
std::vector<int> min_level(n), visited(n);
std::queue<int> q;
q.emplace(0);
min_level[0] = 0;
std::map<int, int> mp;
while (not q.empty()) {
const int cur = q.front();
q.pop();
visited[cur] = true;
chmax(min_level[cur], L[cur]);
mp[min_level[cur]] += 1;
for (const auto &nxt : g[cur]) {
chmax(min_level[nxt], min_level[cur]);
deg[nxt] -= 1;
if (deg[nxt] == 0)
q.emplace(nxt);
}
}
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
if (itr != mp.begin()) {
auto prev = std::prev(itr);
itr->second += prev->second;
}
}
int kkt;
cin >> kkt;
while (kkt--) {
int t;
cin >> t;
if (t == 1) {
int x;
cin >> x;
auto itr = mp.upper_bound(x);
if (itr == mp.begin()) {
cout << "0"
<< "\n";
} else {
itr = std::prev(itr);
cout << itr->second << "\n";
}
} else {
int y;
cin >> y;
y -= 1;
if (not visited[y]) {
cout << -1 << "\n";
} else {
cout << min_level[y] << "\n";
}
}
}
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int I_love_KKT89 = 1;
// cin >> I_love_KKT89;
for (int Case = 1; Case <= I_love_KKT89; ++Case) {
// cout << "Case #" << Case << ": ";
solve();
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0