Submission #1218000

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218000		dosts	Sphinx's Riddle (IOI24_sphinx)	C++20	18 / 100	4 ms	412 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;

vector<signed> find_colours(signed N, vector<signed> X, vector<signed> Y) {
  vector<signed> color(N);
  vector<signed> orig(N);
  color[0] = 0;
  for (int i=1;i<N;i++) {
    orig.assign(N,N);
    orig[i] = -1;
    orig[i-1] = -1;
    int extra = (i > 1)+(i<N-1);
    int y = perform_experiment(orig);
    if (y-extra == 1) color[i] = color[i-1];
    else color[i] = color[i-1]+1;
  }
  return color;
}

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