Submission #1192197

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192197		NotLinux	Sphinx's Riddle (IOI24_sphinx)	C++20	10 / 100	41 ms	908 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.begin()
#define all(x) x.begin() , x.end()
const int N = 255;
int par[N];
int find(int a){
    if(par[a] == a)return a;
    return par[a] = find(par[a]);
}
void merge(int a , int b){
    par[find(b)] = find(a);
}
vector<int> find_colours(int n, vector<int> x, vector<int> y) {
    vector<int>col(n);
    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++){
            vector<int>vec(n,j);
            vec[i] = -1;
            if(perform_experiment(vec) == 1){
                col[i] = j;
                break;
            }
        }
    }
    return col;
}

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