# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
261897 | 2020-08-12T07:31:21 Z | patrikpavic2 | Mergers (JOI19_mergers) | C++17 | 115 ms | 32496 KB |
#include <cstdio> #include <vector> #define PB push_back using namespace std; const int N = 5e5 + 500; vector < int > v[N]; vector < int > koji[N]; int A[N], kol[N], siz[N], sol, bio[N], bla, n; int dfs(int x, int lst){ koji[x].PB(A[x]); siz[x] = 1; int dolje = 0; for(int y : v[x]){ if(y == lst) continue; dolje += dfs(y, x); siz[x] += siz[y]; if(koji[y].size() > koji[x].size()) swap(koji[x], koji[y]); for(int k : koji[y]) koji[x].PB(k); } int ja = 0; for(int k : koji[x]) if(!bio[k]) bio[k] = 1, ja += kol[k]; for(int k : koji[x]) bio[k] = 0; if(ja == siz[x]){ sol += (dolje - (x != lst) + 1) / 2; dolje = 1; } return dolje; } int main(){ scanf("%d%d", &n, &bla); for(int i = 1;i < n;i++){ int x, y; scanf("%d%d", &x, &y); v[x].PB(y), v[y].PB(x); } for(int i = 1;i <= n;i++) scanf("%d", A + i), kol[A[i]]++; dfs(1, 1); printf("%d\n", sol); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 23808 KB | Output is correct |
2 | Correct | 15 ms | 23808 KB | Output is correct |
3 | Correct | 16 ms | 23936 KB | Output is correct |
4 | Correct | 15 ms | 23808 KB | Output is correct |
5 | Correct | 15 ms | 23808 KB | Output is correct |
6 | Correct | 15 ms | 23808 KB | Output is correct |
7 | Correct | 15 ms | 23808 KB | Output is correct |
8 | Correct | 15 ms | 23808 KB | Output is correct |
9 | Correct | 18 ms | 23808 KB | Output is correct |
10 | Correct | 15 ms | 23808 KB | Output is correct |
11 | Correct | 18 ms | 23808 KB | Output is correct |
12 | Incorrect | 16 ms | 23936 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 23808 KB | Output is correct |
2 | Correct | 15 ms | 23808 KB | Output is correct |
3 | Correct | 16 ms | 23936 KB | Output is correct |
4 | Correct | 15 ms | 23808 KB | Output is correct |
5 | Correct | 15 ms | 23808 KB | Output is correct |
6 | Correct | 15 ms | 23808 KB | Output is correct |
7 | Correct | 15 ms | 23808 KB | Output is correct |
8 | Correct | 15 ms | 23808 KB | Output is correct |
9 | Correct | 18 ms | 23808 KB | Output is correct |
10 | Correct | 15 ms | 23808 KB | Output is correct |
11 | Correct | 18 ms | 23808 KB | Output is correct |
12 | Incorrect | 16 ms | 23936 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 23808 KB | Output is correct |
2 | Correct | 15 ms | 23808 KB | Output is correct |
3 | Correct | 16 ms | 23936 KB | Output is correct |
4 | Correct | 15 ms | 23808 KB | Output is correct |
5 | Correct | 15 ms | 23808 KB | Output is correct |
6 | Correct | 15 ms | 23808 KB | Output is correct |
7 | Correct | 15 ms | 23808 KB | Output is correct |
8 | Correct | 15 ms | 23808 KB | Output is correct |
9 | Correct | 18 ms | 23808 KB | Output is correct |
10 | Correct | 15 ms | 23808 KB | Output is correct |
11 | Correct | 18 ms | 23808 KB | Output is correct |
12 | Incorrect | 16 ms | 23936 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 93 ms | 31760 KB | Output is correct |
2 | Correct | 115 ms | 32496 KB | Output is correct |
3 | Incorrect | 18 ms | 24192 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 23808 KB | Output is correct |
2 | Correct | 15 ms | 23808 KB | Output is correct |
3 | Correct | 16 ms | 23936 KB | Output is correct |
4 | Correct | 15 ms | 23808 KB | Output is correct |
5 | Correct | 15 ms | 23808 KB | Output is correct |
6 | Correct | 15 ms | 23808 KB | Output is correct |
7 | Correct | 15 ms | 23808 KB | Output is correct |
8 | Correct | 15 ms | 23808 KB | Output is correct |
9 | Correct | 18 ms | 23808 KB | Output is correct |
10 | Correct | 15 ms | 23808 KB | Output is correct |
11 | Correct | 18 ms | 23808 KB | Output is correct |
12 | Incorrect | 16 ms | 23936 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |