| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 236548 | Knps4422 | Meetings (JOI19_meetings) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#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;
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 = 1;
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];
}
int find_center2(vec <int> &asd){
srand(time(NULL));
if(asd.size() < 10)return asd[0];
int guess = asd[0];
int k = 20;
random_shuffle(all(asd));
for(int i = 1 ; i < min(asd.size()-1,k); i++){
if(asd[i] != guess && asd[i+1] != guess){
guess = Query(guess,asd[i],asd[i+1]);
}
}
return guess;
}
void solves(vec <int> &tb){
if(tb.size() == 1)return ;
int A = find_center2(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;
}
*/