Submission #1190457

#TimeUsernameProblemLanguageResultExecution timeMemory
1190457gygSphinx's Riddle (IOI24_sphinx)C++20
10 / 100
42 ms912 KiB
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
#define arr array 
#define vec vector

int n;

int qry(vec<int> x) {
    return perform_experiment(x);
}

vec<int> find_colours(int _n, vec<int> _u, vec<int> _v) {
    n = _n;

    vec<int> cl(n);
    for (int u = 0; u < n; u++) {
        for (int c = 0; c < n; c++) {
            vec<int> qr;
            for (int v = 0; v < n; v++)
                qr.push_back((v == u) ? -1 : c);
            if (qry(qr) == 1) cl[u] = c;
        }
    }
    return cl;
}
#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...