| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 512116 | 2022-01-16T06:47:28 Z | InternetPerson10 | Koala Game (APIO17_koala) | C++17 | 65 ms | 344 KB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int B[100], R[100];
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.
B[0] = 1;
playRound(B, R);
if(R[0] == 2) {
for(int i = 1; i < N; i++) {
if(R[i] == 0) 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.
for(int i = 0; i < 100; i++) {
B[i] = 1;
}
playRound(B, R);
for(int i = 0; i < 100; i++) {
B[i] = R[i];
}
playRound(B, R);
for(int i = 0; i < 100; i++) {
if(R[i] == 3) B[i] = 4;
else B[i] = 0;
}
playRound(B, R);
for(int i = 0; i < 100; i++) {
if(R[i] == 5) B[i] = 11;
else B[i] = 0;
}
playRound(B, R);
for(int i = 0; i < 100; i++) {
if(R[i] == 12) return i;
}
return 0;
}
int greaterValue(int N, int W, int X, int Y) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
int l = 0, r = 9;
while(l != r - 1) {
int mid = (l+r+1)/2;
B[X] = B[Y] = mid;
playRound(B, R);
for(int i = 0; i < 100; i++) B[i] = 0;
bool x = (R[X] > mid), y = (R[Y] > mid);
if(x && y) l = mid;
else if(!x && !y) r = mid;
else if(x) return 1;
else if(y) return 0;
}
return 0;
}
int greaterValue(int N, int W) {
return 1 - greaterValue(N, W, 0, 1);
}
struct {
bool operator()(int x, int y) const { return greaterValue(100, 100, x, y); }
} customLess;
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.
vector<int> nums(100);
for(int i = 0; i < 100; i++) {
nums[i] = i;
}
sort(nums.rbegin(), nums.rend(), customLess);
for(int i = 0; i < 100; i++) {
P[nums[i]] = i+1;
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 7 ms | 200 KB | Output is correct |
| 2 | Correct | 4 ms | 200 KB | Output is correct |
| 3 | Correct | 4 ms | 200 KB | Output is correct |
| 4 | Correct | 4 ms | 200 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 13 ms | 312 KB | Output is correct |
| 2 | Correct | 12 ms | 200 KB | Output is correct |
| 3 | Correct | 13 ms | 316 KB | Output is correct |
| 4 | Correct | 11 ms | 200 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 54 ms | 340 KB | Output is correct |
| 2 | Partially correct | 61 ms | 312 KB | Output is partially correct |
| 3 | Correct | 65 ms | 320 KB | Output is correct |
| 4 | Correct | 50 ms | 344 KB | Output is correct |
| 5 | Partially correct | 51 ms | 332 KB | Output is partially correct |
| 6 | Correct | 65 ms | 320 KB | Output is correct |
| 7 | Partially correct | 54 ms | 324 KB | Output is partially correct |
| 8 | Correct | 54 ms | 312 KB | Output is correct |
| 9 | Correct | 59 ms | 324 KB | Output is correct |
| 10 | Correct | 63 ms | 316 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 200 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Partially correct | 37 ms | 284 KB | Output is partially correct |
| 2 | Partially correct | 35 ms | 200 KB | Output is partially correct |
| 3 | Partially correct | 52 ms | 284 KB | Output is partially correct |
| 4 | Partially correct | 51 ms | 200 KB | Output is partially correct |
| 5 | Partially correct | 38 ms | 200 KB | Output is partially correct |
| 6 | Partially correct | 35 ms | 200 KB | Output is partially correct |
| 7 | Partially correct | 42 ms | 200 KB | Output is partially correct |
| 8 | Partially correct | 37 ms | 284 KB | Output is partially correct |
| 9 | Partially correct | 33 ms | 200 KB | Output is partially correct |
| 10 | Partially correct | 36 ms | 284 KB | Output is partially correct |
| 11 | Partially correct | 34 ms | 292 KB | Output is partially correct |
| 12 | Partially correct | 28 ms | 204 KB | Output is partially correct |
| 13 | Partially correct | 43 ms | 308 KB | Output is partially correct |
| 14 | Partially correct | 35 ms | 200 KB | Output is partially correct |
| 15 | Partially correct | 34 ms | 200 KB | Output is partially correct |
| 16 | Partially correct | 35 ms | 200 KB | Output is partially correct |
| 17 | Partially correct | 32 ms | 200 KB | Output is partially correct |
| 18 | Partially correct | 35 ms | 200 KB | Output is partially correct |
| 19 | Partially correct | 37 ms | 200 KB | Output is partially correct |
| 20 | Partially correct | 39 ms | 292 KB | Output is partially correct |
| 21 | Partially correct | 38 ms | 288 KB | Output is partially correct |
| 22 | Partially correct | 37 ms | 200 KB | Output is partially correct |
| 23 | Partially correct | 30 ms | 308 KB | Output is partially correct |
| 24 | Partially correct | 47 ms | 200 KB | Output is partially correct |
| 25 | Partially correct | 43 ms | 296 KB | Output is partially correct |
| 26 | Partially correct | 40 ms | 200 KB | Output is partially correct |
| 27 | Partially correct | 34 ms | 200 KB | Output is partially correct |
| 28 | Partially correct | 40 ms | 308 KB | Output is partially correct |
| 29 | Partially correct | 35 ms | 200 KB | Output is partially correct |
| 30 | Partially correct | 36 ms | 200 KB | Output is partially correct |
| 31 | Partially correct | 32 ms | 200 KB | Output is partially correct |
| 32 | Partially correct | 32 ms | 200 KB | Output is partially correct |
| 33 | Partially correct | 32 ms | 200 KB | Output is partially correct |
| 34 | Partially correct | 33 ms | 284 KB | Output is partially correct |
| 35 | Partially correct | 35 ms | 200 KB | Output is partially correct |
| 36 | Partially correct | 36 ms | 200 KB | Output is partially correct |
| 37 | Partially correct | 36 ms | 200 KB | Output is partially correct |
| 38 | Partially correct | 31 ms | 200 KB | Output is partially correct |
| 39 | Partially correct | 41 ms | 200 KB | Output is partially correct |
| 40 | Partially correct | 32 ms | 308 KB | Output is partially correct |