제출 #1300231

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1300231		rxlfd314	스핑크스 (IOI24_sphinx)	C++20	57 / 100	33 ms	648 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ari2 = array<int, 2>;
using ari3 = array<int, 3>;
using arl2 = array<ll, 2>;
using arl3 = array<ll, 3>;
template <class T> using vt = vector<T>;
#define all(x) begin(x), end(x)
#define size(x) (int((x).size()))
#define REP(a,b,c,d) for(int a=(b);(d)>0?a<=(c):a>=(c);a+=(d))
#define FOR(a,b,c) REP(a,b,c,1)
#define ROF(a,b,c) REP(a,b,c,-1)

int query(const vt<int> &E) { return perform_experiment(E); }

vt<int> find_colours(const int N, const vt<int> X, const vt<int> Y) {
  const int M = size(X);
  vt<int> ret(N);
  if (false && N <= 50) {
    FOR(i, 0, N-1)
      FOR(c, 0, N-1) {
        vt<int> E(N, c);
        E[i] = -1;
        if (query(E) == 1) {
          ret[i] = c;
          break;
        }
      }
    return ret;
  }
  if (M == N * (N-1) / 2) {
    FOR(i, 0, N-1) {
      int lo = 0, hi = N-1;
      while (lo < hi) {
        const int mid = lo + hi >> 1;
        vt<int> E(N);
        E[i] = -1;
        int cur = 0;
        FOR(j, 0, N-1)
          if (j != i)
            E[j] = min(cur++, mid);
        if (query(E) > mid + 1)
          lo = mid + 1;
        else
          hi = mid;
      }
      ret[i] = lo;
    }
    return ret;
  }
  bool sub3 = true;
  FOR(i, 0, M - 1)
    sub3 &= X[i] == i && Y[i] == i + 1;
  if (sub3) {
    vt<int> ans(N);
    FOR(s, 0, 1) {
      vt<int> test, subject;
      REP(i, s, N - 1, 2)
        test.push_back(i);
      REP(i, !s, N - 1, 2)
        subject.push_back(i);
      FOR(c, 0, N - 1) {
        int prv = -1;
        while (prv + 1 < size(subject)) {
          vt<int> E(N);
          for (const auto &i : test)
            E[i] = c;
          FOR(i, 0, prv)
            E[subject[i]] = N;
          FOR(i, prv + 1, size(subject) - 1)
            E[subject[i]] = -1;
          if (query(E) == N)
            break;
          int lo = prv + 1, hi = size(subject) - 1;
          while (lo < hi) {
            const int mid = lo + hi >> 1;
            FOR(i, prv + 1, mid)
              E[subject[i]] = -1;
            FOR(i, mid + 1, size(subject) - 1)
              E[subject[i]] = N;
            if (query(E) == N)
              lo = mid + 1;
            else
              hi = mid;
          }
          ans[subject[lo]] = c;
          prv = lo;
        }
      }
    }
    return ans;
  }
}

컴파일 시 표준 에러 (stderr) 메시지

sphinx.cpp: In function 'vt<int> find_colours(int, vt<int>, vt<int>)':
sphinx.cpp:95:1: warning: control reaches end of non-void function [-Wreturn-type]
   95 | }
      | ^

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