oj.uz

Submission #34953

# Submission time Handle Problem Language Result Execution time Memory
34953 2017-11-17T08:50:45 Z bql20000 스파이 (JOI13_spy) C++14
10 / 100
 119 ms 5508 KB 
#include <bits/stdc++.h>

#define ff(i,a,b)       for(int i=(a), _b=(b); i <= _b; ++i)
#define gg(i,a,b)       for(int i=(a), _b=(b); i >= _b; --i)
#define REP(i ,b)       for(int i=(0), _b=(b); i <  _b; ++i)
#define long            long long
#define ALL(v)          v.begin(), v.end()
#define endl            '\n'
#define Love(a)         {cerr << #a << " = " << a << endl;}
#define _               << " , " <<
#define X               first
#define Y               second

#define NAME            "spy"

using namespace std;
const int N = 2007;

int n, Q, rootA, rootB, cnt[N], pb[N], ans[N];
vector <int> a[N], b[N], c[N];

void Enter() {
    cin >> n >> Q;
    ff(i, 1, n) {
        int p1, p2;
        cin >> p1 >> p2;
        if (p1 == 0) rootA = i;
        if (p2 == 0) rootB = i;
        a[p1].push_back(i);
        b[p2].push_back(i);
    }
    ff(i, 1, Q) {
        int r, b;
        cin >> r >> b;
        c[r].push_back(b);
    }
}

void DFSB(int u) {
    for (int v : b[u]) {
        pb[v] = u;
        DFSB(v);
    }
}

void DFSA(int u) {
    for (int x : c[u]) cnt[x]++;
    for (int i = u; i; i = pb[i]) ans[u] += cnt[i];

    for (int v : a[u]) DFSA(v);

    for (int x : c[u]) cnt[x]--;
}

void Process() {
    DFSB(rootB);
    DFSA(rootA);
    ff(i, 1, n) cout << ans[i] << endl;
}

int main() {
    ios_base::sync_with_stdio(0);  cin.tie(0);
   // freopen(NAME".inp", "r", stdin);
    //freopen(NAME".out", "w", stdout);
    Enter();
    Process();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2340 KB Output is correct
2 Correct 0 ms 2340 KB Output is correct
3 Correct 0 ms 2340 KB Output is correct
4 Correct 0 ms 2340 KB Output is correct
5 Correct 0 ms 2340 KB Output is correct
6 Correct 0 ms 2340 KB Output is correct
7 Correct 0 ms 2340 KB Output is correct
8 Correct 0 ms 2340 KB Output is correct
9 Correct 0 ms 2340 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2472 KB Output is correct
2 Runtime error 6 ms 2472 KB Execution killed because of forbidden syscall writev (20)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Runtime error 119 ms 5508 KB Execution killed because of forbidden syscall writev (20)
2 Halted 0 ms 0 KB -