| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1179108 | Ahmed_Kaaniche | 코알라 (APIO17_koala) | C++20 | 3 ms | 412 KiB |
#include <bits/stdc++.h>
#include "koala.h"
using namespace std;
#define endl "\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
int b[100], r[100];
int minValue(int n, int w) {
memset(b, 0, sizeof(b));
b[0] = 1;
playRound(b, r);
if (r[0] <= 1)
return 0;
else {
for (int i = 0; i < n; ++i) {
if (r[i] == 0)
return i;
}
}
}
int maxValue(int n, int w) {
return 0;
}
int greaterValue(int n, int w) {
memset(b, 0, sizeof(b));
b[0] = 1, b[1] = 1;
playRound(b, r);
if (r[0] == 0)
return 1;
else
return 0;
}
void allValues(int n, int w, int *p) {
return;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
