oj.uz

Submission #513841

# Submission time Handle Problem Language Result Execution time Memory
513841 2022-01-17T17:22:32 Z fatemetmhr Meetings (JOI19_meetings) C++17
100 / 100
 1127 ms 12616 KB 
//  ~Be name khoda~  //

#include "meetings.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
#define cl       clear
#define endll    '\n'

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   +  7;
const ll  inf   =  2e18;

int n, per[maxn5];
vector <int> adj[maxn5], tmp, av;
int mx[maxn5], sz[maxn5], rev[maxn5];
bool rem[maxn5], mark[maxn5];
int lev = 0;

inline void remo(int a, int b){
	tmp.clear();
	for(auto u : adj[a]) 
		if(u != b) tmp.pb(u);
	adj[a].clear();
	for(auto u : tmp)
		adj[a].pb(u);
	return;
}

inline void dfs(int v, int par){
	sz[v] = 1;
	mx[v] = 0;
	av.pb(v);
	for(auto u : adj[v]) if(u != par && !rem[u]){
		dfs(u, v);
		mx[v] = max(mx[v], sz[u]);
		sz[v] += sz[u];
	}
	return;
}


inline void add(int r, int v){
	lev++;
	//cout << "adding " << r << ' ' << v << endl;
	av.clear();
	dfs(r, -1);
	int c = r;
	for(auto u : av)
		if(max(mx[u], int(av.size()) - sz[u]) < max(mx[c], int(av.size()) - sz[c]))
			c = u;
	int sub = -1;
	//cout << "centroid " << c << endl;
	assert(lev <= 11);
	for(auto uu : adj[c]) if(!rem[uu]){
		int u = uu;
		int t = Query(per[c], per[u], per[v]);
		t = rev[t];
		if(t == v){
			//cout << "right " << u << endl;
			remo(u, c);
			remo(c, u);
			adj[u].pb(v);
			adj[c].pb(v);
			adj[v].pb(u);
			adj[v].pb(c);
			return;
		}
		else if(t == u){
			sub = u;
			break;
		}
		else if(t != c){
			remo(u, c);
			remo(c, u);
			adj[u].pb(t);
			adj[v].pb(t);
			adj[c].pb(t);
			adj[t].pb(u);
			adj[t].pb(c);
			adj[t].pb(v);
			mark[t] = true;
			return;
		}
	}
	//cout << "ok " << sub << endl;
	if(sub != -1){
		rem[c] = true;
		add(sub, v);
		return;
	}
	adj[c].pb(v);
	adj[v].pb(c);
}

void Solve(int nn){
	n = nn;
	for(int i = 0; i < n; i++){
		per[i] = i;
	}
	shuffle(per, per + n, rng);
	for(int i = 0; i < n; i++){
		rev[per[i]] = i;
		//cout << i << ' ' << per[i] << endl;
	}
	for(int i = 1; i < n; i++) if(!mark[i]){
		fill(rem, rem + n + 5, false);
		lev = 0;
		add(0, i);
		mark[i] = true;
	}
	for(int i = 0; i < n; i++) for(auto u : adj[i]){
		//cout << "edge " << i << ' '<< u << ' ' << per[i] << ' ' << per[u] << endl;
		if(per[i] < per[u]) Bridge(per[i], per[u]);
	}
	return;
}

/*
4
0 3
2 3
1 3
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12104 KB Output is correct
2 Correct 6 ms 12092 KB Output is correct
3 Correct 6 ms 12104 KB Output is correct
4 Correct 6 ms 12080 KB Output is correct
5 Correct 6 ms 12064 KB Output is correct
6 Correct 6 ms 12060 KB Output is correct
7 Correct 6 ms 12104 KB Output is correct
8 Correct 6 ms 12044 KB Output is correct
9 Correct 6 ms 12104 KB Output is correct
10 Correct 6 ms 12104 KB Output is correct
11 Correct 6 ms 12104 KB Output is correct
12 Correct 6 ms 12128 KB Output is correct
13 Correct 6 ms 12104 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12104 KB Output is correct
2 Correct 6 ms 12092 KB Output is correct
3 Correct 6 ms 12104 KB Output is correct
4 Correct 6 ms 12080 KB Output is correct
5 Correct 6 ms 12064 KB Output is correct
6 Correct 6 ms 12060 KB Output is correct
7 Correct 6 ms 12104 KB Output is correct
8 Correct 6 ms 12044 KB Output is correct
9 Correct 6 ms 12104 KB Output is correct
10 Correct 6 ms 12104 KB Output is correct
11 Correct 6 ms 12104 KB Output is correct
12 Correct 6 ms 12128 KB Output is correct
13 Correct 6 ms 12104 KB Output is correct
14 Correct 6 ms 12128 KB Output is correct
15 Correct 7 ms 12104 KB Output is correct
16 Correct 6 ms 12104 KB Output is correct
17 Correct 7 ms 12104 KB Output is correct
18 Correct 6 ms 12104 KB Output is correct
19 Correct 6 ms 12104 KB Output is correct
20 Correct 7 ms 12104 KB Output is correct
21 Correct 8 ms 12104 KB Output is correct
22 Correct 7 ms 12104 KB Output is correct
23 Correct 7 ms 12104 KB Output is correct
24 Correct 7 ms 12104 KB Output is correct
25 Correct 6 ms 12104 KB Output is correct
26 Correct 7 ms 12104 KB Output is correct
27 Correct 12 ms 12164 KB Output is correct
28 Correct 12 ms 12168 KB Output is correct
29 Correct 13 ms 12104 KB Output is correct
30 Correct 12 ms 12104 KB Output is correct
31 Correct 16 ms 12104 KB Output is correct
32 Correct 13 ms 12104 KB Output is correct
33 Correct 19 ms 12148 KB Output is correct
34 Correct 19 ms 12164 KB Output is correct
35 Correct 18 ms 12164 KB Output is correct
36 Correct 12 ms 12160 KB Output is correct
37 Correct 17 ms 12168 KB Output is correct
38 Correct 15 ms 12176 KB Output is correct
39 Correct 17 ms 12164 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 588 ms 12368 KB Output is correct
2 Correct 635 ms 12460 KB Output is correct
3 Correct 643 ms 12492 KB Output is correct
4 Correct 600 ms 12464 KB Output is correct
5 Correct 525 ms 12372 KB Output is correct
6 Correct 472 ms 12472 KB Output is correct
7 Correct 616 ms 12456 KB Output is correct
8 Correct 789 ms 12380 KB Output is correct
9 Correct 697 ms 12400 KB Output is correct
10 Correct 630 ms 12612 KB Output is correct
11 Correct 738 ms 12396 KB Output is correct
12 Correct 700 ms 12480 KB Output is correct
13 Correct 695 ms 12484 KB Output is correct
14 Correct 735 ms 12520 KB Output is correct
15 Correct 765 ms 12492 KB Output is correct
16 Correct 845 ms 12484 KB Output is correct
17 Correct 688 ms 12372 KB Output is correct
18 Correct 736 ms 12476 KB Output is correct
19 Correct 796 ms 12528 KB Output is correct
20 Correct 999 ms 12380 KB Output is correct
21 Correct 1127 ms 12464 KB Output is correct
22 Correct 1104 ms 12452 KB Output is correct
23 Correct 999 ms 12444 KB Output is correct
24 Correct 1002 ms 12488 KB Output is correct
25 Correct 939 ms 12480 KB Output is correct
26 Correct 877 ms 12452 KB Output is correct
27 Correct 924 ms 12492 KB Output is correct
28 Correct 819 ms 12488 KB Output is correct
29 Correct 672 ms 12608 KB Output is correct
30 Correct 654 ms 12460 KB Output is correct
31 Correct 729 ms 12396 KB Output is correct
32 Correct 931 ms 12492 KB Output is correct
33 Correct 697 ms 12616 KB Output is correct
34 Correct 18 ms 12104 KB Output is correct
35 Correct 18 ms 12180 KB Output is correct
36 Correct 14 ms 12104 KB Output is correct
37 Correct 21 ms 12164 KB Output is correct
38 Correct 17 ms 12164 KB Output is correct
39 Correct 17 ms 12184 KB Output is correct
40 Correct 17 ms 12104 KB Output is correct
41 Correct 21 ms 12164 KB Output is correct
42 Correct 19 ms 12160 KB Output is correct
43 Correct 13 ms 12148 KB Output is correct
44 Correct 15 ms 12200 KB Output is correct
45 Correct 22 ms 12168 KB Output is correct
46 Correct 19 ms 12176 KB Output is correct
47 Correct 6 ms 12104 KB Output is correct
48 Correct 7 ms 12104 KB Output is correct
49 Correct 7 ms 12104 KB Output is correct
50 Correct 9 ms 12140 KB Output is correct
51 Correct 8 ms 12108 KB Output is correct
52 Correct 7 ms 12104 KB Output is correct
53 Correct 7 ms 12136 KB Output is correct
54 Correct 8 ms 12104 KB Output is correct
55 Correct 7 ms 12104 KB Output is correct
56 Correct 6 ms 12104 KB Output is correct
57 Correct 6 ms 12104 KB Output is correct
58 Correct 9 ms 12136 KB Output is correct
59 Correct 9 ms 12104 KB Output is correct
60 Correct 8 ms 12104 KB Output is correct
61 Correct 7 ms 12104 KB Output is correct
62 Correct 8 ms 12104 KB Output is correct
63 Correct 8 ms 12104 KB Output is correct
64 Correct 9 ms 12104 KB Output is correct
65 Correct 6 ms 12104 KB Output is correct
66 Correct 6 ms 12104 KB Output is correct
67 Correct 7 ms 12120 KB Output is correct
68 Correct 8 ms 12016 KB Output is correct
69 Correct 6 ms 12128 KB Output is correct
70 Correct 6 ms 12008 KB Output is correct
71 Correct 6 ms 12132 KB Output is correct
72 Correct 8 ms 12104 KB Output is correct