제출 #1158807

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158807		CodeLakVN	Regions (IOI09_regions)	C++20	100 / 100	2640 ms	36200 KiB

regions

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

#define task "REGIONS"
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)

const int N = (int)2e5 + 5;
int BLOCK;

int numNode, numQuery, numRegions;
int region[N];
vector<int> adj[N];

int timer = 0;
int in[N], out[N];
vector<pair<int, int>> employee[N];

void dfs(int u, int p) {
    in[u] = ++timer;
    employee[region[u]].push_back({in[u], u});
    for (int v : adj[u]) if (v != p) 
        dfs(v, u);
    out[u] = timer;
}

int id[25005];
int ans[500][25005];

void prepare(int u, int p, int curRegion, int counter) {
    counter += (region[u] == curRegion);
    for (int v : adj[u]) if (v != p) {
        ans[id[curRegion]][region[v]] += counter;
        prepare(v, u, curRegion, counter);
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> numNode >> numRegions >> numQuery;
    cin >> region[1];
    FOR(i, 2, numNode) {
        int p;
        cin >> p >> region[i];
        adj[p].push_back(i);
    }

    dfs(1, -1);

    BLOCK = (int)sqrt(numNode);
    int cnt = 0;
    FOR(r, 1, numRegions) {
        employee[r].push_back({(int)1e9, 0});
        if ((int)employee[r].size() < BLOCK) continue;
        id[r] = ++cnt;
        prepare(1, -1, r, 0);
    }

    while (numQuery--) {
        int r1, r2;
        cin >> r1 >> r2;
        if ((int)employee[r1].size() >= BLOCK) cout << ans[id[r1]][r2] << endl;
        else {
            int res = 0;
            for (auto [t, u] : employee[r1]) {
                if (u == 0) break;
                res += upper_bound(employee[r2].begin(), employee[r2].end(), make_pair(out[u], N)) - upper_bound(employee[r2].begin(), employee[r2].end(), make_pair(in[u], N)); 
            }
            cout << res << endl;
        }
    }

    return 0;
}

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