oj.uz

Submission #131567

# Submission time Handle Problem Language Result Execution time Memory
131567 2019-07-17T09:50:29 Z ekrem Meetings (JOI19_meetings) C++14
100 / 100
 1114 ms 1212 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define inf 1000000009
#define MAXN 2005

using namespace std;

typedef long long ll;
typedef pair < int , int > ii;
typedef vector < int > vi;
typedef set < int > si;
#define siter set < int > :: iterator

int n, u[MAXN], say[MAXN];
set < int > s[MAXN], kal;
ii mx;

int sor(int x, int y, int z){
	if(x == y)return x;
	if(z == y)return z;
	if(x == z)return x;
	return Query(x - 1, y - 1, z - 1) + 1;
}

void hazirla(int node, int par){
	say[node] = 1;
	for(siter it = s[node].begin(); it != s[node].end(); it++)
		if(*it != par and !u[*it]){
			hazirla(*it, node);
			say[node] += say[*it];
		}
}



void dfs(int node, int par){
	// cout << par << " -> " << node << endl;
	if(par)
		Bridge(min(par, node) - 1, max(par, node) - 1);
	for(siter it = s[node].begin(); it != s[node].end(); it++)
		if(*it != par){
			dfs(*it, node);
		}
}

void ekle(int x, int y){
	s[x].insert(y);
	s[y].insert(x);
	// cout << x << " " << y << " geldi" << endl;
}


void centbul(int node, int x){
	hazirla(node, 0);
	int par = 0, t = say[node], f = 1;
	while(f){
		f = 0;
		mx = mp(0, 0);
		for(siter it = s[node].begin(); it != s[node].end(); it++)
			if(!u[*it] and *it != par)
				mx = max(mx, mp(say[*it], *it));
		if(mx.st > t/2){
			f = 1;
			par = node;
			node = mx.nd;
		}
	}
	// cout << x << " " << node << " " << mx.nd << " = ";
	if(!mx.nd){
		ekle(node, x);
		kal.erase(x);
		return;
	}
	int y = sor(x, node, mx.nd);
	// cout << y << endl;
	if(y == node){
		u[mx.nd] = 1;
		centbul(node, x);
		return;
	}
	if(y == mx.nd){
		u[node] = 1;
		centbul(mx.nd, x);
		return;
	}
	// cout << node << " " << mx.nd << "gitti " << endl;
	s[node].erase(mx.nd);
	s[mx.nd].erase(node);
	ekle(node, y);
	ekle(mx.nd, y);
	if(y != x)
		ekle(x, y);
	kal.erase(x);
	kal.erase(y);
}

void Solve(int nn) {n = nn;
	ekle(1, 2);
	for(int i = 3; i <= n; i++)
		kal.insert(i);
	while(!kal.empty()){
		int x = *kal.begin();

		memset(u, 0, sizeof u);
		centbul(1, x);
	}
	dfs(1, 0);
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 739 ms 1000 KB Output is correct
2 Correct 790 ms 900 KB Output is correct
3 Correct 820 ms 1016 KB Output is correct
4 Correct 789 ms 1212 KB Output is correct
5 Correct 580 ms 956 KB Output is correct
6 Correct 506 ms 888 KB Output is correct
7 Correct 909 ms 1016 KB Output is correct
8 Correct 880 ms 960 KB Output is correct
9 Correct 882 ms 1064 KB Output is correct
10 Correct 866 ms 916 KB Output is correct
11 Correct 952 ms 1064 KB Output is correct
12 Correct 666 ms 1072 KB Output is correct
13 Correct 549 ms 1068 KB Output is correct
14 Correct 669 ms 1020 KB Output is correct
15 Correct 608 ms 980 KB Output is correct
16 Correct 660 ms 1028 KB Output is correct
17 Correct 768 ms 1012 KB Output is correct
18 Correct 509 ms 936 KB Output is correct
19 Correct 516 ms 884 KB Output is correct
20 Correct 696 ms 984 KB Output is correct
21 Correct 678 ms 1056 KB Output is correct
22 Correct 721 ms 888 KB Output is correct
23 Correct 696 ms 1020 KB Output is correct
24 Correct 712 ms 1040 KB Output is correct
25 Correct 616 ms 1144 KB Output is correct
26 Correct 571 ms 892 KB Output is correct
27 Correct 623 ms 888 KB Output is correct
28 Correct 970 ms 1096 KB Output is correct
29 Correct 852 ms 1156 KB Output is correct
30 Correct 894 ms 1020 KB Output is correct
31 Correct 903 ms 1148 KB Output is correct
32 Correct 1114 ms 1016 KB Output is correct
33 Correct 712 ms 1056 KB Output is correct
34 Correct 9 ms 504 KB Output is correct
35 Correct 9 ms 504 KB Output is correct
36 Correct 9 ms 504 KB Output is correct
37 Correct 8 ms 504 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 11 ms 504 KB Output is correct
40 Correct 16 ms 632 KB Output is correct
41 Correct 21 ms 504 KB Output is correct
42 Correct 20 ms 504 KB Output is correct
43 Correct 8 ms 504 KB Output is correct
44 Correct 12 ms 504 KB Output is correct
45 Correct 12 ms 504 KB Output is correct
46 Correct 11 ms 632 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 3 ms 504 KB Output is correct
51 Correct 2 ms 508 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 504 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 504 KB Output is correct
58 Correct 2 ms 380 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 504 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 504 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 504 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 2 ms 504 KB Output is correct
68 Correct 2 ms 504 KB Output is correct
69 Correct 2 ms 504 KB Output is correct
70 Correct 2 ms 376 KB Output is correct
71 Correct 2 ms 376 KB Output is correct
72 Correct 2 ms 376 KB Output is correct