oj.uz

Submission #869792

# Submission time Handle Problem Language Result Execution time Memory
869792 2023-11-05T17:04:58 Z ElenaBM ICC (CEOI16_icc) C++17
7 / 100
 211 ms 616 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
void subsets(vector<vector<bool>>&matriz, int n){
    for (int i = 1; i < n; ++i){
        for (int j = i+1; j <= n; ++j){
            if (!matriz[i][j]){
                int a[1] = {i}, b[1] = {j};
                if (query(1, 1, a, b)){
                    setRoad(i, j);
                    matriz[i][j] = true;
                    matriz[j][i] = true;
                    return;
                }
            }
        }
    }
}
void run (int n){
    vector<vector<bool>>matriz(n+1, vector<bool>(n+1, false));
    for (int s = 0; s < n-1; ++s){
        subsets (matriz, n);
    }
    
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 604 KB Ok! 1015 queries used.
2 Correct 35 ms 600 KB Ok! 1010 queries used.

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 205 ms 608 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 211 ms 616 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 191 ms 616 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 175 ms 608 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 156 ms 608 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -