Submission #51950

#TimeUsernameProblemLanguageResultExecution timeMemory
51950someone_aaICC (CEOI16_icc)C++17
0 / 100
387 ms848 KiB
#include <bits/stdc++.h> #include "icc.h" using namespace std; /*int query(int a, int b, int x[], int y[]) { cout<<x[0]<<" "<<y[0]<<"\n"; int answ; cin>>answ; return answ; } void setRoad(int x, int y) { cout<<"Road: "<<x<<" "<<y<<"\n"; }*/ void run(int N) { bool road[N+2][N+2]; memset(road, false, sizeof(road)); for(int i=1;i<N-1;i++) { bool found = false; for(int j=1;j<=N;j++) { for(int k=1;k<j;k++) { if(!found) { if(!road[k][j] && j!=k) { int a[] = {j}; int b[] = {k}; bool check = bool(query(1, 1, b, a)); if(check) { road[j][k] = road[k][j] = true; setRoad(k, j); for(int c=1;c<=N;c++) { for(int d=1;d<=N;d++) { for(int dd=1;dd<=N;dd++) { if(road[c][dd] && road[dd][d]) road[c][d] = road[d][c] = true; } } } found = true; } } } } } } } /*int main() { run(4); }*/
#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...