oj.uz

Submission #805354

# Submission time Handle Problem Language Result Execution time Memory
805354 2023-08-03T15:40:30 Z peijar Koala Game (APIO17_koala) C++17
30 / 100
 76 ms 448 KB 
#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 = W / 2;
  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) {
    // 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.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 3 ms 320 KB Output is correct
3 Correct 3 ms 208 KB Output is correct
4 Correct 3 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 11 ms 312 KB Output is correct
4 Correct 10 ms 312 KB Output is correct

Subtask #3
11.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 73 ms 324 KB Output is partially correct
2 Partially correct 76 ms 328 KB Output is partially correct
3 Partially correct 75 ms 328 KB Output is partially correct
4 Partially correct 72 ms 448 KB Output is partially correct
5 Partially correct 70 ms 328 KB Output is partially correct
6 Partially correct 70 ms 324 KB Output is partially correct
7 Partially correct 70 ms 312 KB Output is partially correct
8 Partially correct 71 ms 324 KB Output is partially correct
9 Partially correct 69 ms 292 KB Output is partially correct
10 Partially correct 71 ms 308 KB Output is partially correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -