Submission #29477002

---

Source Code Expand

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
// using P = pair<ll,ll>;
using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

vvint graph;
vint score;
vvint child;
const int MAX_KTH = 20;

void dfs(int x, int p) {
    child[x].push_back(score[x]);

    for (int nx : graph[x]) {
        if (nx == p) continue;
        dfs(nx, x);
        for (int i = 1; i <= min((int)child[nx].size(), MAX_KTH); i++) {
            child[x].push_back(child[nx][i-1]);
        }
    }

    sort(rall(child[x]));
}

void solve() {
    int n, q;
    cin >> n >> q;
    score.resize(n);
    child.resize(n);
    rep(i,n) cin >> score[i];

    graph.resize(n);

    rep(i,n-1) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    dfs(0, -1);

    rep(i,q) {
        int v, k;
        cin >> v >> k;
        v--, k--;
        cout << child[v][k] << endl;
    }

}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result