Submission #1232527

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232527		VMaksimoski008	Sphinx's Riddle (IOI24_sphinx)	C++20	24 / 100	35 ms	656 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> ans(n);
    for(int i=0; i<n; i++) ans[i] = i;

    vector<int> cnt(n); cnt[0] = 1;
    for(int u=0; u<n; u++) {
      int l=0, r=n-2;
      while(l <= r) {
        int mid = (l + r) / 2;
        vector<int> E(n, n); E[u] = -1;

        int curr = 0;
        for(int i=0; i<n; i++) {
          if(curr <= mid && i != u) E[i] = curr++;
        }

        int need = (u == n-1 && mid == u-1 ? 0 : 1) + mid + 1;
        if(perform_experiment(E) <= need) ans[u] = mid, r = mid - 1;
        else l = mid + 1;
      }

      vector<int> E(n, n-1); E[u] = -1;
      if(perform_experiment(E) == 1) ans[u] = n-1;
    }

    return ans;
}

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