Submission #1298533

#	Time	Username	Problem	Language	Result	Execution time	Memory
1298533		scalifrastico_098	Sphinx's Riddle (IOI24_sphinx)	C++20	0 / 100	1 ms	400 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_colours(int n, vector<int> x1, vector<int> y) {
  vector<int> e(n, n); int ox=2, l=1;
  vector<int> g(n); int i=0;  g[0]=0; e[0]=-1;
  for(int i=1; i<n; i++)
  {
    e[i]=-1; int u1=perform_experiment(e); 
    if(u1==ox){if(i==n-1)g[i]=g[i-1]; else{ g[i]=1-g[i-1]; }} 
    else {if(i!=n-1)g[i]=g[i-1]; else {g[i]=1-g[i-1];}}ox=u1;
  }
  return g;
}
 

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