제출 #1308418

#제출 시각아이디문제언어결과실행 시간메모리
1308418kawhiet스핑크스 (IOI24_sphinx)C++20
26.50 / 100
9 ms648 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);
  if (N <= 50) {
      vector<int> ans(N);
      for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
          vector<int> cur(N, j);
          cur[i] = -1;
          if (perform_experiment(cur) == 1) {
            ans[i] = j;
            break;
          }
        }
      }
      return ans;
  }
  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...