| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 75816 | 2018-09-11T07:55:56 Z | faustaadp | Koala Game (APIO17_koala) | C++17 | 63 ms | 944 KB |
#include "koala.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll i;
int minValue(int N, int W) {
int a[110],b[110];
for(i=0;i<N;i++)
a[i]=0;
a[0]=1;
playRound(a,b);
for(i=0;i<N;i++)
if(b[i]==0)
return i;
return 0;
}
int maxValue(int N, int W) {
ll VS,K;
int a[110],b[110];
vector<ll> v;
for(i=0;i<N;i++)
v.pb(i);
VS=N;
K=1;
while(VS>1)
{
vector<ll> vv;
for(i=0;i<N;i++)
a[i]=0;
K=W/VS;
for(i=0;i<VS;i++)
a[v[i]]=K;
playRound(a,b);
for(i=0;i<N;i++)
if(b[i]>K)
vv.pb(i);
v=vv;
VS=v.size();
}
return v[0];
}
ll L,R,C;
int greaterValue(int N, int W) {
int a[110],b[110];
for(i=0;i<N;i++)
a[i]=0;
L=1;
R=min(14,N/2);
while(L<=R)
{
C=(L+R)/2;
a[0]=C;
a[1]=C;
playRound(a,b);
//cout<<i<<" "<<b[0]<<" "<<b[1]<<"\n";
if(b[0]>b[1])return 0;
if(b[0]<b[1])return 1;
if(b[0]>C)L=C+1;
else R=C-1;
}
return 0;
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
ll VS,K;
int a[110],b[110],sud[110];
for(i=0;i<N;i++)
sud[i]=0;
ll j;
for(j=N-1;j>=0;j--)
{
vector<ll> v;
for(i=0;i<N;i++)
if(!sud[i])
v.pb(i);
VS=j+1;
K=2;
while(VS>1)
{
vector<ll> vv;
for(i=0;i<N;i++)
a[i]=0;
K=W/VS;
for(i=0;i<VS;i++)
a[v[i]]=K;
playRound(a,b);
for(i=0;i<N;i++)
if(b[i]>K&&a[i]==K)
vv.pb(i);
v=vv;
VS=v.size();
}
sud[v[0]]=1;
P[v[0]]=j+1;
}
} else {
ll VS,K;
int a[110],b[110],sud[110];
for(i=0;i<N;i++)
sud[i]=0;
ll j,TTT=0;
for(j=N-1;j>=0;j--)
{
vector<ll> v;
for(i=0;i<N;i++)
if(!sud[i])
v.pb(i);
VS=j+1;
K=1;
while(VS>1)
{
vector<ll> vv;
for(i=0;i<N;i++)
a[i]=0;
//K=1;
//K=(W-VS)/VS+1;
//K=min(K,W/VS);
for(i=0;i<VS;i++)
a[v[i]]=K;
//cout<<j<<" "<<VS<<" "<<K<<"\n";
if(W-(N-j-1)<=K)
{
K--;
continue;
}
playRound(a,b);
for(i=0;i<N;i++)
if(b[i]>K&&a[i]==K)
vv.pb(i);
if(vv.empty())
{
// cout<<j<<"\n";
TTT++;
K--;
continue;
}
K=N/VS;
//cout<<K<<"\n";
v=vv;
VS=v.size();
}
if(VS==0)
{
cout<<"ADUIUIDUSUSDUI\n\n\n\n\nASDJISDIH\n";
}
sud[v[0]]=1;
P[v[0]]=j+1;
}
// cout<<TTT<<"\n";
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 6 ms | 380 KB | Output is correct |
| 2 | Correct | 6 ms | 508 KB | Output is correct |
| 3 | Correct | 6 ms | 508 KB | Output is correct |
| 4 | Correct | 7 ms | 508 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 18 ms | 552 KB | Output is correct |
| 2 | Correct | 18 ms | 552 KB | Output is correct |
| 3 | Correct | 17 ms | 552 KB | Output is correct |
| 4 | Correct | 18 ms | 636 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 56 ms | 708 KB | Output is correct |
| 2 | Correct | 63 ms | 708 KB | Output is correct |
| 3 | Correct | 56 ms | 712 KB | Output is correct |
| 4 | Correct | 56 ms | 712 KB | Output is correct |
| 5 | Correct | 53 ms | 728 KB | Output is correct |
| 6 | Correct | 55 ms | 728 KB | Output is correct |
| 7 | Correct | 55 ms | 728 KB | Output is correct |
| 8 | Correct | 58 ms | 728 KB | Output is correct |
| 9 | Correct | 54 ms | 744 KB | Output is correct |
| 10 | Correct | 57 ms | 744 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 42 ms | 744 KB | Output is correct |
| 2 | Correct | 41 ms | 744 KB | Output is correct |
| 3 | Correct | 44 ms | 744 KB | Output is correct |
| 4 | Correct | 41 ms | 744 KB | Output is correct |
| 5 | Correct | 41 ms | 744 KB | Output is correct |
| 6 | Correct | 41 ms | 744 KB | Output is correct |
| 7 | Correct | 41 ms | 744 KB | Output is correct |
| 8 | Correct | 40 ms | 744 KB | Output is correct |
| 9 | Correct | 45 ms | 744 KB | Output is correct |
| 10 | Correct | 40 ms | 744 KB | Output is correct |
| 11 | Correct | 41 ms | 744 KB | Output is correct |
| 12 | Correct | 41 ms | 744 KB | Output is correct |
| 13 | Correct | 41 ms | 828 KB | Output is correct |
| 14 | Correct | 40 ms | 828 KB | Output is correct |
| 15 | Correct | 41 ms | 828 KB | Output is correct |
| 16 | Correct | 41 ms | 828 KB | Output is correct |
| 17 | Correct | 41 ms | 828 KB | Output is correct |
| 18 | Correct | 40 ms | 828 KB | Output is correct |
| 19 | Correct | 40 ms | 828 KB | Output is correct |
| 20 | Correct | 41 ms | 828 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Partially correct | 21 ms | 828 KB | Output is partially correct |
| 2 | Partially correct | 24 ms | 828 KB | Output is partially correct |
| 3 | Partially correct | 22 ms | 828 KB | Output is partially correct |
| 4 | Partially correct | 25 ms | 828 KB | Output is partially correct |
| 5 | Partially correct | 21 ms | 828 KB | Output is partially correct |
| 6 | Partially correct | 33 ms | 828 KB | Output is partially correct |
| 7 | Partially correct | 22 ms | 828 KB | Output is partially correct |
| 8 | Partially correct | 23 ms | 828 KB | Output is partially correct |
| 9 | Partially correct | 22 ms | 828 KB | Output is partially correct |
| 10 | Partially correct | 27 ms | 828 KB | Output is partially correct |
| 11 | Partially correct | 23 ms | 944 KB | Output is partially correct |
| 12 | Partially correct | 21 ms | 944 KB | Output is partially correct |
| 13 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 14 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 15 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 16 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 17 | Partially correct | 23 ms | 944 KB | Output is partially correct |
| 18 | Partially correct | 25 ms | 944 KB | Output is partially correct |
| 19 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 20 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 21 | Partially correct | 21 ms | 944 KB | Output is partially correct |
| 22 | Partially correct | 21 ms | 944 KB | Output is partially correct |
| 23 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 24 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 25 | Partially correct | 24 ms | 944 KB | Output is partially correct |
| 26 | Partially correct | 23 ms | 944 KB | Output is partially correct |
| 27 | Partially correct | 24 ms | 944 KB | Output is partially correct |
| 28 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 29 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 30 | Partially correct | 23 ms | 944 KB | Output is partially correct |
| 31 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 32 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 33 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 34 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 35 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 36 | Partially correct | 24 ms | 944 KB | Output is partially correct |
| 37 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 38 | Partially correct | 21 ms | 944 KB | Output is partially correct |
| 39 | Partially correct | 22 ms | 944 KB | Output is partially correct |
| 40 | Partially correct | 48 ms | 944 KB | Output is partially correct |