Submission #1317005

#	Time	Username	Problem	Language	Result	Execution time	Memory
1317005		aaaaaaaa	Regions (IOI09_regions)	C++20	24 / 100	2857 ms	196608 KiB

regions

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const int mxN = 2e5 + 10;
const int mxR = 25005;
const int B = 205;
vector<int> adj[mxN], rnode[mxR];
pbds region[mxR];
int r[mxN], st[mxN], en[mxN], id[mxR], ans[B][mxN], tin = -1;
void dfs(int u = 1){
    st[u] = ++tin;
    for(auto it : adj[u]){
        dfs(it);
    }
    en[u] = tin;
}
void dfs2(int par = 0, int u = 1){
    ans[par][r[u]] += 1;
    for(auto it : adj[u]) dfs2(par, it);
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);
    int n, k, q, cnt = 0;
    cin >> n >> k >> q >> r[1];
    for(int i = 2, p; i <= n; ++i){
        cin >> p >> r[i];
        adj[p].push_back(i);
    }
    dfs();
    for(int i = 1; i <= n; ++i){
        region[r[i]].insert(st[i]);
        rnode[r[i]].push_back(i);
    }
    for(int i = 1; i <= k; ++i){
        if((int) rnode[i].size() >= B){
            id[i] = cnt++;
            dfs2(id[i], i);
        }
        id[i] = -1;
    }
    while(q--){
        int r1, r2;
        cin >> r1 >> r2;
        if((int) rnode[r1].size() >= B){
            cout << ans[id[r1]][r2] << endl;
        }else{
            int ans = 0;
            for(auto it : rnode[r1]){
                ans += region[r2].order_of_key(en[it] + 1) - region[r2].order_of_key(st[it]);
            }
            cout << ans << endl;
        }
    }
    return 0;
}

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