Submission #1217991

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217991		dosts	Sphinx's Riddle (IOI24_sphinx)	C++20	10 / 100	57 ms	32756 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
vi edges[LIM];
vi vis(LIM,0);

void dfs(int node,int b1,int b2) {
  vis[node] = 1;
  for (auto it : edges[node]) {
    if (it == b1 || it == b2) continue;
    if (vis[it]) continue;
    dfs(it,b1,b2);
  }
}
vector<signed> find_colours(signed N, vector<signed> X, vector<signed> Y) {
  int M = X.size();
  for (int i = 0;i<M;i++) {
    edges[X[i]].push_back(Y[i]);
    edges[Y[i]].push_back(X[i]);
  }
  vector<signed> color(N);
  vector<signed> orig(N,-1);
  for (int i = 0;i<N;i++) {
    int useit = edges[i][0];
    orig.assign(N,N);
    vis.assign(N,0);
    orig[i] = -1;
    orig[useit] = -1;
    int comp = 0;
    for (int j = 0;j<N;j++) {
      if (orig[j] == N && !vis[j]) {
        comp++;
        dfs(j,i,useit);
      }
    }
    for (int j = 0;j<N;j++) {
      orig[useit] = j;
      int y = perform_experiment(orig);
      if (y-comp == 1) {
        color[i] = j;
        break;
      }
    }
  }
  return color;
}

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