Submission #1241898

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

sphinx

#include <bits/stdc++.h>
#include "sphinx.h"

using namespace std;

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
    vector<int> color(N, -1);
    vector<vector<int>> groups;

    for (int v = 0; v < N; ++v) {
        bool found = false;
        for (int g = 0; g < groups.size(); ++g) {
            vector<int> E(N, -1);
            for (int u : groups[g])
                E[u] = 0;
            E[v] = 0;
            int result = perform_experiment(E);
            if (result == 1) {
                color[v] = g;
                groups[g].push_back(v);
                found = true;
                break;
            }
        }
        if (!found) {
            color[v] = groups.size();
            groups.push_back({v});
        }
    }

    return color;
}

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