Submission #1298507

#TimeUsernameProblemLanguageResultExecution timeMemory
1298507scalifrastico_098Sphinx's Riddle (IOI24_sphinx)C++20
1.50 / 100
1 ms400 KiB
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_colours(int n, vector<int> x1, vector<int> y) {
  vector<vector<int>> a(n+1, vector<int> ());
  vector<int> e(n); int ox=0;
  vector<int> g(n, -1); int i=0;  g[0]=0;
  while(i<n-1)
  {
    e.assign(n, n); e[i]=-1; e[i+1]=-1;
    int u1=perform_experiment(e); 
    if((n>2&&u1==2)||(n==2&&u1==1)){g[i+1]=g[i];} 
    else {ox++; g[i+1]=ox;}i++;
  }
  return g;
}
#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...