oj.uz

Submission #51950

# Submission time Handle Problem Language Result Execution time Memory
51950 2018-06-22T17:33:59 Z someone_aa ICC (CEOI16_icc) C++17
0 / 100
 387 ms 848 KB 
#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);
}*/

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 504 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 343 ms 612 KB Number of queries more than 5000 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 387 ms 784 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 357 ms 784 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 302 ms 784 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 265 ms 848 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -