Submission #604705

#TimeUsernameProblemLanguageResultExecution timeMemory
604705snasibov05ICC (CEOI16_icc)C++14
0 / 100
343 ms484 KiB
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;

void run(int n) {
    int arra[n+1], arrb[n+1];
    vector<vector<bool>> ed(n+1, vector<bool>(n+1));
    for(int i = 0; i < n - 1; i++) {
        int u = -1, v = -1;
        for (int j = 1; j <= n; ++j){

            arra[0] = j;
            int x = 0;
            for (int k = 1; k <= n; ++k){
                if (ed[j][k] || j == k) continue;
                arrb[x++] = k;
            }

            if (query(1, x, arra, arrb)) {
                if (u == -1) u = j;
                else v = j;
            }
        }

        assert(u != -1 && v != -1);
        setRoad(u, v);
        ed[u][v] = ed[v][u] = true;

    }
}
#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...