oj.uz

Submission #946931

# Submission time Handle Problem Language Result Execution time Memory
946931 2024-03-15T07:46:45 Z emptypringlescan Meetings (JOI19_meetings) C++17
100 / 100
 483 ms 1232 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[2005];
int sz[2005],del[2005];
void dfssize(int x, int p){
	sz[x]=1;
	for(int i:adj[x]){
		if(i==p||del[i]) continue;
		dfssize(i,x);
		sz[x]+=sz[i];
	}
}
int find_cent(int x, int p, int tsz){
	for(int i:adj[x]){
		if(i==p||del[i]) continue;
		if(sz[i]>tsz/2) return find_cent(i,x,tsz);
	}
	return x;
}
bool cmp(int a, int b){
	if(del[a]==0&&del[b]==1) return true;
	else if(del[a]==1&&del[b]==0) return false;
	return sz[a]>sz[b];
}
void Solve(int n){
	mt19937 rng(177013);
	int arr[n];
	for(int i=0; i<n; i++) arr[i]=i;
	shuffle(arr,arr+n,rng);
	adj[arr[0]].push_back(arr[1]);
	adj[arr[1]].push_back(arr[0]);
	for(int i=2; i<n; i++){
		if(!adj[arr[i]].empty()) continue;
		for(int j=0; j<=n; j++) sz[j]=0,del[j]=0;
		int cur=arr[0];
		while(true){
			dfssize(cur,-1);
			cur=find_cent(cur,-1,sz[cur]);
			dfssize(cur,-1);
			sort(adj[cur].begin(),adj[cur].end(),cmp);
			if(adj[cur].empty()||del[adj[cur][0]]){
				adj[cur].push_back(arr[i]);
				adj[arr[i]].push_back(cur);
				break;
			}
			if(adj[cur].size()>=2&&!del[adj[cur][1]]){
				int x=Query(arr[i],adj[cur][0],adj[cur][1]);
				if(x==adj[cur][0]){
					del[cur]=1;
					cur=adj[cur][0];
					continue;
				}
				else if(x==adj[cur][1]){
					del[cur]=1;
					cur=adj[cur][1];
					continue;
				}
				else if(x==cur){
					del[adj[cur][0]]=1;
					del[adj[cur][1]]=1;
					continue;
				}
				else if(x==arr[i]){
					if(Query(arr[i],cur,adj[cur][0])==arr[i]){
						int y=adj[cur][0];
						for(int j=0; j<(int)adj[y].size(); j++){
							if(adj[y][j]==cur){
								adj[y][j]=arr[i];
								break;
							}
						}
						adj[cur][0]=arr[i];
						adj[arr[i]].push_back(cur);
						adj[arr[i]].push_back(y);
					}
					else{
						int y=adj[cur][1];
						for(int j=0; j<(int)adj[y].size(); j++){
							if(adj[y][j]==cur){
								adj[y][j]=arr[i];
								break;
							}
						}
						adj[cur][1]=arr[i];
						adj[arr[i]].push_back(cur);
						adj[arr[i]].push_back(y);
					}
					break;
				}
				else{
					adj[x].push_back(arr[i]);
					adj[arr[i]].push_back(x);
					if(Query(x,cur,adj[cur][0])==x){
						int y=adj[cur][0];
						for(int j=0; j<(int)adj[y].size(); j++){
							if(adj[y][j]==cur){
								adj[y][j]=x;
								break;
							}
						}
						adj[cur][0]=x;
						adj[x].push_back(cur);
						adj[x].push_back(y);
					}
					else{
						int y=adj[cur][1];
						for(int j=0; j<(int)adj[y].size(); j++){
							if(adj[y][j]==cur){
								adj[y][j]=x;
								break;
							}
						}
						adj[cur][1]=x;
						adj[x].push_back(cur);
						adj[x].push_back(y);
					}
					break;
				}
			}
			else{
				int x=Query(arr[i],cur,adj[cur][0]);
				if(x==adj[cur][0]){
					del[cur]=1;
					cur=adj[cur][0];
					continue;
				}
				else if(x==cur){
					adj[cur].push_back(arr[i]);
					adj[arr[i]].push_back(cur);
					break;
				}
				else if(x==arr[i]){
					int y=adj[cur][0];
					for(int j=0; j<(int)adj[y].size(); j++){
						if(adj[y][j]==cur){
							adj[y][j]=arr[i];
							break;
						}
					}
					adj[cur][0]=arr[i];
					adj[arr[i]].push_back(cur);
					adj[arr[i]].push_back(y);
				}
				else{
					adj[x].push_back(arr[i]);
					adj[arr[i]].push_back(x);
					int y=adj[cur][0];
					for(int j=0; j<(int)adj[y].size(); j++){
						if(adj[y][j]==cur){
							adj[y][j]=x;
							break;
						}
					}
					adj[cur][0]=x;
					adj[x].push_back(cur);
					adj[x].push_back(y);
				}
				break;
			}
		}
	}
	for(int i=0; i<n; i++){
		for(int j:adj[i]){
			if(j>i){
				//cout << i << ' ' << j << '\n';
				Bridge(i,j);
			}
		}
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 4 ms 344 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 3 ms 344 KB Output is correct
32 Correct 4 ms 344 KB Output is correct
33 Correct 6 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 10 ms 584 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 6 ms 600 KB Output is correct
39 Correct 6 ms 600 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 720 KB Output is correct
2 Correct 189 ms 848 KB Output is correct
3 Correct 195 ms 848 KB Output is correct
4 Correct 189 ms 728 KB Output is correct
5 Correct 158 ms 748 KB Output is correct
6 Correct 155 ms 848 KB Output is correct
7 Correct 262 ms 712 KB Output is correct
8 Correct 320 ms 1232 KB Output is correct
9 Correct 317 ms 848 KB Output is correct
10 Correct 297 ms 972 KB Output is correct
11 Correct 334 ms 848 KB Output is correct
12 Correct 232 ms 808 KB Output is correct
13 Correct 191 ms 848 KB Output is correct
14 Correct 253 ms 764 KB Output is correct
15 Correct 217 ms 848 KB Output is correct
16 Correct 234 ms 768 KB Output is correct
17 Correct 330 ms 848 KB Output is correct
18 Correct 218 ms 1104 KB Output is correct
19 Correct 214 ms 848 KB Output is correct
20 Correct 233 ms 848 KB Output is correct
21 Correct 239 ms 848 KB Output is correct
22 Correct 232 ms 768 KB Output is correct
23 Correct 239 ms 1104 KB Output is correct
24 Correct 220 ms 740 KB Output is correct
25 Correct 224 ms 740 KB Output is correct
26 Correct 217 ms 1000 KB Output is correct
27 Correct 219 ms 760 KB Output is correct
28 Correct 353 ms 1104 KB Output is correct
29 Correct 315 ms 848 KB Output is correct
30 Correct 296 ms 848 KB Output is correct
31 Correct 312 ms 852 KB Output is correct
32 Correct 483 ms 1112 KB Output is correct
33 Correct 354 ms 880 KB Output is correct
34 Correct 3 ms 344 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 4 ms 344 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 4 ms 344 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 8 ms 600 KB Output is correct
42 Correct 7 ms 580 KB Output is correct
43 Correct 3 ms 344 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 6 ms 600 KB Output is correct
46 Correct 6 ms 600 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct