oj.uz

답안 #224411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224411 2020-04-17T19:27:46 Z Bruteforceman 코알라 (APIO17_koala) C++11
39 / 100
 71 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 = 1, r = min(13, coin / 2);
  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 - 1;
    } else {
      return B[N] < B[W];
    }
  }
  return 0;
}
int greaterValue(int N, int W) {
  return cmp(N, W, 0, 1);
}
void getAll(vector <int> &v, int N, int W) {
  int opt = W / v.size();
  int A[N], B[N];
  memset(A, 0, sizeof A);
  for(int i : v) {
    A[i] = opt;
  }
  playRound(A, B);
  vector <int> left, right;
  for(int i : v) {
    if(A[i] < B[i]) right.emplace_back(i);
    else left.emplace_back(i);
  }
  if(left.empty() || right.empty()) {
    sort_heap(v.begin(), v.end(),  [&] (int i, int j) { return cmp(N, W, i, j);  });
  } else {
    getAll(left, N, W);
    getAll(right, N, W);
    v = left;
    for(int i : right) v.emplace_back(i);
  }
}
void allValues(int N, int W, int *P) {
  vector <int> v (N);
  for(int i = 0; i < N; i++) {
    v[i] = i;
  }
  getAll(v, N, W);
  for(int i = 0; i < N; i++) {
    P[v[i]] = i + 1;
  }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 10 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 37 ms 512 KB Output is partially correct
2 Partially correct 36 ms 384 KB Output is partially correct
3 Partially correct 37 ms 384 KB Output is partially correct
4 Partially correct 37 ms 384 KB Output is partially correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 384 KB Output is correct
2 Correct 71 ms 432 KB Output is correct
3 Correct 65 ms 384 KB Output is correct
4 Correct 65 ms 384 KB Output is correct
5 Correct 67 ms 384 KB Output is correct
6 Correct 65 ms 512 KB Output is correct
7 Correct 65 ms 384 KB Output is correct
8 Correct 64 ms 512 KB Output is correct
9 Correct 65 ms 504 KB Output is correct
10 Correct 65 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 384 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 21 ms 384 KB Output is correct
4 Correct 20 ms 384 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 20 ms 384 KB Output is correct
7 Correct 20 ms 384 KB Output is correct
8 Correct 20 ms 384 KB Output is correct
9 Correct 20 ms 384 KB Output is correct
10 Correct 20 ms 384 KB Output is correct
11 Correct 20 ms 288 KB Output is correct
12 Correct 20 ms 384 KB Output is correct
13 Correct 21 ms 512 KB Output is correct
14 Correct 20 ms 384 KB Output is correct
15 Correct 22 ms 384 KB Output is correct
16 Correct 20 ms 384 KB Output is correct
17 Correct 20 ms 384 KB Output is correct
18 Correct 20 ms 384 KB Output is correct
19 Correct 21 ms 384 KB Output is correct
20 Correct 20 ms 384 KB Output is correct

Subtask #5
0 / 53.0

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