제출 #1071856

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1071856		ArthuroWich	Regions (IOI09_regions)	C++17	85 / 100	8029 ms	29008 KiB

regions

#include <bits/stdc++.h>
using namespace std;
vector<int> adj[300005], reg[25005], regst[25005];
int st[300005], en[300005], timer = 0;
void dfs(int i, int p) {
    st[i] = timer;
    timer++;
    for (int j : adj[i]) {
        if (j == p) {
            continue;
        }
        dfs(j, i);
    }
    en[i] = timer;
}
void solve() {
    int n, r, q;
    cin >> n >> r >> q;
    for (int i = 1; i <= n; i++) {
        int s, h;
        if (i == 1) {
            cin >> h;
            reg[h].push_back(i);
        } else {
            cin >> s >> h;
            reg[h].push_back(i);
            adj[s].push_back(i);
            adj[i].push_back(s);
        }
    }
    dfs(1, -1);
    for (int i = 1; i <= r; i++) {
        for (int j : reg[i]) {
            regst[i].push_back(st[j]);
        }
        sort(regst[i].begin(), regst[i].end());
    }
    while(q--) {
        int a, b, ans = 0;
        cin >> a >> b;
        for (int i : reg[a]) {
            int l, r;
            l = upper_bound(regst[b].begin(), regst[b].end(), st[i]) - regst[b].begin();
            r = lower_bound(regst[b].begin(), regst[b].end(), en[i]) - regst[b].begin();
            ans += r-l;
        }
        cout << ans << endl;
    }
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

• Subtask 1: 15 / 15
• Subtask 2: 70 / 85