oj.uz

Submission #968987

# Submission time Handle Problem Language Result Execution time Memory
968987 2024-04-24T10:49:25 Z kilkuwu Koala Game (APIO17_koala) C++17
47 / 100
 44 ms 596 KB 
#include "koala.h"
 
#include <bits/stdc++.h>
#ifdef LOCAL
#include "template/debug.hpp"
#else
#define dbg(...) ;
#define timer(...) ;
#endif
 
int minValue(int N, int W) {
  int B[N], R[N];
  for (int i = 0; i < N; i++) {
    B[i] = 0;
  }
  B[0] = 1;
  playRound(B, R);
 
  for (int i = 0; i < N; i++) {
    if (R[i] <= B[i]) {
      return i;
    }
  }
}
 
int maxValue(int N, int W) {
  int B[N], R[N];
  for (int i = 0; i < N; i++) {
    B[i] = 1;
  }
  playRound(B, R);
  int candidate[N];
  for (int i = 0; i < N; i++) {
    if (R[i] > B[i]) {
      candidate[i] = 1;
      B[i] = 2;
    } else {
      candidate[i] = 0;
      B[i] = 0;
    }
  }
  playRound(B, R);
  for (int i = 0; i < N; i++) {
    if (R[i] > B[i]) {
      if (candidate[i]) {
        B[i] = 4;
      } else {
        B[i] = 0;
      }
    } else {
      candidate[i] = 0;
      B[i] = 0;
    }
  }
  playRound(B, R);
  for (int i = 0; i < N; i++) {
    if (R[i] > B[i]) {
      if (candidate[i]) {
        B[i] = 11;
      } else {
        B[i] = 0;
      }
    } else {
      candidate[i] = 0;
      B[i] = 0;
    }
  }
  playRound(B, R);
 
  for (int i = 0; i < N; i++) {
    if (R[i] > B[i] && candidate[i]) return i;
  }
}
 
int greaterValue(int N, int W) {
  int B[N], R[N];

  for (int i = 0; i < N; i++) B[i] = 0;
  int mb = 5;
  B[0] = B[1] = mb;
  playRound(B, R);
  bool bought0 = R[0] > B[0];
  bool bought1 = R[1] > B[1];

  if (bought0 != bought1) return bought1;

  if (bought0) {
    mb = 8;
  } else {
    mb = 2;
  }

  B[0] = B[1] = mb;
  playRound(B, R);
  bought0 = R[0] > B[0];
  bought1 = R[1] > B[1];

  if (bought0 != bought1) return bought1;

  if (bought0) {
    mb = 3;
  } else {
    mb = 1;
  }

  B[0] = B[1] = mb;
  playRound(B, R);
  bought0 = R[0] > B[0];
  bought1 = R[1] > B[1];

  if (bought0 != bought1) return bought1;
  assert(false);
}

int B[100], R[100];

 
void allValues(int N, int W, int *P) {
  if (W == 2 * N) {
    std::vector<int> ord(N);
    std::iota(ord.begin(), ord.end(), 0);

    auto compare = [&](int i, int j) -> bool {
      B[i] = B[j] = W / 2;
      playRound(B, R);
      B[i] = B[j] = 0;
      return R[j] > B[j];
    };

    std::function<void(std::vector<int>&)> merge_sort = [&](std::vector<int>& v) -> void {
      if (v.size() == 1) return;
      int mid = v.size() / 2;
      std::vector<int> l(v.begin(), v.begin() + mid);
      std::vector<int> r(v.begin() + mid, v.end());
      merge_sort(l);
      merge_sort(r);
      std::merge(l.begin(), l.end(), r.begin(), r.end(), v.begin(), compare);
    };

    merge_sort(ord);

    for (int i = 0; i < N; i++) {
      P[ord[i]] = i + 1;
    }
  } else {
    // TODO: Implement Subtask 5 solution here.
    // You may leave this block unmodified if you are not attempting this
    // subtask.
  }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:73:1: warning: control reaches end of non-void function [-Wreturn-type]
   73 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 3 ms 464 KB Output is correct
3 Correct 3 ms 352 KB Output is correct
4 Correct 3 ms 352 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 352 KB Output is correct
2 Correct 10 ms 352 KB Output is correct
3 Correct 10 ms 464 KB Output is correct
4 Correct 10 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 480 KB Output is correct
2 Correct 44 ms 472 KB Output is correct
3 Correct 40 ms 488 KB Output is correct
4 Correct 39 ms 484 KB Output is correct
5 Correct 39 ms 356 KB Output is correct
6 Correct 40 ms 480 KB Output is correct
7 Correct 40 ms 504 KB Output is correct
8 Correct 43 ms 476 KB Output is correct
9 Correct 41 ms 464 KB Output is correct
10 Correct 39 ms 480 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 352 KB Output is correct
2 Correct 26 ms 452 KB Output is correct
3 Correct 26 ms 424 KB Output is correct
4 Correct 25 ms 544 KB Output is correct
5 Correct 24 ms 344 KB Output is correct
6 Correct 28 ms 452 KB Output is correct
7 Correct 24 ms 596 KB Output is correct
8 Correct 24 ms 340 KB Output is correct
9 Correct 24 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 24 ms 344 KB Output is correct
12 Correct 16 ms 344 KB Output is correct
13 Correct 24 ms 344 KB Output is correct
14 Correct 22 ms 344 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 22 ms 344 KB Output is correct
17 Correct 22 ms 344 KB Output is correct
18 Correct 22 ms 344 KB Output is correct
19 Correct 23 ms 452 KB Output is correct
20 Correct 23 ms 344 KB Output is correct

Subtask #5
0 / 53.0

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