oj.uz

Submission #604863

# Submission time Handle Problem Language Result Execution time Memory
604863 2022-07-25T10:29:15 Z proma ICC (CEOI16_icc) C++17
7 / 100
 358 ms 792 KB 
#include "icc.h"
#include <bits/stdc++.h>

using namespace std;

void run(int n) {
    set<pair<int,int>> edges;
    for(int i = 0; i < n - 1; i++) {
        for(int a = 1; a <= n; ++a) {
            for(int b = a + 1; b <= n; ++b) {
                int* arr1 = new int[1];
                arr1[0] = a;
                int* arr2 = new int[1];
                arr2[0] = b;
                if(edges.count({a,b}) == 0 && query(1, 1, arr1, arr2) == 1) {
                    edges.insert({a,b});
                    cerr << a << " " << b << endl;
                    setRoad(a, b);
                    a = n + 1;
                    b = n + 1;
                }
            }
        }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 468 KB Ok! 1015 queries used.
2 Correct 43 ms 516 KB Ok! 1010 queries used.

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 258 ms 760 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 358 ms 716 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 324 ms 792 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 315 ms 684 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 272 ms 620 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -