# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529776 | 2022-02-23T16:04:23 Z | Koosha_mv | Meetings (JOI19_meetings) | C++14 | 411 ms | 788 KB |
#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,rt; 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; }*/ bool cmp(int i,int j){ if(i==rt) return 1; if(j==rt) return 0; return Query(i,j,rt)==i; } void findpath(vector<int> p){ rt=-1; f(i,0,p.size()){ int check=1; f(j,0,p.size()-2){ int k=j+1; j+=(i<=j); k+=(i<=k); if(j!=i && k!=i && Query(p[i],p[j],p[k])==p[i]){ check=0; } } if(check){ rt=p[i]; break; } } if(rt==-1) assert(0); vector<int> res; for(auto x : p) res.pb(x); sort(all(res),cmp); 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=1; 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); random_shuffle(all(vec)); 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 328 KB | Output is correct |
2 | Correct | 0 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 | 1 ms | 328 KB | Output is correct |
10 | Correct | 1 ms | 328 KB | Output is correct |
11 | Correct | 0 ms | 328 KB | Output is correct |
12 | Correct | 0 ms | 328 KB | Output is correct |
13 | Correct | 0 ms | 328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 328 KB | Output is correct |
2 | Correct | 0 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 | 1 ms | 328 KB | Output is correct |
10 | Correct | 1 ms | 328 KB | Output is correct |
11 | Correct | 0 ms | 328 KB | Output is correct |
12 | Correct | 0 ms | 328 KB | Output is correct |
13 | Correct | 0 ms | 328 KB | Output is correct |
14 | Correct | 1 ms | 328 KB | Output is correct |
15 | Correct | 0 ms | 328 KB | Output is correct |
16 | Correct | 1 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 | 1 ms | 328 KB | Output is correct |
26 | Correct | 1 ms | 328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 328 KB | Output is correct |
2 | Correct | 0 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 | 1 ms | 328 KB | Output is correct |
10 | Correct | 1 ms | 328 KB | Output is correct |
11 | Correct | 0 ms | 328 KB | Output is correct |
12 | Correct | 0 ms | 328 KB | Output is correct |
13 | Correct | 0 ms | 328 KB | Output is correct |
14 | Correct | 1 ms | 328 KB | Output is correct |
15 | Correct | 0 ms | 328 KB | Output is correct |
16 | Correct | 1 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 | 1 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 | Incorrect | 4 ms | 328 KB | Wrong Answer [4] |
29 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 352 ms | 740 KB | Output is correct |
2 | Incorrect | 411 ms | 788 KB | Wrong Answer [4] |
3 | Halted | 0 ms | 0 KB | - |