Submission #1247013

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247013		2008	Sphinx's Riddle (IOI24_sphinx)	C++20	0 / 100	0 ms	412 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
  vector<int> E(N, -1);
  vector<int> colors; colors.push_back(0);
  vector<int> sphinx(N, N);
  vector<int> limit(N-1,3); limit[0]=2; limit[N-2]=2;
  for (int i=0; i<N-1; i++) {
    E=sphinx; E[i]=(-1); E[i+1]=(-1);
    if (perform_experiment(E)==limit[i]) {
      colors.push_back(colors[i]);
    } else {
      colors.push_back(colors[i]+1);
    }
  }
  return colors;
}

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