oj.uz

Submission #722446

# Submission time Handle Problem Language Result Execution time Memory
722446 2023-04-12T02:33:04 Z Abrar_Al_Samit Meetings 2 (JOI21_meetings2) C++17
20 / 100
 398 ms 126236 KB 
#include<bits/stdc++.h>
using namespace std;

const int nax = 4002;

vector<int>g[nax];
int n;
int ans[nax];
int sub[nax][nax];
int dist[nax][nax];

int dfs(int v, int r, int p = 0) {
	sub[r][v] = 1;
	if(p) dist[r][v] = dist[r][p] + 1;

	for(int u: g[v]) if(u!=p) {
		sub[r][v] += dfs(u, r, v);
	}
	return sub[r][v];
}
void PlayGround() {
	cin>>n;
	for(int i=0; i<n-1; ++i) {
		int u, v;
		cin>>u>>v;
		g[u].push_back(v);
		g[v].push_back(u);
	}

	for(int r=1; r<=n; ++r) {
		dfs(r, r);
	}
	for(int i=1; i<=n; ++i) {
		for(int j=i+1; j<=n; ++j) {
			int sz = min(sub[i][j], sub[j][i]) * 2;
			ans[sz] = max(ans[sz], dist[i][j]+1);
		}
	}


	int mx = 0;
	for(int i=n; i>0; --i) {
		if(i&1) ans[i] = 1;
		else {
			mx = max(mx, ans[i]);
			ans[i] = mx;
		}
	}
	for(int i=1; i<=n; ++i) {
		cout<<max(1, ans[i])<<'\n';
	}

	// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	PlayGround();
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 552 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 552 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 382 ms 125432 KB Output is correct
23 Correct 369 ms 125456 KB Output is correct
24 Correct 372 ms 124088 KB Output is correct
25 Correct 360 ms 124564 KB Output is correct
26 Correct 355 ms 124460 KB Output is correct
27 Correct 368 ms 125900 KB Output is correct
28 Correct 384 ms 126084 KB Output is correct
29 Correct 390 ms 125868 KB Output is correct
30 Correct 384 ms 126028 KB Output is correct
31 Correct 380 ms 125888 KB Output is correct
32 Correct 398 ms 126208 KB Output is correct
33 Correct 349 ms 126236 KB Output is correct
34 Correct 349 ms 125972 KB Output is correct
35 Correct 244 ms 125904 KB Output is correct
36 Correct 300 ms 125900 KB Output is correct
37 Correct 249 ms 125856 KB Output is correct
38 Correct 306 ms 126060 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 552 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 382 ms 125432 KB Output is correct
23 Correct 369 ms 125456 KB Output is correct
24 Correct 372 ms 124088 KB Output is correct
25 Correct 360 ms 124564 KB Output is correct
26 Correct 355 ms 124460 KB Output is correct
27 Correct 368 ms 125900 KB Output is correct
28 Correct 384 ms 126084 KB Output is correct
29 Correct 390 ms 125868 KB Output is correct
30 Correct 384 ms 126028 KB Output is correct
31 Correct 380 ms 125888 KB Output is correct
32 Correct 398 ms 126208 KB Output is correct
33 Correct 349 ms 126236 KB Output is correct
34 Correct 349 ms 125972 KB Output is correct
35 Correct 244 ms 125904 KB Output is correct
36 Correct 300 ms 125900 KB Output is correct
37 Correct 249 ms 125856 KB Output is correct
38 Correct 306 ms 126060 KB Output is correct
39 Runtime error 3 ms 688 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -