/** made by amunduzbaev **/
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
//#include "grader.cpp"
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int NN = 2e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int aa, used[NN][NN];
bool cmp(int a, int b){
return Query(b, aa, a) == b;
}
void add(int x, int y){
if(used[x][y] || used[y][x]) return;
used[x][y] = 1;
if(y < x) swap(x, y);
Bridge(x, y);
}
void res(vii vv){
if(sz(vv) < 2) return;
if(sz(vv) == 2){
add(vv[0], vv[1]);
return;
}
random_shuffle(all(vv));
int a = vv[0], b = vv[1];
map<int, vii> tmp;
vii path;
for(int i=0;i<sz(vv);i++){
if(vv[i] == a || vv[i] == b) continue;
int res = Query(a, b, vv[i]);
if(!sz(tmp[res]) && res != a && res != b) path.pb(res);
tmp[res].pb(vv[i]);
}
if(path.empty()){
add(a, b);
}
else{
aa = a; //, bb = b;
add(a, path[0]);
for(int i=0;i<sz(path)-1;i++){
add(path[i], path[i+1]);
}
add(path[sz(path)-1], b);
sort(all(path), cmp);
}
//cout<<endl; //<<a<<" "<<b<<endl;
tmp[a].pb(a);
tmp[b].pb(b);
for(auto x:tmp){
//cout<<x.ff<<" ";
//for(auto tt : x.ss) cout<<tt<<" ";
//cout<<endl;
res(x.ss);
}
//for(auto x:path) cout<<x<<" ";
//cout<<endl;
}
void Solve(int n){
vii vv;
for(int i=0;i<n;i++) vv.pb(i);
res(vv);
//cout<<endl;
}
/*
8
1 2
1 4
0 1
0 3
0 5
5 6
3 7
5
0 1
0 2
1 3
1 4
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
0 ms |
364 KB |
Output is correct |
11 |
Correct |
0 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
0 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
0 ms |
364 KB |
Output is correct |
11 |
Correct |
0 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
0 ms |
364 KB |
Output is correct |
14 |
Incorrect |
1 ms |
364 KB |
Wrong Answer [4] |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
0 ms |
364 KB |
Output is correct |
11 |
Correct |
0 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
0 ms |
364 KB |
Output is correct |
14 |
Incorrect |
1 ms |
364 KB |
Wrong Answer [4] |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
106 ms |
620 KB |
Wrong Answer [4] |
2 |
Halted |
0 ms |
0 KB |
- |