Submission #1229181

#TimeUsernameProblemLanguageResultExecution timeMemory
1229181PVM_pvm스핑크스 (IOI24_sphinx)C++20
24 / 100
31 ms656 KiB
#include "sphinx.h"
#include<bits/stdc++.h>
using namespace std;
#define MAXN 252

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
    vector<int> G(N, 0);
    for (int q=0;q<N;q++)
    {
        int l=-1,r=N-1;
        while (l<r-1)
        {
            int mid=(l+r)/2;
            vector<int> E(N,-1);
            int lst=0;
            for (int cur=0;cur<N;cur++)
            {
                if (q==cur) continue;
                E[cur]=lst;
                lst++;
                if (lst>mid) lst=0;
            }
            int x=perform_experiment(E);
            if (x==(mid+1)) r=mid;
            else l=mid;
        }
        G[q]=r;
    }
    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...