Submission #919353

#TimeUsernameProblemLanguageResultExecution timeMemory
919353winter0101Chameleon's Love (JOI20_chameleon)C++14
Compilation error
0 ms0 KiB
#include<bits/stdc++.h> #include "chameleon.h" using namespace std; #define all(fl) fl.begin(),fl.end() #define pb push_back #define fi first #define se second #define for1(i,j,k) for(int i=j;i<=k;i++) #define for2(i,j,k) for(int i=j;i>=k;i--) #define for3(i,j,k,l) for(int i=j;i<=k;i+=l) #define lb lower_bound #define ub upper_bound #define sz(a) (int)a.size() #define pii pair<int,int> #define pli pair<long long,int> #define gcd __gcd #define lcm(x,y) x*y/__gcd(x,y) const int maxn=1e3+9; vector<int>a[maxn]; bool edg[maxn][maxn]; bool use[maxn]; void Solve(int n){ if (n<=50){ for1(i,1,2*n){ for1(j,1,2*n){ if (i==j)continue; if (Query({i,j})==1){ a[i].pb(j); } } } else { for1(i,1,n){ for1(j,n+1,2*n){ use[j]=0; } while (true){ int l=n+1,r=2*n,ans=-1; while (l<=r){ int mid=(l+r)/2; vector<int>check; check.pb(i); for1(j,n+1,mid){ if (use[j])continue; check.pb(j); } if (Query(check)<sz(check)){ ans=mid; r=mid-1; } else l=mid+1; } if (ans==-1)break; use[ans]=1; a[i].pb(ans); a[ans].pb(i); } } //} vector<pii>ans; for1(i,1,2*n){ if (sz(a[i])==1){ for (auto v:a[i]){ edg[v][i]=edg[i][v]=1; } } else { vector<int>check; check.pb(i); for1(j,0,sz(a[i])-1){ check.pb(a[i][j]); for1(k,j+1,sz(a[i])-1){ check.pb(a[i][k]); if (Query(check)==1){ edg[i][a[i][j]]=1; edg[i][a[i][k]]=1; } check.pop_back(); } check.pop_back(); } } } for1(i,1,2*n){ for1(j,i+1,2*n){ if (edg[i][j]&&edg[j][i]){ Answer(i,j); } } } }

Compilation message (stderr)

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:32:5: error: expected '}' before 'else'
   32 |     else {
      |     ^~~~
chameleon.cpp:23:15: note: to match this '{'
   23 |     if (n<=50){
      |               ^
chameleon.cpp:91:1: error: expected '}' at end of input
   91 | }
      | ^
chameleon.cpp:22:18: note: to match this '{'
   22 | void Solve(int n){
      |                  ^