#include <bits/stdc++.h>
#include "meetings.h"
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
mt19937 rnd(time(NULL));
map<pair<int,pair<int,int> >,int> mp;
int get(int a,int b,int c){
if(a>b){
swap(a,b);
}
if(b>c){
swap(b,c);
}
if(a>b){
swap(a,b);
}
if(a==b || b==c){
return b;
}
if(mp.find({a,{b,c}})!=mp.end()){
return mp[{a,{b,c}}];
}
return mp[{a,{b,c}}]=Query(a,b,c);
}
void dc(vector<int>& v){
int n=v.size();
if(n<=1){
return;
}
if(n==2){
Bridge(min(v[0],v[1]),max(v[0],v[1]));
return;
}
int x=0;
x=v[x];
vector<int> zz;
vector<int> vis(n);
vis[0]=1;
int cnt=1;
while(cnt<n){
int y=-1;
for(int i=0;i<n;i++){
if(vis[i]==0){
y=v[i];
break;
}
}
int i=0;
for(auto h:v){
if(h==x || vis[i]){
i++;
continue;
}
int u=get(x,y,h);
if(u!=x){
y=u;
zz.push_back(h);
vis[i]=1;
cnt++;
}
i++;
}
Bridge(min(x,y),max(x,y));
dc(zz);
zz.clear();
}
}
void Solve(int n){
vector<int> v(n);
iota(v.begin(),v.end(),0);
shuffle(v.begin(),v.end(),rnd);
dc(v);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
1 ms |
396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
336 KB |
Output is correct |
| 18 |
Correct |
1 ms |
336 KB |
Output is correct |
| 19 |
Correct |
1 ms |
336 KB |
Output is correct |
| 20 |
Correct |
1 ms |
336 KB |
Output is correct |
| 21 |
Correct |
1 ms |
336 KB |
Output is correct |
| 22 |
Correct |
1 ms |
364 KB |
Output is correct |
| 23 |
Correct |
1 ms |
336 KB |
Output is correct |
| 24 |
Correct |
1 ms |
336 KB |
Output is correct |
| 25 |
Correct |
1 ms |
336 KB |
Output is correct |
| 26 |
Correct |
1 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
0 ms |
336 KB |
Output is correct |
| 3 |
Correct |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
1 ms |
396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
336 KB |
Output is correct |
| 18 |
Correct |
1 ms |
336 KB |
Output is correct |
| 19 |
Correct |
1 ms |
336 KB |
Output is correct |
| 20 |
Correct |
1 ms |
336 KB |
Output is correct |
| 21 |
Correct |
1 ms |
336 KB |
Output is correct |
| 22 |
Correct |
1 ms |
364 KB |
Output is correct |
| 23 |
Correct |
1 ms |
336 KB |
Output is correct |
| 24 |
Correct |
1 ms |
336 KB |
Output is correct |
| 25 |
Correct |
1 ms |
336 KB |
Output is correct |
| 26 |
Correct |
1 ms |
336 KB |
Output is correct |
| 27 |
Correct |
34 ms |
1256 KB |
Output is correct |
| 28 |
Correct |
20 ms |
996 KB |
Output is correct |
| 29 |
Correct |
41 ms |
1476 KB |
Output is correct |
| 30 |
Correct |
31 ms |
1148 KB |
Output is correct |
| 31 |
Correct |
31 ms |
968 KB |
Output is correct |
| 32 |
Correct |
42 ms |
1444 KB |
Output is correct |
| 33 |
Correct |
48 ms |
1668 KB |
Output is correct |
| 34 |
Correct |
60 ms |
2216 KB |
Output is correct |
| 35 |
Correct |
80 ms |
2596 KB |
Output is correct |
| 36 |
Correct |
22 ms |
916 KB |
Output is correct |
| 37 |
Correct |
10 ms |
508 KB |
Output is correct |
| 38 |
Correct |
9 ms |
592 KB |
Output is correct |
| 39 |
Correct |
9 ms |
592 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2686 ms |
7624 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
