Submission #400678

#TimeUsernameProblemLanguageResultExecution timeMemory
400678my99nKoala Game (APIO17_koala)C++14
4 / 100
6 ms200 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int b[110], r[110]; int minValue(int N, int W) { memset(b, 0, sizeof b); memset(r, 0, sizeof r); 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) { // TODO: Implement Subtask 2 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; } int greaterValue(int N, int W) { memset(b, 0, sizeof b); memset(r, 0, sizeof r); 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; memset(b, 0, sizeof b); memset(r, 0, sizeof r); b[0] = 2, b[1] = 2; playRound(b, r); // cerr << "here"; for (int i = 0; i < N; i++) cerr << r[i] << ' '; cerr << endl; if (r[0] >= 3) return 0; if (r[1] >= 3) return 1; 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...