Submission #1206602

#TimeUsernameProblemLanguageResultExecution timeMemory
1206602HappyCapybaraSphinx's Riddle (IOI24_sphinx)C++20
24 / 100
31 ms656 KiB
#include "sphinx.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> find_colours(int N, vector<int> X, vector<int> Y){
  vector<int> C(N, -1);
  for (int i=0; i<N; i++){
    int l = 0, r = N;
    while (l < r-1){
      int m = (l+r)/2;
      int cur = 0;
      vector<int> v(N, -1);
      for (int j=0; j<N; j++){
        if (i == j) continue;
        v[j] = cur;
        if (cur < m-1) cur++;
      }
      if (perform_experiment(v) == m) r = m;
      else l = m;
    }
    C[i] = l;
  }
  return C;
}
#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...