제출 #805395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805395		peijar	코알라 (APIO17_koala)	C++17	47 / 100	48 ms	444 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

int minValue(int N, int W) {
  vector<int> b(N);
  b[0] = 1;
  vector<int> r(N);
  playRound(b.data(), r.data());
  for (int i = 0; i < N; ++i)
    if (b[i] >= r[i])
      return i;
  assert(false);
}

int maxValue(int N, int W) {
  vector<int> candidats(N);
  iota(candidats.begin(), candidats.end(), 0);

  while (candidats.size() > 1) {
    int nbCandidats = candidats.size();
    vector<int> b(N);
    for (int u : candidats)
      b[u] = W / nbCandidats;
    vector<int> r(N);
    playRound(b.data(), r.data());
    ;
    vector<int> nxt;
    for (int u : candidats)
      if (b[u] < r[u])
        nxt.push_back(u);
    candidats = nxt;
  }
  assert(!candidats.empty());
  return candidats[0];
  return 0;
}

int greaterValue(int N, int W) {
  int lo = 1, up = 9;
  while (true) {
    int x = (lo + up) / 2;
    vector<int> b(N), r(N);
    b[0] = b[1] = x;
    playRound(b.data(), r.data());
    int take0 = b[0] < r[0];
    int take1 = b[1] < r[1];
    dbg(x, take0, take1);
    if (take0 and take1)
      lo = x + 1;
    else if (!take0 and !take1)
      up = x - 1;
    else if (take0)
      return 0;
    else
      return 1;
  }
}

void allValues(int N, int W, int *P) {
  if (W == 2 * N) {

    auto compare = [&](int i, int j) {
      vector<int> b(N);
      b[i] = b[j] = N;
      vector<int> r(N);
      playRound(b.data(), r.data());
      assert((b[i] < r[i]) xor (b[j] < r[j]));
      return b[i] >= r[i];
    };

    vector<int> order(N);
    iota(order.begin(), order.end(), 0);
    auto merge_sort = [&](auto rec, vector<int> toSort) {
      if (toSort.size() == 1)
        return toSort;
      vector<int> l, r;
      for (int i = 0; i < (int)toSort.size(); ++i)
        (i % 2 ? r : l).push_back(toSort[i]);
      l = rec(rec, l);
      r = rec(rec, r);
      merge(l.begin(), l.end(), r.begin(), r.end(), toSort.begin(), compare);
      return toSort;
    };

    order = merge_sort(merge_sort, order);
    for (int i = 0; i < N; ++i)
      P[order[i]] = i + 1;

    // TODO: Implement Subtask 4 solution here.
    // You may leave this block unmodified if you are not attempting this
    // subtask.
  } else {
    // TODO: Implement Subtask 5 solution here.
    // You may leave this block unmodified if you are not attempting this
    // subtask.
  }
}

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 18 / 18
• Subtask 4: 10 / 10
• Subtask 5: 0 / 53