Submission #1194691

#	Time	Username	Problem	Language	Result	Execution time	Memory
1194691		aykhn	스핑크스 (IOI24_sphinx)	C++20	0 / 100	0 ms	412 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>

using namespace std;

const int MXN = 1000;

vector<int> ans;

void solve(int l, int r, int col, int N)
{
  if (l == r) 
  {
    ans[l] = col;
    return;
  }
  int mid = (l + r) >> 1;
  {
    vector<int> c(N, 0);
    for (int i = 0; i < N; i++) 
    {
      if (i & 1) c[i] = col;
      else 
      {
        if (l <= i && i <= mid) c[i] = -1;
        else c[i] = N;
      }
    }
    if (perform_experiment(c) != N) solve(l, mid, col, N);
  }
  {
    vector<int> c(N, 0);
    for (int i = 0; i < N; i++) 
    {
      if (i & 1) c[i] = col;
      else 
      {
        if (mid + 1 <= i && i <= r) c[i] = -1;
        else c[i] = N;
      }
    }
    if (perform_experiment(c) != N) solve(mid + 1, r, col, N);
  }
}

vector<int> find_colours(int N, vector<int> X, vector<int> Y) 
{
  ans = vector<int>(N);
  for (int col = 0; col < N; col++) solve(0, N - 1, col, N);
  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 3
• Subtask 2: 0 / 7
• Subtask 3: 0 / 33
• Subtask 4: 0 / 21
• Subtask 5: 0 / 36