oj.uz

Submission #400726

# Submission time Handle Problem Language Result Execution time Memory
400726 2021-05-08T15:07:44 Z my99n Koala Game (APIO17_koala) C++14
30 / 100
 180 ms 444 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);
  if (r[0] != 2) return 0;
  for (int i = 0; i < N; i++) {
    if (r[i] == 0) return i;
  }
  return -1;
}

int maxValue(int N, int W) {
  clear();
  vector<int> t;
  for (int i = 0; i < N; i++) b[i] = 1;
  playRound(b, r);
  for (int i = 0; i < N; i++) {
    if (r[i] > b[i]) t.push_back(i);
  }

  clear();
  for (auto x : t) b[x] = 2;
  playRound(b, r);
  t.clear();
  for (int i = 0; i < N; i++) {
    if (r[i] > 2) t.push_back(i);
  }

  clear();
  for (auto x : t) b[x] = 4;
  playRound(b, r);
  t.clear();
  for (int i = 0; i < N; i++) {
    if (r[i] > 4) t.push_back(i);
  }

  clear();
  for (auto x : t) b[x] = 11;
  playRound(b, r);
  t.clear();
  for (int i = 0; i < N; i++) {
    if (r[i] > 11) t.push_back(i);
  }
  
  return t[0];
}

int greaterValue(int N, int W) {
  clear();
  int mn = -1;
  b[0] = 1; playRound(b, r);
  if (r[0] != 2) mn=0;
  for (int i = 0; i < N; i++) {
    if (r[i] == 0) mn=i;
  }

  if (mn == 0) return 1;
  if (mn == 1) return 0;

  vector<int> one, gr;
  vector<int> xs; 
  xs.push_back(2);
  xs.push_back(3);
  xs.push_back(6);
  xs.push_back(10);
  for (auto x : xs) {
    clear();
    gr.clear();
    b[0] = x, b[1] = x;
    playRound(b, r);
    for (int i = 0; i < N; i++) if (r[i] == 1) one.push_back(i);
    for (int i = 0; i < N; i++) if (r[i] > 1 and r[i] > b[i]) gr.push_back(i);
    
    if (gr.size() == 1) return gr[0];
    // cout <<  one.size() << ' ' << gr.size() << endl;
  }
  assert(false);
}

void allValues(int N, int W, int *P) {
  if (W == 2*N) {
    // TODO: Implement Subtask 4 solution here.
    // You may leave this block unmodified if you are not attempting this
    // subtask.
  } else {
    // TODO: Implement Subtask 5 solution here.
    // You may leave this block unmodified if you are not attempting this
    // subtask.
  }
  return;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory 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 200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 200 KB Output is correct
2 Correct 18 ms 312 KB Output is correct
3 Correct 18 ms 320 KB Output is correct
4 Correct 18 ms 312 KB Output is correct

Subtask #3
11.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 179 ms 320 KB Output is partially correct
2 Partially correct 174 ms 324 KB Output is partially correct
3 Partially correct 178 ms 320 KB Output is partially correct
4 Partially correct 177 ms 320 KB Output is partially correct
5 Partially correct 179 ms 444 KB Output is partially correct
6 Partially correct 175 ms 308 KB Output is partially correct
7 Partially correct 174 ms 320 KB Output is partially correct
8 Partially correct 180 ms 316 KB Output is partially correct
9 Partially correct 180 ms 312 KB Output is partially correct
10 Partially correct 172 ms 320 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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