# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118961 | Mahdi_Jfri | Land of the Rainbow Gold (APIO17_rainbow) | C++14 | 0 ms | 0 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 "koala.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 1e2 + 20;
int b[maxn] , r[maxn];
bool can[maxn];
int minValue(int n, int w)
{
memset(b , 0 , sizeof b);
b[0] = 1;
playRound(b , r);
if(r[0] != 2)
return 0;
for(int i = 1; i < n - 1; i++)
if(!r[i])
return i;
}
int maxValue(int n, int w)
{
for(int i = 0; i < n; i++)
can[i] = 1;
int rem = n;
while(rem > 1)
{
for(int i = 0; i < n; i++)
{
if(can[i])
b[i] = w / rem;
else
b[i] = 0;
}
playRound(b , r);
for(int i = 0; i < n; i++)
if(can[i] && r[i] <= b[i])
can[i] = 0 , rem--;
}
for(int i = 0; i < n; i++)
if(can[i])
return i;
}
int greaterValue(int N, int W)
{
return 0;
}
void allValues(int N, int W, int *P)
{
if (W == 2*N)
{
}
else
{
}
}