Submission #969495

#TimeUsernameProblemLanguageResultExecution timeMemory
969495socpiteKoala Game (APIO17_koala)C++14
15 / 100
96 ms464 KiB
#include "koala.h" #include<bits/stdc++.h> using namespace std; int B[105], R[105]; int minValue(int N, int W) { // TODO: Implement Subtask 1 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; } int maxValue(int N, int W) { vector<int> vec = {1, 2, 4, 11}; vector<int> good(N); iota(good.begin(), good.end(), 0); for(auto v: vec){ fill(B, B + N, 0); for(auto id: good)B[id] = v; playRound(B, R); good.clear(); for(int i = 0; i < N; i++)if(R[i] > v)good.push_back(i); } return good.back(); } int greaterValue(int N, int W) { for (int i = 2; i <= 16; ++i) { B[0] = B[1] = i; playRound(B, R); if (R[0] > i and R[1] <= i) return 0; if (R[1] > i and R[0] <= i) return 1; } // TODO: Implement Subtask 3 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; // k p0 <= sum (k+1)so dau tien < p1 } 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. } }
#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...