| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1282836 | dosts | Koala Game (APIO17_koala) | C++20 | 1 ms | 332 KiB |
#include "koala.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
int minValue(int N, int W) {
int B[N],R[N];
B[0] = 1;
for (int j = 1;j<N;j++) B[j] = 0;
playRound(B,R);
for (int j = 1;j<N;j++) {
if (!R[j]) return j+1;
}
B[1] = 1;
B[0] = 0;
playRound(B,R);
if (!R[0]) return 1;
for (int j = 1;j<N;j++) {
if (!R[j]) return j+1;
}
return -1;
}
int maxValue(int N, int W) {
}
int greaterValue(int N, int W) {
}
void allValues(int N, int W, int *P) {
}
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... | ||||
