# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111436 | 2019-05-15T11:17:48 Z | nxteru | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef double D; typedef pair<ll,ll> P; typedef pair<ll,P> T; #define M 1000000007 #define F first #define S second #define PB push_back #define INF 1000000001 int b[105],r[105]; int minValue(int n, int w) { for(int i=0;i<n;i++)b[i]=0; b[0]=1; playRound(b,r); for(int i=0;i<n;i++)if(b[i]>=r[i])return i; } int maxValue(int n,int w) { vector<int>res; for(int i=0;i<n;i++)res.PB(i); while(res.size()>1){ for(int i=0;i<n;i++)b[i]=0; for(int i=0;i<res.size();i++)b[res[i]]=w/res.size(); playRound(b,r); res.clear(); for(int i=0;i<n;i++)if(b[i]>0&&b[i]<r[i])res.PB(i): } return res[0]; } int greaterValue(int N, int W) { // TODO: Implement Subtask 3 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; } 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. } }