Submission #1099925

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099925		model_code	Sphinx's Riddle (IOI24_sphinx)	C++17	21.50 / 100	420 ms	1192 KiB

sphinx

// partially_correct/subtask3-partial-lessq.cpp

#include <queue>

#include "sphinx.h"

using namespace std;

int count_comp(int N, vector<vector<int>> &adj, int u, int v) {
  int cnt = 0;
  vector<bool> vis(N, false);
  queue<int> q;
  for (int i = 0; i < N; ++i) {
    if (i == u || i == v || vis[i]) continue;
    ++cnt;
    vis[i] = true;
    q.push(i);
    while (!q.empty()) {
      int cur = q.front();
      q.pop();
      for (int nxt : adj[cur]) {
        if (nxt == u || nxt == v || vis[nxt]) continue;
        vis[nxt] = true;
        q.push(nxt);
      }
    }
  }
  return cnt;
}

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
  vector<vector<int>> adj, e;
  adj.assign(N, {}), e.assign(N, {});
  int M = X.size();
  for (int i = 0; i < M; ++i)
    adj[X[i]].push_back(Y[i]), adj[Y[i]].push_back(X[i]);
  for (int i = 0; i < M; ++i) {
    vector<int> ord(N, N);
    ord[X[i]] = ord[Y[i]] = -1;
    int cnt = count_comp(N, adj, X[i], Y[i]);
    if (perform_experiment(ord) == cnt + 1) {
      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