oj.uz

Submission #258251

# Submission time Handle Problem Language Result Execution time Memory
258251 2020-08-05T15:21:08 Z kimbj0709 ICC (CEOI16_icc) C++14
0 / 100
 455 ms 636 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
 
void run(int n) {
 
    int r, a, b, A[1], B[1];
    bool E[15][15] = {};
 
    for (int i = 0; i < n - 1; i++) {
 
        a = -1;
        b = -1;
 
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < j; k++) {
                A[0] = j + 1;
                B[0] = k + 1;
                r = query(1, 1, A, B);
                if (r == 1 && !E[j][k]) {
                    a = j;
                    b = k;
		    E[a][b] = true;
	            setRoad(a + 1, b + 1);
		    goto cont;
                }
            }
        }
 	cont : ;
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 544 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 249 ms 636 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 455 ms 512 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 418 ms 632 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 398 ms 512 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 360 ms 632 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -