Submission #1209687

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

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> E;
const int MAXN = 250;
vector<vector<int>> adj(MAXN);
int expected(int N) {
  return 0;
}

std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
  
  int M = (int)X.size();
  for (int i = 0; i < M; ++i) {
    adj[X[i]].push_back(Y[i]);
    adj[Y[i]].push_back(X[i]);
  }
  E = vector<int>(N);
  vector<int> F(N);
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      for (int k = 0; k < N; ++k) {
        E[k] = j;
      }
      E[i] = -1;
      // for (int j = 0; j < N; ++j) {
      //   cout << E[j] << " ";
      // }
      // cout << "\n";
      if (1 == perform_experiment(E)) {
        F[i] = j;
        break;
      }
    }
  }
  return F;
}

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