oj.uz

Submission #236593

# Submission time Handle Problem Language Result Execution time Memory
236593 2020-06-02T14:17:18 Z MvC Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1032 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include "meetings.h"
#define fr first
#define sc second
#define vec vector
#define pb push_back
#define pii pair<int, int>
#define forn(x,y) for(int x = 1 ; x <= (int)y ; ++x)
#define all(x) (x).begin(),(x).end()
#define fast cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);cout.sync_with_stdio(0);
 
using namespace std;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
 
typedef long long ll;
typedef unsigned int uint;
typedef complex<int> point;
const int nmax = 100005;
const ll linf = 1e18;
const ll mod = 998244353;
const int inf = INT_MAX;
 
vec < pii > eds;
int cnt[nmax];
int find_center(vec <int> &asd){
	if(asd.size() <= 10)return asd[0];
	int tries = asd.size()/10;
	srand(time(0));
	while(tries --){
		int m = asd.size();
		int a, b, c;
		a = asd[rand()%m];
		b = asd[rand()%m];
		while(b == a) b = asd[rand()%m];
		c = asd[rand()%m];
		while(c == b || c == a)c = asd[rand()%m];
		// a,b,c - random din asd
		int p = Query(a,b,c);
		cnt[p]++;
	}
	int mx = asd[0];
	for(int i :asd){
		if(cnt[mx] < cnt[i])mx = i;
		cnt[i]=0;
	}
	return mx;
}
void solves(vec <int> &tb){
	if(tb.size() == 1)return ;
	int A = find_center(tb);
	int B = tb[0];
	if(B == A)B = tb[1];
	for(int i : tb){
		if(i != A && i != B && Query(A,B,i) == i) B = i;
	}
	eds.pb({A,B});
	vec < int > left;
	vec < int > right;
	for(int  i : tb){
		if(i != A && i != B){
			if(Query(A,B,i) == A){
				left.pb(i);
			}else{
				right.pb(i);
			}
		}
	}
	left.pb(A);
	sort(all(left));	
	solves(left);
	left.clear();
	right.pb(B);
	sort(all(right));
	solves(right);
	right.clear();
}
 
 
void Solve(int n){
	vec < int > asd;
	for(int i= 0; i <n ; i++)asd.pb(i);
	solves(asd);
	for(pii ed : eds){
		Bridge(min(ed.fr,ed.sc),max(ed.fr,ed.sc));
	}
	asd.clear();
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2571 ms 1032 KB Time limit exceeded
2 Halted 0 ms 0 KB -