oj.uz

답안 #224388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224388 2020-04-17T18:22:59 Z Bruteforceman 코알라 (APIO17_koala) C++11
52 / 100
 80 ms 512 KB 
#include <bits/stdc++.h>
#include "koala.h"
using namespace std;

int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int A[N], B[N];
    for(int i = 0; i < N; i++) {
      if(i)  A[i] = 0;
      else A[i] = 1;
    }
    playRound(A, B);
    for(int i = 0; i < N; i++) {
      if(A[i] >= B[i]) return i;
    }
    return 0;
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
  vector <int> can;
  for(int i = 0; i < N; i++) can.emplace_back(i);
  int A[N], B[N];
  for(int i = 1; i <= 13; i++) {
    memset(A, 0, sizeof A);
    for(int j : can) {
      A[j] = i;
    }
    playRound(A, B);
    vector <int> aux;
    for(int j : can) {
      if(A[j] < B[j]) aux.emplace_back(j);
    }
    swap(can, aux);
    if(can.size() == 1) return can[0];
  }
  return 0;
}

int cmp(int sz, int coin,  int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
  if(N == W) return 0;
  int l = 0, r = 13;
  int A[sz],  B[sz];
  while(l < r) {
    int m = (l + r) >> 1;
    memset(A, 0, sizeof A);
    A[N] = A[W] = m;
    playRound(A, B);
    if(A[N] < B[N] && A[W] < B[W]) {
      l = m + 1;
    } else if (A[N] >= B[N] && A[W] >= B[W]) {
      r = m;
    } else {
      return B[N] < B[W];
    }
  }
  return 0;
}
int greaterValue(int N, int W) {
  return cmp(N, W, 0, 1);
}

void allValues(int N, int W, int *P) {
  int A[N];
  for(int i = 0; i < N; i++) {
    A[i] = i;
  }
  sort(A, A + N, [&] (int i, int j) { return cmp(N, W, i, j);  });
  for(int i = 0; i < N; i++) {
    P[A[i]] = i + 1;
  }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 10 ms 384 KB Output is correct

Subtask #2
7.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 38 ms 384 KB Output is partially correct
2 Partially correct 39 ms 384 KB Output is partially correct
3 Partially correct 38 ms 384 KB Output is partially correct
4 Partially correct 38 ms 384 KB Output is partially correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 384 KB Output is correct
2 Correct 80 ms 384 KB Output is correct
3 Correct 72 ms 384 KB Output is correct
4 Correct 72 ms 384 KB Output is correct
5 Correct 70 ms 384 KB Output is correct
6 Correct 68 ms 384 KB Output is correct
7 Correct 72 ms 396 KB Output is correct
8 Correct 70 ms 384 KB Output is correct
9 Correct 70 ms 384 KB Output is correct
10 Correct 73 ms 384 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 39 ms 376 KB Output is partially correct
2 Partially correct 51 ms 384 KB Output is partially correct
3 Partially correct 45 ms 384 KB Output is partially correct
4 Partially correct 46 ms 384 KB Output is partially correct
5 Partially correct 56 ms 384 KB Output is partially correct
6 Partially correct 46 ms 384 KB Output is partially correct
7 Partially correct 47 ms 384 KB Output is partially correct
8 Partially correct 48 ms 512 KB Output is partially correct
9 Partially correct 49 ms 384 KB Output is partially correct
10 Partially correct 43 ms 384 KB Output is partially correct
11 Partially correct 46 ms 380 KB Output is partially correct
12 Partially correct 32 ms 384 KB Output is partially correct
13 Partially correct 47 ms 384 KB Output is partially correct
14 Partially correct 46 ms 384 KB Output is partially correct
15 Partially correct 46 ms 384 KB Output is partially correct
16 Partially correct 48 ms 384 KB Output is partially correct
17 Partially correct 53 ms 384 KB Output is partially correct
18 Partially correct 52 ms 384 KB Output is partially correct
19 Partially correct 46 ms 384 KB Output is partially correct
20 Partially correct 48 ms 384 KB Output is partially correct
21 Partially correct 48 ms 376 KB Output is partially correct
22 Partially correct 48 ms 384 KB Output is partially correct
23 Partially correct 38 ms 384 KB Output is partially correct
24 Partially correct 50 ms 384 KB Output is partially correct
25 Partially correct 47 ms 384 KB Output is partially correct
26 Partially correct 49 ms 384 KB Output is partially correct
27 Partially correct 46 ms 384 KB Output is partially correct
28 Partially correct 48 ms 376 KB Output is partially correct
29 Partially correct 46 ms 384 KB Output is partially correct
30 Partially correct 47 ms 384 KB Output is partially correct
31 Partially correct 46 ms 384 KB Output is partially correct
32 Partially correct 48 ms 384 KB Output is partially correct
33 Partially correct 48 ms 384 KB Output is partially correct
34 Partially correct 41 ms 384 KB Output is partially correct
35 Partially correct 47 ms 384 KB Output is partially correct
36 Partially correct 45 ms 384 KB Output is partially correct
37 Partially correct 47 ms 384 KB Output is partially correct
38 Partially correct 47 ms 384 KB Output is partially correct
39 Partially correct 47 ms 384 KB Output is partially correct
40 Partially correct 50 ms 384 KB Output is partially correct