제출 #1099924

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1099924		model_code	Sphinx's Riddle (IOI24_sphinx)	C++17	21.50 / 100	85 ms	912 KiB

sphinx

// partially_correct/subtask3-partial.cpp

#include <queue>

#include "sphinx.h"

using namespace std;

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
  vector<vector<int>> e;
  e.assign(N, {});
  int M = X.size();
  for (int i = 0; i < M; ++i) {
    vector<int> ord(N, N);
    ord[X[i]] = ord[Y[i]] = -1;
    vector<int> ordchk(N, N);
    ordchk[X[i]] = 0, ordchk[Y[i]] = 1;
    if (perform_experiment(ord) < perform_experiment(ordchk)) {
      e[X[i]].push_back(Y[i]);
      e[Y[i]].push_back(X[i]);
    }
  }

  vector<int> F(N, -1);
  int c = 0;
  queue<int> q;
  for (int i = 0; i < N; ++i) {
    if (F[i] >= 0) continue;
    F[i] = c;
    q.push(i);
    while (!q.empty()) {
      int cur = q.front();
      q.pop();
      for (int nxt : e[cur]) {
        if (F[nxt] == -1) {
          F[nxt] = c;
          q.push(nxt);
        }
      }
    }
    ++c;
  }
  return F;
}

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