oj.uz

Submission #513826

# Submission time Handle Problem Language Result Execution time Memory
513826 2022-01-17T16:54:56 Z fatemetmhr Meetings (JOI19_meetings) C++17
29 / 100
 1778 ms 12604 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'

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;
vector <int> adj[maxn5], tmp, av;
int mx[maxn5], sz[maxn5];
bool rem[maxn5], mark[maxn5];

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){
	//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;
	for(auto uu : adj[c]) if(!rem[uu]){
		int u = uu;
		int t = Query(c, u, v);
		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 = 1; i < n; i++) if(!mark[i]){
		fill(rem, rem + n + 5, false);
		add(0, i);
		mark[i] = true;
	}
	for(int i = 0; i < n; i++) for(auto u : adj[i]){
		//cout << "edge " << i << ' '<< u << endl;
		if(i < u) Bridge(i, u);
	}
	return;
}

/*
5
0 4
2 4
2 3
1 4
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12104 KB Output is correct
2 Correct 8 ms 12104 KB Output is correct
3 Correct 6 ms 12104 KB Output is correct
4 Correct 6 ms 12104 KB Output is correct
5 Correct 6 ms 12104 KB Output is correct
6 Correct 6 ms 12104 KB Output is correct
7 Correct 8 ms 12088 KB Output is correct
8 Correct 6 ms 12104 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 8 ms 12104 KB Output is correct
13 Correct 7 ms 12056 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12104 KB Output is correct
2 Correct 8 ms 12104 KB Output is correct
3 Correct 6 ms 12104 KB Output is correct
4 Correct 6 ms 12104 KB Output is correct
5 Correct 6 ms 12104 KB Output is correct
6 Correct 6 ms 12104 KB Output is correct
7 Correct 8 ms 12088 KB Output is correct
8 Correct 6 ms 12104 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 8 ms 12104 KB Output is correct
13 Correct 7 ms 12056 KB Output is correct
14 Correct 8 ms 12184 KB Output is correct
15 Correct 7 ms 12104 KB Output is correct
16 Correct 7 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 12020 KB Output is correct
21 Correct 6 ms 12084 KB Output is correct
22 Correct 7 ms 12104 KB Output is correct
23 Correct 7 ms 12104 KB Output is correct
24 Correct 8 ms 12084 KB Output is correct
25 Correct 7 ms 12104 KB Output is correct
26 Correct 7 ms 12116 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12104 KB Output is correct
2 Correct 8 ms 12104 KB Output is correct
3 Correct 6 ms 12104 KB Output is correct
4 Correct 6 ms 12104 KB Output is correct
5 Correct 6 ms 12104 KB Output is correct
6 Correct 6 ms 12104 KB Output is correct
7 Correct 8 ms 12088 KB Output is correct
8 Correct 6 ms 12104 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 8 ms 12104 KB Output is correct
13 Correct 7 ms 12056 KB Output is correct
14 Correct 8 ms 12184 KB Output is correct
15 Correct 7 ms 12104 KB Output is correct
16 Correct 7 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 12020 KB Output is correct
21 Correct 6 ms 12084 KB Output is correct
22 Correct 7 ms 12104 KB Output is correct
23 Correct 7 ms 12104 KB Output is correct
24 Correct 8 ms 12084 KB Output is correct
25 Correct 7 ms 12104 KB Output is correct
26 Correct 7 ms 12116 KB Output is correct
27 Correct 11 ms 12104 KB Output is correct
28 Correct 11 ms 12140 KB Output is correct
29 Correct 15 ms 12168 KB Output is correct
30 Correct 12 ms 12104 KB Output is correct
31 Correct 12 ms 12104 KB Output is correct
32 Correct 15 ms 12104 KB Output is correct
33 Correct 18 ms 12140 KB Output is correct
34 Correct 24 ms 12172 KB Output is correct
35 Correct 20 ms 12104 KB Output is correct
36 Correct 13 ms 12108 KB Output is correct
37 Correct 15 ms 12160 KB Output is correct
38 Correct 21 ms 12160 KB Output is correct
39 Correct 17 ms 12152 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 605 ms 12464 KB Output is correct
2 Correct 626 ms 12340 KB Output is correct
3 Correct 634 ms 12408 KB Output is correct
4 Correct 661 ms 12420 KB Output is correct
5 Correct 493 ms 12400 KB Output is correct
6 Correct 451 ms 12324 KB Output is correct
7 Correct 635 ms 12408 KB Output is correct
8 Correct 705 ms 12344 KB Output is correct
9 Correct 648 ms 12368 KB Output is correct
10 Correct 592 ms 12460 KB Output is correct
11 Correct 729 ms 12444 KB Output is correct
12 Correct 703 ms 12604 KB Output is correct
13 Correct 724 ms 12492 KB Output is correct
14 Correct 863 ms 12432 KB Output is correct
15 Correct 801 ms 12344 KB Output is correct
16 Correct 791 ms 12408 KB Output is correct
17 Correct 657 ms 12416 KB Output is correct
18 Incorrect 1778 ms 12416 KB Wrong Answer [2]
19 Halted 0 ms 0 KB -