oj.uz

답안 #401047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
401047 2021-05-09T09:13:56 Z my99n 코알라 (APIO17_koala) C++14
100 / 100
 106 ms 332 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int b[110], r[110];
 
void clear () {
  memset(b, 0, sizeof b);
  memset(r, 0, sizeof r);
}
 
int minValue(int N, int W) {
  clear();
  b[0] = 1; playRound(b, r);
  for (int i = 0; i < N; i++) if (r[i] == 0) return i;
  assert(false);
}
 
int maxValue(int N, int W) {
  vector<int> t;
  vector<int> xs = {1, 2, 4, 11};
  for (int i = 0; i < N; i++) t.push_back(i);
  for (int x : xs) {
    clear();
    for (auto i : t) b[i] = x;
    playRound(b, r);
    t.clear();
    for (int i = 0; i < N; i++) {
      if (r[i] > x) t.push_back(i);
    }
  }
  return t[0];
}
 
int solve (int aa, int bb, int x) {
  int n = 100, w = 100;
  vector<int> gr;
  clear();
  b[aa] = x, b[bb] = x; playRound(b, r);
  for (int i = 0; i < n; i++) if (r[i] > 1 and r[i] > b[i]) gr.push_back(i); 
  if (gr.size() == 1) {
    if (gr[0] == aa) return 0;
    else return 1;
  }
  if (gr.size() == 0) return -100;
  if (gr.size() == 2) return 100;
  assert(false);
}
 
bool compare(int aa, int bb) {
  int n = 100, w = 100;
  int s3 = solve(aa, bb, 3);
  if (s3 == 100) {
    int s6 = solve(aa, bb, 6);
    if (s6 == 100) return solve(aa, bb, 10);
    return s6;
  }
  else if (s3 == -100) {
    int mn = minValue(n, w);
    if (mn == aa) return 1;
    if (mn == bb) return 0;
    return solve(aa, bb, 2);
  }
  return s3;
}
 
bool compare2 (int aa, int bb) {
  int n = 100, w = 200;
  clear(); b[aa] = n; b[bb] = n;
  playRound(b, r);
  if (r[aa] > n) return 0;
  else return 1;
}
 
int greaterValue(int N, int W) { return compare(0, 1); }

void split(vector<int> v, int L, int R, int *P) {
  if (L == R) return void(P[v[0]] = L);
  clear();
  int num = min(100/(R-L+1), (int)pow(L, 0.5));
  for (auto x : v) b[x] = num;
  playRound(b, r);
  vector<int> m, n;
  for (int x : v) {
    if (r[x] > b[x]) m.push_back(x);
    else n.push_back(x);
  }
  int mid = (L+n.size()-1);
  split(m, mid+1, R, P);
  split(n, L, mid, P);
}
 
void allValues(int N, int W, int *P) {
  if (W == 2*N) {
    vector<int> v;
    for (int i = 0; i < N; i++) v.push_back(i);
    stable_sort(v.begin(), v.end(), compare2);
    for (int i = 0; i < v.size(); i++) {
      P[v[i]] = i+1;
    }
  } else {
    vector<int> v;
    for (int i = 0; i < N; i++) v.push_back(i);
    split(v, 1, N, P);
  }
  return;
}

Compilation message

koala.cpp: In function 'int solve(int, int, int)':
koala.cpp:35:16: warning: unused variable 'w' [-Wunused-variable]
   35 |   int n = 100, w = 100;
      |                ^
koala.cpp: In function 'bool compare2(int, int)':
koala.cpp:67:16: warning: unused variable 'w' [-Wunused-variable]
   67 |   int n = 100, w = 200;
      |                ^
koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:97:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 200 KB Output is correct
2 Correct 6 ms 200 KB Output is correct
3 Correct 6 ms 200 KB Output is correct
4 Correct 6 ms 320 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 320 KB Output is correct
2 Correct 19 ms 316 KB Output is correct
3 Correct 19 ms 316 KB Output is correct
4 Correct 21 ms 320 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 312 KB Output is correct
2 Correct 101 ms 328 KB Output is correct
3 Correct 106 ms 316 KB Output is correct
4 Correct 97 ms 332 KB Output is correct
5 Correct 97 ms 328 KB Output is correct
6 Correct 97 ms 332 KB Output is correct
7 Correct 98 ms 328 KB Output is correct
8 Correct 96 ms 328 KB Output is correct
9 Correct 97 ms 328 KB Output is correct
10 Correct 96 ms 328 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 200 KB Output is correct
2 Correct 51 ms 296 KB Output is correct
3 Correct 51 ms 320 KB Output is correct
4 Correct 49 ms 200 KB Output is correct
5 Correct 48 ms 200 KB Output is correct
6 Correct 49 ms 300 KB Output is correct
7 Correct 50 ms 292 KB Output is correct
8 Correct 53 ms 296 KB Output is correct
9 Correct 49 ms 200 KB Output is correct
10 Correct 51 ms 308 KB Output is correct
11 Correct 50 ms 316 KB Output is correct
12 Correct 22 ms 312 KB Output is correct
13 Correct 47 ms 200 KB Output is correct
14 Correct 43 ms 200 KB Output is correct
15 Correct 43 ms 200 KB Output is correct
16 Correct 46 ms 300 KB Output is correct
17 Correct 44 ms 200 KB Output is correct
18 Correct 44 ms 200 KB Output is correct
19 Correct 45 ms 200 KB Output is correct
20 Correct 46 ms 200 KB Output is correct

Subtask #5
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 328 KB Output is correct
2 Correct 5 ms 320 KB Output is correct
3 Correct 5 ms 328 KB Output is correct
4 Correct 5 ms 200 KB Output is correct
5 Correct 5 ms 328 KB Output is correct
6 Correct 5 ms 324 KB Output is correct
7 Correct 5 ms 200 KB Output is correct
8 Correct 5 ms 200 KB Output is correct
9 Correct 5 ms 328 KB Output is correct
10 Correct 5 ms 200 KB Output is correct
11 Correct 5 ms 328 KB Output is correct
12 Correct 5 ms 328 KB Output is correct
13 Correct 5 ms 328 KB Output is correct
14 Correct 5 ms 200 KB Output is correct
15 Correct 5 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 5 ms 328 KB Output is correct
18 Correct 5 ms 200 KB Output is correct
19 Correct 5 ms 328 KB Output is correct
20 Correct 5 ms 200 KB Output is correct
21 Correct 5 ms 316 KB Output is correct
22 Correct 5 ms 200 KB Output is correct
23 Correct 5 ms 328 KB Output is correct
24 Correct 5 ms 328 KB Output is correct
25 Correct 5 ms 200 KB Output is correct
26 Correct 5 ms 200 KB Output is correct
27 Correct 6 ms 200 KB Output is correct
28 Correct 5 ms 200 KB Output is correct
29 Correct 5 ms 328 KB Output is correct
30 Correct 5 ms 328 KB Output is correct
31 Correct 6 ms 328 KB Output is correct
32 Correct 5 ms 200 KB Output is correct
33 Correct 5 ms 200 KB Output is correct
34 Correct 6 ms 328 KB Output is correct
35 Correct 5 ms 200 KB Output is correct
36 Correct 5 ms 200 KB Output is correct
37 Correct 5 ms 200 KB Output is correct
38 Correct 5 ms 200 KB Output is correct
39 Correct 5 ms 200 KB Output is correct
40 Correct 5 ms 324 KB Output is correct