oj.uz

Submission #99717

# Submission time Handle Problem Language Result Execution time Memory
99717 2019-03-06T08:19:57 Z cki86201 Unique Cities (JOI19_ho_t5) C++11
4 / 100
 130 ms 16460 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_set>
#include <bitset>
#include <time.h>
#include <limits.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
typedef tuple<int, int, int> t3;

int N, M;
vector <int> E[2020];
int C[2020];
int dis[2020][2020];

int main() {
	scanf("%d%d", &N, &M);
	if(N > 2000) return 0;
	for(int i=1;i<N;i++) {
		int x, y; scanf("%d%d", &x, &y);
		E[x].pb(y); E[y].pb(x);
	}
	for(int i=1;i<=N;i++) scanf("%d", C + i);
	for(int i=1;i<=N;i++) {
		for(int j=1;j<=N;j++) dis[i][j] = -1;
		dis[i][i] = 0;
		vector <int> q;
		q.pb(i);
		rep(a, szz(q)) {
			int t = q[a];
			for(int e : E[t]) if(dis[i][e] == -1) {
				dis[i][e] = dis[i][t] + 1;
				q.pb(e);
			}
		}
		int cnt[2020] = {}, er[2020] = {};
		for(int j=1;j<=N;j++) cnt[dis[i][j]]++;
		int ans = 0;
		for(int j=1;j<=N;j++) if(j != i && cnt[dis[i][j]] == 1) {
			if(er[C[j]] == 0) er[C[j]] = 1, ++ans;
		}
		printf("%d\n", ans);
	}
	return 0;
}

Compilation message

joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:38: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:41:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y; scanf("%d%d", &x, &y);
             ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:44:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=N;i++) scanf("%d", C + i);
                        ~~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 98 ms 15028 KB Output is correct
3 Correct 31 ms 7800 KB Output is correct
4 Correct 83 ms 14920 KB Output is correct
5 Correct 118 ms 16316 KB Output is correct
6 Correct 119 ms 16324 KB Output is correct
7 Correct 112 ms 16248 KB Output is correct
8 Correct 91 ms 16460 KB Output is correct
9 Correct 107 ms 16248 KB Output is correct
10 Correct 100 ms 16248 KB Output is correct
11 Correct 111 ms 16340 KB Output is correct
12 Correct 64 ms 16376 KB Output is correct
13 Correct 128 ms 16248 KB Output is correct
14 Correct 123 ms 16344 KB Output is correct
15 Correct 111 ms 16368 KB Output is correct
16 Correct 66 ms 16372 KB Output is correct
17 Correct 110 ms 16228 KB Output is correct
18 Correct 120 ms 16308 KB Output is correct
19 Correct 126 ms 16288 KB Output is correct
20 Correct 129 ms 16424 KB Output is correct
21 Correct 104 ms 16268 KB Output is correct
22 Correct 96 ms 16248 KB Output is correct
23 Correct 123 ms 16316 KB Output is correct
24 Correct 108 ms 16376 KB Output is correct
25 Correct 115 ms 16288 KB Output is correct
26 Correct 72 ms 16348 KB Output is correct
27 Correct 130 ms 16224 KB Output is correct
28 Correct 101 ms 16248 KB Output is correct
29 Correct 105 ms 16220 KB Output is correct
30 Correct 64 ms 16348 KB Output is correct
31 Correct 95 ms 16232 KB Output is correct
32 Correct 89 ms 16248 KB Output is correct

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 98 ms 15028 KB Output is correct
3 Correct 31 ms 7800 KB Output is correct
4 Correct 83 ms 14920 KB Output is correct
5 Correct 118 ms 16316 KB Output is correct
6 Correct 119 ms 16324 KB Output is correct
7 Correct 112 ms 16248 KB Output is correct
8 Correct 91 ms 16460 KB Output is correct
9 Correct 107 ms 16248 KB Output is correct
10 Correct 100 ms 16248 KB Output is correct
11 Correct 111 ms 16340 KB Output is correct
12 Correct 64 ms 16376 KB Output is correct
13 Correct 128 ms 16248 KB Output is correct
14 Correct 123 ms 16344 KB Output is correct
15 Correct 111 ms 16368 KB Output is correct
16 Correct 66 ms 16372 KB Output is correct
17 Correct 110 ms 16228 KB Output is correct
18 Correct 120 ms 16308 KB Output is correct
19 Correct 126 ms 16288 KB Output is correct
20 Correct 129 ms 16424 KB Output is correct
21 Correct 104 ms 16268 KB Output is correct
22 Correct 96 ms 16248 KB Output is correct
23 Correct 123 ms 16316 KB Output is correct
24 Correct 108 ms 16376 KB Output is correct
25 Correct 115 ms 16288 KB Output is correct
26 Correct 72 ms 16348 KB Output is correct
27 Correct 130 ms 16224 KB Output is correct
28 Correct 101 ms 16248 KB Output is correct
29 Correct 105 ms 16220 KB Output is correct
30 Correct 64 ms 16348 KB Output is correct
31 Correct 95 ms 16232 KB Output is correct
32 Correct 89 ms 16248 KB Output is correct
33 Incorrect 3 ms 384 KB Output isn't correct
34 Halted 0 ms 0 KB -