Submission #1298873

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

sphinx

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

vector<int> find_colours(int n, vector<int> x, vector<int> y) {
  vector<int> e(n , n) , ans(n , n);
  vector<pair<int , int>> paths;
  int v = 0;
  for(int i = 0; i < n-1; i++){
    e[i] = -1; e[i+1] = -1;
    int act = perform_experiment(e);
    if(act == 3){
      ans[i] = v; v++; ans[i+1] = v;
    }
    else if(ans[i] != n) ans[i+1] = ans[i];
    else{ans[i] = v; ans[i+1] = v; v++;}
  }
  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