Submission #1308398

#TimeUsernameProblemLanguageResultExecution timeMemory
1308398kawhietSphinx's Riddle (IOI24_sphinx)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h>
#include "sphinx.h"
using namespace std;

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
  vector<int> ans(N);
  int pos = 0, color = 0;
  for (int i = 1; i < N; i++) {
    vector<int> s(N, N);
    s[i] = s[i - 1] = -1;
    int x = 4;
    if (i == 1 || i == N - 1) {
      x--;
    }
    if (perform_experiment(s) == x) {
      color ^= 1;
    }
    ans[i] = color;
  }
  return ans;
}
#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...