oj.uz

답안 #99064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
99064 2019-02-28T08:48:57 Z 조승현(#2855, ainta) Unique Cities (JOI19_ho_t5) C++17
4 / 100
 117 ms 640 KB 
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int n, m, w[2010], D[2010], C[2010], v[2010];
vector<int>E[2010];
void DFS(int a, int pp, int d) {
	D[a] = d;
	for (auto &x : E[a]) {
		if (x != pp)DFS(x, a, d + 1);
	}
}
int main() {
	scanf("%d%d",&n,&m);
	int i, a, b, j;
	for (i = 1; i < n; i++) {
		scanf("%d%d", &a, &b);
		E[a].push_back(b);
		E[b].push_back(a);
	}
	for (i = 1; i <= n; i++) {
		scanf("%d", &w[i]);
	}
	for (i = 1; i <= n; i++) {
		DFS(i,0,0);
		for (j = 1; j <= n; j++) {
			if (i != j) {
				C[D[j]]++;
			}
		}
		for (j = 1; j <= n; j++) {
			if (C[D[j]] == 1) {
				v[w[j]] = 1;
			}
		}
		int r = 0;
		for (j = 1; j <= n; j++) {
			r += v[j];
			C[j] = v[j] = 0;
		}
		printf("%d\n", r);
	}
}

Compilation message

joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t5.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &w[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 64 ms 640 KB Output is correct
3 Correct 19 ms 384 KB Output is correct
4 Correct 64 ms 632 KB Output is correct
5 Correct 70 ms 384 KB Output is correct
6 Correct 117 ms 572 KB Output is correct
7 Correct 91 ms 588 KB Output is correct
8 Correct 66 ms 484 KB Output is correct
9 Correct 82 ms 504 KB Output is correct
10 Correct 71 ms 384 KB Output is correct
11 Correct 88 ms 384 KB Output is correct
12 Correct 67 ms 512 KB Output is correct
13 Correct 96 ms 512 KB Output is correct
14 Correct 75 ms 512 KB Output is correct
15 Correct 86 ms 512 KB Output is correct
16 Correct 44 ms 512 KB Output is correct
17 Correct 99 ms 636 KB Output is correct
18 Correct 74 ms 604 KB Output is correct
19 Correct 71 ms 504 KB Output is correct
20 Correct 103 ms 512 KB Output is correct
21 Correct 86 ms 512 KB Output is correct
22 Correct 50 ms 364 KB Output is correct
23 Correct 113 ms 512 KB Output is correct
24 Correct 87 ms 492 KB Output is correct
25 Correct 75 ms 492 KB Output is correct
26 Correct 53 ms 536 KB Output is correct
27 Correct 113 ms 512 KB Output is correct
28 Correct 75 ms 580 KB Output is correct
29 Correct 67 ms 512 KB Output is correct
30 Correct 44 ms 384 KB Output is correct
31 Correct 81 ms 512 KB Output is correct
32 Correct 79 ms 512 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 64 ms 640 KB Output is correct
3 Correct 19 ms 384 KB Output is correct
4 Correct 64 ms 632 KB Output is correct
5 Correct 70 ms 384 KB Output is correct
6 Correct 117 ms 572 KB Output is correct
7 Correct 91 ms 588 KB Output is correct
8 Correct 66 ms 484 KB Output is correct
9 Correct 82 ms 504 KB Output is correct
10 Correct 71 ms 384 KB Output is correct
11 Correct 88 ms 384 KB Output is correct
12 Correct 67 ms 512 KB Output is correct
13 Correct 96 ms 512 KB Output is correct
14 Correct 75 ms 512 KB Output is correct
15 Correct 86 ms 512 KB Output is correct
16 Correct 44 ms 512 KB Output is correct
17 Correct 99 ms 636 KB Output is correct
18 Correct 74 ms 604 KB Output is correct
19 Correct 71 ms 504 KB Output is correct
20 Correct 103 ms 512 KB Output is correct
21 Correct 86 ms 512 KB Output is correct
22 Correct 50 ms 364 KB Output is correct
23 Correct 113 ms 512 KB Output is correct
24 Correct 87 ms 492 KB Output is correct
25 Correct 75 ms 492 KB Output is correct
26 Correct 53 ms 536 KB Output is correct
27 Correct 113 ms 512 KB Output is correct
28 Correct 75 ms 580 KB Output is correct
29 Correct 67 ms 512 KB Output is correct
30 Correct 44 ms 384 KB Output is correct
31 Correct 81 ms 512 KB Output is correct
32 Correct 79 ms 512 KB Output is correct
33 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -