# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334030 | 2020-12-08T06:58:09 Z | mohamedsobhi777 | Koala Game (APIO17_koala) | C++14 | 26 ms | 876 KB |
#include "koala.h" #include <bits/stdc++.h> #define vi vector<int> using namespace std; int NN; vector<int> play(vector<int> v) { int *arr; int *arr2; arr = new int[NN]; arr2 = new int[NN]; for (int i = 0; i < NN; ++i) { arr[i] = v[i]; } playRound(arr, arr2); vector<int> ret; for (int i = 0; i < NN; ++i) { ret.push_back(arr2[i]); } return ret; } int minValue(int N, int W) { NN = N; vector<int> v(N, 0); v[0] = v[1] = 1; vi ret = play(v); if (v[0] && v[1]) { for (int i = 0; i < N; ++i) v[i] = (!ret[i]); ret = play(v); for (int i = 0; i < N; ++i) if (!ret[i]) return i; } else if (v[0]) return 1; else return 0; } int maxValue(int N, int W) { NN = N; vi v(N, 1); vi ret = play(v); ret = play(ret); ret = play(ret); ret = play(ret); /*for (int i = 0; i < N; ++i) cout << ret[i] << " "; cout << "\n";*/ for (int i = 0; i < N; ++i) if (ret[i] == 5) ret[i] = 9; else ret[i] = 0; ret = play(ret); for (int i = 0; i < N; ++i) if (ret[i] == 10) return i; for (auto u : ret) cout << u << " "; cout << "\n"; return 0; } int greaterValue(int N, int W) { srand(time(0)); NN = N; vector<int> v(N, 0); v[0] = v[1] = 1; vi ret = play(v); if (v[0] && v[1]) { return rand() % 2; } return v[1]; } 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. } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 492 KB | Output is correct |
2 | Correct | 10 ms | 492 KB | Output is correct |
3 | Correct | 10 ms | 492 KB | Output is correct |
4 | Correct | 10 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 23 ms | 748 KB | Output is partially correct |
2 | Partially correct | 23 ms | 748 KB | Output is partially correct |
3 | Partially correct | 25 ms | 876 KB | Output is partially correct |
4 | Partially correct | 26 ms | 748 KB | Output is partially correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |