제출 #1218005

#제출 시각아이디문제언어결과실행 시간메모리
1218005dostsSphinx's Riddle (IOI24_sphinx)C++20
12 / 100
27 ms908 KiB
#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);
  vi theshit;
  int ctr = 0;
  for (int i = 0;i<N;i++) {
    int l = 0;
    int r = big(theshit);
    while (l<=r) {
      int m = (l+r) >> 1;
      vector<signed> orig(N,N);
      for (int j = 0;j<m;j++) orig[theshit[j]] = -1;
      orig[i] = -1;
      int y = perform_experiment(orig);
      if (y-(m+1 != N) == m+1) l = m+1;
      else r = m-1;
    }
    if (r == big(theshit)) theshit.push_back(i),color[i] = ctr++;
    else color[i] = color[theshit[r]];
  }
  return color;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...