Submission #1217149

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217149		shmax	Sphinx's Riddle (IOI24_sphinx)	C++20	10 / 100	42 ms	1184 KiB

sphinx

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

using namespace std;

template<typename T>
using vec = vector<T>;

std::vector<int> find_colours(int n, std::vector<int> X, std::vector<int> Y) {

    vec<vec<int>> g(n);
    for (int i = 0; i < X.size(); i++) {
        g[X[i]].push_back(Y[i]);
        g[Y[i]].push_back(X[i]);
    }

    vec<int> ans(n, -1);
    for (int i = 0; i < n; i++) {
        int p = g[i][0];
        auto get_e = [&](int c) {
            vec<int> e(n, n);
            e[i] = -1;
            e[p] = c;
            return e;
        };
        int best = 0;
        int best_e = perform_experiment(get_e(best));
        for (int j = 1; j < n; j++) {
            int vg = perform_experiment(get_e(j));
            if (best_e > vg) {
                best = j;
                best_e = vg;
            }
        }
        ans[i] = best;
    }
    return ans;

//  std::vector<int> E(N, -1);

//  int x = perform_experiment(E);
//  std::vector<int> G(N, 0);
//  if (x == 1)
//    G[0] = 1;
//  return G;
}

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