Submission #1242519

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242519		dosts	Sphinx's Riddle (IOI24_sphinx)	C++20	0 / 100	0 ms	412 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

vector<signed> find_colours(signed N, vector<signed> X, vector<signed> Y) {
    int M = big(X);
    vector<signed> ans(N);
    vi unknown;
    for (int i = N-1;i>=0;i--) unknown.push_back(i);
    for (int i = 0;i<N;i++) {
        int l = 0;
        int r = N-1;
        while (l<=r) {
            int m = (l+r) >> 1;
            vector<signed> toask(N,N);
            int ctr = m;
            for (int j = 0;j<N;j++) {
                if (i != j && ctr>=0) {
                    toask[j] = ctr;
                    ctr--;
                }
            }
            toask[i] = -1;
            int lmao = perform_experiment(toask);
            int normalne = (m+1)+(m != N-1);
            if (lmao <= normalne) r = m-1;
            else l = m+1;
        }
        ans[i] = l;
    }
    return ans;
}

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