제출 #871533

#제출 시각아이디문제언어결과실행 시간메모리
871533Sir_Ahmed_ImranICC (CEOI16_icc)C++17
0 / 100
204 ms856 KiB
///~~~LOTA~~~/// #include <bits/stdc++.h> #include <icc.h> using namespace std; #define ll long long #define li long int #define ld long double #define append push_back #define add insert #define nl '\n' #define ff first #define ss second #define pii pair<int,int> #define pic pair<int,char> #define all(x) (x).begin(),(x).end() #define sum(a) accumulate(all(a),0) #define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL) #define terminator main #define N 101 int e[N]; int x[N]; int y[N]; int a[N][N]; void run(int n){ int m,o,p,q; for(int i=n;i>0;i--) a[i][i]=e[i]=1; for(int t=1;t<n;t++){ for(m=1;m<=n;m++){ q=0; p=1; x[0]=m; for(int j=1;j<=n;j++){ if(a[m][j]) continue; y[q]=j; q++; } if(query(p,q,x,y)) break; } o=0; for(int i=64;i>0;i/=2){ if(o+i>q) continue; if(!query(1,o+i,x,y)) o+=i; } setRoad(m,y[o]); a[y[o]][m]=1; a[m][y[o]]=1; e[y[o]]++; e[m]++; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...