# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99063 | 2019-02-28T08:47:04 Z | 구재현(#2854, gs14004) | Unique Cities (JOI19_ho_t5) | C++17 | 176 ms | 3264 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2005; using lint = long long; using pi = pair<int, int>; vector<int> gph[MAXN]; vector<int> v[MAXN]; int n, m, c[MAXN]; void dfs(int x, int p, int d){ if(d > 0) v[d].push_back(c[x]); for(auto &i : gph[x]){ if(i != p) dfs(i, x, d + 1); } } int main(){ scanf("%d %d",&n,&m); for(int i=1; i<n; i++){ int s, e; scanf("%d %d",&s,&e); gph[s].push_back(e); gph[e].push_back(s); } for(int i=1; i<=n; i++) scanf("%d",&c[i]); for(int i=1; i<=n; i++){ for(int j=0; j<=n; j++) v[j].clear(); dfs(i, -1, 0); int chk[MAXN] = {}; for(int j=0; j<=n; j++){ if(v[j].size() == 1) chk[v[j][0]] = 1; } printf("%d\n", count(chk, chk + MAXN, 1)); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 76 ms | 504 KB | Output is correct |
3 | Correct | 22 ms | 512 KB | Output is correct |
4 | Correct | 95 ms | 760 KB | Output is correct |
5 | Correct | 99 ms | 596 KB | Output is correct |
6 | Correct | 133 ms | 700 KB | Output is correct |
7 | Correct | 102 ms | 640 KB | Output is correct |
8 | Correct | 100 ms | 592 KB | Output is correct |
9 | Correct | 113 ms | 760 KB | Output is correct |
10 | Correct | 94 ms | 768 KB | Output is correct |
11 | Correct | 136 ms | 512 KB | Output is correct |
12 | Correct | 79 ms | 636 KB | Output is correct |
13 | Correct | 129 ms | 640 KB | Output is correct |
14 | Correct | 112 ms | 1528 KB | Output is correct |
15 | Correct | 136 ms | 1328 KB | Output is correct |
16 | Correct | 48 ms | 512 KB | Output is correct |
17 | Correct | 148 ms | 3264 KB | Output is correct |
18 | Correct | 104 ms | 1656 KB | Output is correct |
19 | Correct | 102 ms | 512 KB | Output is correct |
20 | Correct | 119 ms | 768 KB | Output is correct |
21 | Correct | 120 ms | 764 KB | Output is correct |
22 | Correct | 97 ms | 512 KB | Output is correct |
23 | Correct | 101 ms | 640 KB | Output is correct |
24 | Correct | 118 ms | 756 KB | Output is correct |
25 | Correct | 98 ms | 636 KB | Output is correct |
26 | Correct | 62 ms | 512 KB | Output is correct |
27 | Correct | 176 ms | 640 KB | Output is correct |
28 | Correct | 144 ms | 3192 KB | Output is correct |
29 | Correct | 100 ms | 1656 KB | Output is correct |
30 | Correct | 55 ms | 572 KB | Output is correct |
31 | Correct | 111 ms | 3192 KB | Output is correct |
32 | Correct | 125 ms | 1528 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 768 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 76 ms | 504 KB | Output is correct |
3 | Correct | 22 ms | 512 KB | Output is correct |
4 | Correct | 95 ms | 760 KB | Output is correct |
5 | Correct | 99 ms | 596 KB | Output is correct |
6 | Correct | 133 ms | 700 KB | Output is correct |
7 | Correct | 102 ms | 640 KB | Output is correct |
8 | Correct | 100 ms | 592 KB | Output is correct |
9 | Correct | 113 ms | 760 KB | Output is correct |
10 | Correct | 94 ms | 768 KB | Output is correct |
11 | Correct | 136 ms | 512 KB | Output is correct |
12 | Correct | 79 ms | 636 KB | Output is correct |
13 | Correct | 129 ms | 640 KB | Output is correct |
14 | Correct | 112 ms | 1528 KB | Output is correct |
15 | Correct | 136 ms | 1328 KB | Output is correct |
16 | Correct | 48 ms | 512 KB | Output is correct |
17 | Correct | 148 ms | 3264 KB | Output is correct |
18 | Correct | 104 ms | 1656 KB | Output is correct |
19 | Correct | 102 ms | 512 KB | Output is correct |
20 | Correct | 119 ms | 768 KB | Output is correct |
21 | Correct | 120 ms | 764 KB | Output is correct |
22 | Correct | 97 ms | 512 KB | Output is correct |
23 | Correct | 101 ms | 640 KB | Output is correct |
24 | Correct | 118 ms | 756 KB | Output is correct |
25 | Correct | 98 ms | 636 KB | Output is correct |
26 | Correct | 62 ms | 512 KB | Output is correct |
27 | Correct | 176 ms | 640 KB | Output is correct |
28 | Correct | 144 ms | 3192 KB | Output is correct |
29 | Correct | 100 ms | 1656 KB | Output is correct |
30 | Correct | 55 ms | 572 KB | Output is correct |
31 | Correct | 111 ms | 3192 KB | Output is correct |
32 | Correct | 125 ms | 1528 KB | Output is correct |
33 | Runtime error | 4 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
34 | Halted | 0 ms | 0 KB | - |