oj.uz

Submission #236568

# Submission time Handle Problem Language Result Execution time Memory
236568 2020-06-02T13:47:03 Z Knps4422 Meetings (JOI19_meetings) C++14
100 / 100
 1895 ms 1016 KB 
//#pragma optimization_level 3
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordset;
*/
#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 find_center(vec <int> &asd){
	if(asd.size() <= 10)return asd[0];
	vec<int> cnt(asd.size());
	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[ lower_bound(all(asd),p) - asd.begin()]++;
	}
	int mx = 0;
	for(int i = 0; i < cnt.size() ; i++){
		if(cnt[mx] < cnt[i])mx = i;
	}
	cnt.clear();
	return asd[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();
}

/*
int main(){
	fast;
	
}
*/

Compilation message

meetings.cpp: In function 'int find_center(std::vector<int>&)':
meetings.cpp:55:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < cnt.size() ; i++){
                 ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 308 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 432 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 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 6 ms 436 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 0 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 5 ms 384 KB Output is correct
2 Correct 4 ms 308 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 432 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 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 6 ms 436 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 20 ms 384 KB Output is correct
28 Correct 19 ms 384 KB Output is correct
29 Correct 30 ms 384 KB Output is correct
30 Correct 20 ms 432 KB Output is correct
31 Correct 22 ms 512 KB Output is correct
32 Correct 26 ms 384 KB Output is correct
33 Correct 43 ms 384 KB Output is correct
34 Correct 42 ms 384 KB Output is correct
35 Correct 37 ms 384 KB Output is correct
36 Correct 19 ms 452 KB Output is correct
37 Correct 20 ms 488 KB Output is correct
38 Correct 27 ms 384 KB Output is correct
39 Correct 22 ms 488 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1512 ms 652 KB Output is correct
2 Correct 1859 ms 756 KB Output is correct
3 Correct 1895 ms 736 KB Output is correct
4 Correct 1777 ms 764 KB Output is correct
5 Correct 1426 ms 632 KB Output is correct
6 Correct 1265 ms 736 KB Output is correct
7 Correct 1739 ms 736 KB Output is correct
8 Correct 1680 ms 772 KB Output is correct
9 Correct 1652 ms 1016 KB Output is correct
10 Correct 1507 ms 888 KB Output is correct
11 Correct 1711 ms 992 KB Output is correct
12 Correct 1317 ms 888 KB Output is correct
13 Correct 1281 ms 1016 KB Output is correct
14 Correct 1384 ms 888 KB Output is correct
15 Correct 1319 ms 888 KB Output is correct
16 Correct 1476 ms 632 KB Output is correct
17 Correct 1581 ms 792 KB Output is correct
18 Correct 1366 ms 892 KB Output is correct
19 Correct 1347 ms 632 KB Output is correct
20 Correct 1623 ms 636 KB Output is correct
21 Correct 1772 ms 892 KB Output is correct
22 Correct 1703 ms 888 KB Output is correct
23 Correct 1684 ms 888 KB Output is correct
24 Correct 1653 ms 888 KB Output is correct
25 Correct 1760 ms 1016 KB Output is correct
26 Correct 1582 ms 908 KB Output is correct
27 Correct 1626 ms 1016 KB Output is correct
28 Correct 1849 ms 832 KB Output is correct
29 Correct 1459 ms 772 KB Output is correct
30 Correct 1475 ms 760 KB Output is correct
31 Correct 1634 ms 832 KB Output is correct
32 Correct 1517 ms 908 KB Output is correct
33 Correct 1463 ms 760 KB Output is correct
34 Correct 20 ms 384 KB Output is correct
35 Correct 17 ms 384 KB Output is correct
36 Correct 21 ms 384 KB Output is correct
37 Correct 19 ms 384 KB Output is correct
38 Correct 17 ms 384 KB Output is correct
39 Correct 24 ms 384 KB Output is correct
40 Correct 35 ms 384 KB Output is correct
41 Correct 39 ms 384 KB Output is correct
42 Correct 37 ms 384 KB Output is correct
43 Correct 18 ms 384 KB Output is correct
44 Correct 20 ms 504 KB Output is correct
45 Correct 20 ms 384 KB Output is correct
46 Correct 23 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 4 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 4 ms 384 KB Output is correct
64 Correct 5 ms 384 KB Output is correct
65 Correct 4 ms 384 KB Output is correct
66 Correct 4 ms 384 KB Output is correct
67 Correct 4 ms 384 KB Output is correct
68 Correct 5 ms 384 KB Output is correct
69 Correct 4 ms 384 KB Output is correct
70 Correct 4 ms 384 KB Output is correct
71 Correct 4 ms 384 KB Output is correct
72 Correct 5 ms 384 KB Output is correct