| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 33995 | minhtung0404 | 스파이 (JOI13_spy) | C++14 | 249 ms | 18008 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
const int N = 2005;
using namespace std;
vector <int> adj[2][N];
int n, q, a, b, root[2];
int bit[N][N], st[N][2], en[2][N], cnt;
void update(int x, int y, int val){
    for (int i = x; i <= n; i+=i&(-i)){
        for (int j = y; j <= n; j+=j&(-j)){
            bit[i][j] += val;
        }
    }
}
int get(int x, int y){
    int val = 0;
    for (int i = x; i > 0; i -= i&(-i)){
        for (int j = y; j > 0; j -= j&(-j)){
            val += bit[i][j];
        }
    }
    return val;
}
void dfs(int u, int p, bool num){
    st[u][num] = ++cnt;
    for (int i = 0; i < adj[num][u].size(); i++){
        int v = adj[num][u][i];
        if (v == p) continue;
        dfs(v, u, num);
    }
    en[u][num] = cnt;
}
int main(){
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; i++){
        scanf("%d%d", &a, &b);
        if (a != 0) adj[0][a].push_back(i);
        else root[0] = i;
        if (b != 0) adj[1][b].push_back(i);
        else root[1] = i;
    }
    cnt = 0; dfs(root[0], root[0], 0); cnt = 0; dfs(root[1], root[1], 1);
    while (q--){
        scanf("%d%d", &a, &b);
        update(st[a][0], st[b][1], 1); update(st[a][0], en[b][1]+1, -1); update(en[a][0]+1, st[b][1], -1); update(en[a][0]+1, en[b][1]+1, 1);
    }
    for (int i = 1; i <= n; i++){
        printf("%d\n", get(st[i][0], st[i][1]));
    }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
