Submission #1218466

#TimeUsernameProblemLanguageResultExecution timeMemory
1218466nikdSphinx's Riddle (IOI24_sphinx)C++20
18 / 100
4 ms412 KiB
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;


vector<int> find_colours(int n, vector<int> X, vector<int> Y) {
    for(int i = 0; i<X.size(); i++) assert(Y[i] == X[i]+1);
    vector<int> sol(n, 0);
    int cnt = 0;
    vector<int> E(n, -1);
    int c = perform_experiment(E);
    int is_c = 0;
    for(int i =0; i<n; i++){
        sol[i] = cnt;
        if(i==n-1) continue;
        
        E[i] = n;
        int cc = perform_experiment(E);
        if(cc == c + 1 + is_c){
            is_c = 1;
        }
        else{
            is_c = 0;
            cnt++;
        }
        E[i] = -1;
    }
    return sol;
}
#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...