제출 #236579

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236579		MvC	Meetings (JOI19_meetings)	C++14	29 / 100	2100 ms	784 KiB

meetings

#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 = 5005;
const ll linf = 1e18;
const ll mod = 998244353;
const int inf = INT_MAX;
 
vec < pii > eds;
int cnt[nmax],viz[nmax];
int find_center(vec <int> &asd){
	if(asd.size() <= 5)return asd[0];
	int tries = asd.size()/5;
	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});
	viz[A]=viz[B]=1;
	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);
	solves(left);
	left.clear();
	right.pb(B);
	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();
}

컴파일 시 표준 에러 (stderr) 메시지

meetings.cpp:1:0: warning: ignoring #pragma optimization_level  [-Wunknown-pragmas]
 #pragma optimization_level 3

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 0 / 71