#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "meetings.h"
const int N=2020;
int n;
vector<int> g[N];
/*
void Bridge(int u, int v){
cout<<"BRIDGE "<<u<<" "<<v<<endl;
}
int Query(int u, int v, int w){
int x;
cout<<"QUERY "<<u<<" "<<v<<" "<<w<<endl;
cin>>x;
return x;
}*/
void findpath(vector<int> p){
vector<int> res;
if(p.size()<2) assert(0);
res.pb(p[0]);
res.pb(p[1]);
f(i,2,p.size()){
int u=p[i];
int l,r;
if(Query(u,res[0],res[1])==res[0]){
l=-1,r=0;
}
else if(Query(u,res[res.size()-1],res[res.size()-2])==res[res.size()-1]){
r=res.size();
}
else{
l=0,r=res.size();
while(l+1<r){
int mid=(l+r)>>1;
if(Query(u,res[mid],res[mid-1])==res[mid]) l=mid;
else r=mid;
}
}
vector<int> pes;
f(i,0,res.size()){
if(i==r) pes.pb(u);
pes.pb(res[i]);
}
if(r==res.size()) pes.pb(u);
res.clear();
for(auto x : pes) res.pb(x);
}
f(i,1,res.size()){
Bridge(min(res[i],res[i-1]),max(res[i],res[i-1]));
}
}
void solve(vector<int> vec){
if(vec.size()==1) return ;
vector<int> path;
vector<pair<int,int>> e;
int u=0,v=0;
while(u==v) u=rand()%vec.size(),v=rand()%vec.size();
u=vec[u],v=vec[v];
e.pb({u,u});
e.pb({v,v});
for(auto x : vec){
if(x==u || x==v) continue ;
e.pb({Query(x,u,v),x});
}
sort(all(e));
vec.clear();
f(i,0,e.size()){
vec.pb(e[i].S);
if(i==e.size()-1 || e[i].F!=e[i+1].F){
path.pb(e[i].F);
solve(vec);
vec.clear();
}
}
findpath(path);
}
void Solve(int pn){
n=pn;
vector<int> vec(n);
iota(all(vec),0);
solve(vec);
}
/*
int main(){
srand(time(NULL));
cin>>n;
f(i,1,n){
int u,v;
cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
Solve(n);
}
*/
Compilation message
meetings.cpp: In function 'void findpath(std::vector<int>)':
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
43 | f(i,2,p.size()){
| ~~~~~~~~~~~~
meetings.cpp:43:2: note: in expansion of macro 'f'
43 | f(i,2,p.size()){
| ^
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
61 | f(i,0,res.size()){
| ~~~~~~~~~~~~~~
meetings.cpp:61:3: note: in expansion of macro 'f'
61 | f(i,0,res.size()){
| ^
meetings.cpp:65:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | if(r==res.size()) pes.pb(u);
| ~^~~~~~~~~~~~
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
69 | f(i,1,res.size()){
| ~~~~~~~~~~~~~~
meetings.cpp:69:2: note: in expansion of macro 'f'
69 | f(i,1,res.size()){
| ^
meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
88 | f(i,0,e.size()){
| ~~~~~~~~~~~~
meetings.cpp:88:2: note: in expansion of macro 'f'
88 | f(i,0,e.size()){
| ^
meetings.cpp:90:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
90 | if(i==e.size()-1 || e[i].F!=e[i+1].F){
| ~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
328 KB |
Output is correct |
2 |
Correct |
1 ms |
328 KB |
Output is correct |
3 |
Correct |
0 ms |
328 KB |
Output is correct |
4 |
Correct |
0 ms |
328 KB |
Output is correct |
5 |
Correct |
0 ms |
328 KB |
Output is correct |
6 |
Correct |
0 ms |
328 KB |
Output is correct |
7 |
Correct |
1 ms |
328 KB |
Output is correct |
8 |
Correct |
0 ms |
328 KB |
Output is correct |
9 |
Correct |
0 ms |
328 KB |
Output is correct |
10 |
Correct |
0 ms |
328 KB |
Output is correct |
11 |
Correct |
0 ms |
328 KB |
Output is correct |
12 |
Correct |
1 ms |
328 KB |
Output is correct |
13 |
Correct |
1 ms |
328 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
328 KB |
Output is correct |
2 |
Correct |
1 ms |
328 KB |
Output is correct |
3 |
Correct |
0 ms |
328 KB |
Output is correct |
4 |
Correct |
0 ms |
328 KB |
Output is correct |
5 |
Correct |
0 ms |
328 KB |
Output is correct |
6 |
Correct |
0 ms |
328 KB |
Output is correct |
7 |
Correct |
1 ms |
328 KB |
Output is correct |
8 |
Correct |
0 ms |
328 KB |
Output is correct |
9 |
Correct |
0 ms |
328 KB |
Output is correct |
10 |
Correct |
0 ms |
328 KB |
Output is correct |
11 |
Correct |
0 ms |
328 KB |
Output is correct |
12 |
Correct |
1 ms |
328 KB |
Output is correct |
13 |
Correct |
1 ms |
328 KB |
Output is correct |
14 |
Correct |
1 ms |
328 KB |
Output is correct |
15 |
Correct |
1 ms |
328 KB |
Output is correct |
16 |
Correct |
0 ms |
328 KB |
Output is correct |
17 |
Correct |
1 ms |
328 KB |
Output is correct |
18 |
Correct |
1 ms |
328 KB |
Output is correct |
19 |
Correct |
1 ms |
328 KB |
Output is correct |
20 |
Correct |
1 ms |
328 KB |
Output is correct |
21 |
Correct |
1 ms |
328 KB |
Output is correct |
22 |
Correct |
1 ms |
328 KB |
Output is correct |
23 |
Correct |
1 ms |
328 KB |
Output is correct |
24 |
Correct |
1 ms |
328 KB |
Output is correct |
25 |
Correct |
0 ms |
328 KB |
Output is correct |
26 |
Correct |
1 ms |
328 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
328 KB |
Output is correct |
2 |
Correct |
1 ms |
328 KB |
Output is correct |
3 |
Correct |
0 ms |
328 KB |
Output is correct |
4 |
Correct |
0 ms |
328 KB |
Output is correct |
5 |
Correct |
0 ms |
328 KB |
Output is correct |
6 |
Correct |
0 ms |
328 KB |
Output is correct |
7 |
Correct |
1 ms |
328 KB |
Output is correct |
8 |
Correct |
0 ms |
328 KB |
Output is correct |
9 |
Correct |
0 ms |
328 KB |
Output is correct |
10 |
Correct |
0 ms |
328 KB |
Output is correct |
11 |
Correct |
0 ms |
328 KB |
Output is correct |
12 |
Correct |
1 ms |
328 KB |
Output is correct |
13 |
Correct |
1 ms |
328 KB |
Output is correct |
14 |
Correct |
1 ms |
328 KB |
Output is correct |
15 |
Correct |
1 ms |
328 KB |
Output is correct |
16 |
Correct |
0 ms |
328 KB |
Output is correct |
17 |
Correct |
1 ms |
328 KB |
Output is correct |
18 |
Correct |
1 ms |
328 KB |
Output is correct |
19 |
Correct |
1 ms |
328 KB |
Output is correct |
20 |
Correct |
1 ms |
328 KB |
Output is correct |
21 |
Correct |
1 ms |
328 KB |
Output is correct |
22 |
Correct |
1 ms |
328 KB |
Output is correct |
23 |
Correct |
1 ms |
328 KB |
Output is correct |
24 |
Correct |
1 ms |
328 KB |
Output is correct |
25 |
Correct |
0 ms |
328 KB |
Output is correct |
26 |
Correct |
1 ms |
328 KB |
Output is correct |
27 |
Correct |
4 ms |
328 KB |
Output is correct |
28 |
Correct |
4 ms |
432 KB |
Output is correct |
29 |
Correct |
4 ms |
328 KB |
Output is correct |
30 |
Correct |
4 ms |
328 KB |
Output is correct |
31 |
Correct |
3 ms |
328 KB |
Output is correct |
32 |
Correct |
6 ms |
328 KB |
Output is correct |
33 |
Correct |
8 ms |
328 KB |
Output is correct |
34 |
Correct |
9 ms |
452 KB |
Output is correct |
35 |
Correct |
9 ms |
328 KB |
Output is correct |
36 |
Correct |
5 ms |
328 KB |
Output is correct |
37 |
Correct |
7 ms |
440 KB |
Output is correct |
38 |
Correct |
8 ms |
328 KB |
Output is correct |
39 |
Correct |
6 ms |
328 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
352 ms |
644 KB |
Output is correct |
2 |
Correct |
409 ms |
676 KB |
Output is correct |
3 |
Correct |
395 ms |
580 KB |
Output is correct |
4 |
Correct |
388 ms |
580 KB |
Output is correct |
5 |
Correct |
286 ms |
696 KB |
Output is correct |
6 |
Correct |
317 ms |
576 KB |
Output is correct |
7 |
Correct |
340 ms |
704 KB |
Output is correct |
8 |
Correct |
439 ms |
672 KB |
Output is correct |
9 |
Correct |
349 ms |
724 KB |
Output is correct |
10 |
Correct |
340 ms |
728 KB |
Output is correct |
11 |
Correct |
487 ms |
736 KB |
Output is correct |
12 |
Correct |
368 ms |
740 KB |
Output is correct |
13 |
Correct |
207 ms |
840 KB |
Output is correct |
14 |
Correct |
334 ms |
660 KB |
Output is correct |
15 |
Correct |
278 ms |
604 KB |
Output is correct |
16 |
Correct |
284 ms |
624 KB |
Output is correct |
17 |
Correct |
330 ms |
684 KB |
Output is correct |
18 |
Correct |
292 ms |
612 KB |
Output is correct |
19 |
Correct |
256 ms |
672 KB |
Output is correct |
20 |
Correct |
357 ms |
776 KB |
Output is correct |
21 |
Correct |
377 ms |
596 KB |
Output is correct |
22 |
Correct |
342 ms |
596 KB |
Output is correct |
23 |
Correct |
356 ms |
596 KB |
Output is correct |
24 |
Correct |
329 ms |
600 KB |
Output is correct |
25 |
Correct |
339 ms |
680 KB |
Output is correct |
26 |
Correct |
351 ms |
596 KB |
Output is correct |
27 |
Correct |
419 ms |
832 KB |
Output is correct |
28 |
Correct |
457 ms |
596 KB |
Output is correct |
29 |
Correct |
331 ms |
740 KB |
Output is correct |
30 |
Correct |
334 ms |
596 KB |
Output is correct |
31 |
Correct |
376 ms |
836 KB |
Output is correct |
32 |
Correct |
666 ms |
704 KB |
Output is correct |
33 |
Correct |
255 ms |
788 KB |
Output is correct |
34 |
Correct |
4 ms |
420 KB |
Output is correct |
35 |
Correct |
4 ms |
328 KB |
Output is correct |
36 |
Correct |
4 ms |
440 KB |
Output is correct |
37 |
Correct |
5 ms |
328 KB |
Output is correct |
38 |
Correct |
4 ms |
328 KB |
Output is correct |
39 |
Correct |
7 ms |
328 KB |
Output is correct |
40 |
Correct |
9 ms |
328 KB |
Output is correct |
41 |
Correct |
10 ms |
444 KB |
Output is correct |
42 |
Correct |
9 ms |
456 KB |
Output is correct |
43 |
Correct |
9 ms |
328 KB |
Output is correct |
44 |
Correct |
7 ms |
436 KB |
Output is correct |
45 |
Correct |
7 ms |
328 KB |
Output is correct |
46 |
Correct |
5 ms |
456 KB |
Output is correct |
47 |
Correct |
1 ms |
384 KB |
Output is correct |
48 |
Correct |
0 ms |
328 KB |
Output is correct |
49 |
Correct |
0 ms |
328 KB |
Output is correct |
50 |
Correct |
1 ms |
328 KB |
Output is correct |
51 |
Correct |
0 ms |
328 KB |
Output is correct |
52 |
Correct |
1 ms |
328 KB |
Output is correct |
53 |
Correct |
1 ms |
328 KB |
Output is correct |
54 |
Correct |
1 ms |
328 KB |
Output is correct |
55 |
Correct |
1 ms |
328 KB |
Output is correct |
56 |
Correct |
1 ms |
328 KB |
Output is correct |
57 |
Correct |
1 ms |
328 KB |
Output is correct |
58 |
Correct |
1 ms |
328 KB |
Output is correct |
59 |
Correct |
1 ms |
328 KB |
Output is correct |
60 |
Correct |
1 ms |
328 KB |
Output is correct |
61 |
Correct |
0 ms |
328 KB |
Output is correct |
62 |
Correct |
0 ms |
328 KB |
Output is correct |
63 |
Correct |
0 ms |
328 KB |
Output is correct |
64 |
Correct |
0 ms |
328 KB |
Output is correct |
65 |
Correct |
0 ms |
328 KB |
Output is correct |
66 |
Correct |
0 ms |
328 KB |
Output is correct |
67 |
Correct |
1 ms |
328 KB |
Output is correct |
68 |
Correct |
0 ms |
328 KB |
Output is correct |
69 |
Correct |
1 ms |
328 KB |
Output is correct |
70 |
Correct |
1 ms |
328 KB |
Output is correct |
71 |
Correct |
0 ms |
328 KB |
Output is correct |
72 |
Correct |
1 ms |
392 KB |
Output is correct |