제출 #51953

#제출 시각아이디문제언어결과실행 시간메모리
51953someone_aaICC (CEOI16_icc)C++17
0 / 100
362 ms740 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 ed=1;ed<N;ed++) {
        bool found = false;
        for(int fi=1;fi<=N;fi++) {
            for(int si=fi+1;si<=N;si++) {
                if(!road[fi][si] && !found) {
                    int a[] = {fi};
                    int b[] = {si};
                    bool temp = bool(query(1,1,a,b));

                    if(temp) {
                        road[fi][si] = road[si][fi] = true;
                        for(int i=1;i<=N;i++) {
                            for(int j=1;j<=N;j++) {
                                if((road[i][fi] && road[j][si]) || (road[j][fi] && road[i][si])) {
                                    road[i][j] = road[j][i] = 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...