# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984269 | Unforgettablepl | Koala Game (APIO17_koala) | C++17 | 40 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
void playRound(int *B, int *R);
int minValue(int N, int W) {
int arr[100];fill(arr,arr+100,0);
int res[100];fill(res,res+100,0);
arr[0] = 1;
playRound(arr,res);
for(int i=0;i<N;i++)if(res[i]<=arr[i])return i;
}
int maxValue(int N, int W) {
vector<int> poss(N);iota(poss.begin(), poss.end(),0);
while(poss.size()>1){
int arr[100];fill(arr,arr+100,0);
int res[100];fill(res,res+100,0);
int distrib = W/poss.size();
for(int&i:poss)arr[i]=distrib;
playRound(arr,res);
poss.clear();
for(int i=0;i<N;i++)if(arr[i] and res[i]>arr[i])poss.emplace_back(i);
}
return poss[0];
}
bool lessth(int a,int b,bool second_way=false){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |