# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164417 | tneluccus | Meetings (JOI19_meetings) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "meeting.h"
using namespace std;
const int num=2e3+2;
vector<int> lis[num];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve1(int root){
int n=lis[root].size(),i,j,k,l,ran,ver;
if(!n){
return;
}
vector<int> idx;
ran=rng()%n;
ver=lis[root][ran];
for(i=0;i<lis[root].size();i++){
j=Query(root,ver,lis[root][i]);
idx.push_back(j);
if(j!=lis[root][j]){
lis[j].push_back(lis[root][i]);
}
}
sort(idx.begin(),idx.end(),[&](int x,int y){
return Query(root,x,y)==x;
});
j=root;
for(i=0;i<idx.size();i++){
Bridge(j,idx[i]);
j=idx[i];
}
for(i=0;i<idx.size();i++){
solve1(idx[i]);
}
}
void solve(int N){
int n=N,i,j,k,l,m,root=rng()%N+1;
for(i=1;i<=n;i++){
if(i==root){
continue;
}
lis[root].push_back(i);
}
solve1(root);
}