Submission #1190706

#TimeUsernameProblemLanguageResultExecution timeMemory
1190706epicci23Sphinx's Riddle (IOI24_sphinx)C++20
0 / 100
1 ms412 KiB
#include "bits/stdc++.h"
#include "sphinx.h"
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;


vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
  vector<int> G(N, 0);
  
  int last = 2;
  
  for(int i = 1; i < N; i++){
    vector<int> E(N, 0);
    for(int j = 0; j < i; j++) E[j] = -1;
    for(int j = i + 1; j < N; j++) E[j] = N;
    int lol = perform_experiment(E);
    if(lol == last) G[i] = G[i - 1];
    else G[i] = G[i - 1] ^ 1;

    last = lol;
  }

  return G;
}
#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...