Submission #57389

#TimeUsernameProblemLanguageResultExecution timeMemory
57389MatheusLealV코알라 (APIO17_koala)C++17
4 / 100
8 ms596 KiB
#include "koala.h" #define maxn 105 #include <bits/stdc++.h> using namespace std; int minValue(int N, int W) { int v[N], R[N]; for(int i = 0; i < N; i++) v[i] = 0; v[0] = 1; playRound(v, R); for(int i = 0; i < N; i++) if(R[i] == 0) return i; return 0; } int maxValue(int N, int W) { return 0; } int greaterValue(int N, int W) { return 0; } void allValues(int N, int W, int *P) { if (W == 2*N) { } else { } }
#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...