제출 #1232504

#제출 시각아이디문제언어결과실행 시간메모리
1232504VMaksimoski008스핑크스 (IOI24_sphinx)C++20
0 / 100
0 ms412 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> ans(n);
    for(int i=0; i<n; i++) ans[i] = i;

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

        if(perform_experiment(E) <= 1 + 1 + mid + 1) ans[u] = ans[mid], r = mid - 1;
        else l = mid + 1;
      }
    }

    return ans;
}
#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...