제출 #111469

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
111469	2019-05-15 12:40:45	diamond_duke	코알라 (APIO17_koala)	C++11	29 / 100	45 ms	416 KiB

koala

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "koala.h"
#include <vector>
#include <cstdio>
std::vector<bool> query(const std::vector<int> &vec)
{
  static int B[105], R[105];
  int n = vec.size();
  for (int i = 0; i < n; i++)
    B[i] = vec[i];
  playRound(B, R);
  std::vector<bool> res(n);
  for (int i = 0; i < n; i++)
    res[i] = R[i] > B[i];
  return res;
}
int minValue(int n, int m)
{
  std::vector<int> vec(n);
  vec[0] = 1;
  auto res = query(vec);
  for (int i = 0; i < n; i++)
  {
    if (!res[i])
      return i;
  }
  return -1;
}
int maxValue(int n, int m)
{
  std::vector<bool> in(n, true);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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