oj.uz

Submission #75830

# Submission time Handle Problem Language Result Execution time Memory
75830 2018-09-11T08:52:55 Z faustaadp Koala Game (APIO17_koala) C++17
100 / 100
 69 ms 832 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;
}
bool gol (ll aa,ll bb,ll cc,ll dd)
{
    if((cc-bb)>dd)
        return 1;
    while(1)
    {
        if(cc<=dd)return 0;
        ll ii,H=0;
        for(ii=bb;ii>=bb-dd;ii--)
            H+=max(ii,0LL);
        if(H<aa)return 1;
        bb-=(dd+1);
        cc-=(dd+1);
    }

}
ll mc[110];
vector<ll> VC[110];
bool cmp(ll aa,ll bb)
{
    return (VC[aa]>VC[bb]);
}
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;
        vector<ll> v2;
        for(j=N-1;j>=0;j--)
        {
            int TTT=0;
            vector<ll> v;
            for(i=0;i<N;i++)
                if(!sud[i])
                    v.pb(i);
            sort(v.begin(),v.end(),cmp);
            VS=v.size();
            while(VS>=1)
            {
                if(VC[v[VS-1]]!=VC[v[0]])
                {
             //       cout<<"AA";
                    VS--;
                    v.pop_back();
                }
                else
                    break;
            }
            K=1;
            v2.clear();
            memset(mc,0,sizeof(mc));
            while(VS>1)
            {
                vector<ll> vv;
                for(i=0;i<N;i++)
                    a[i]=0;
                K=1;
                for(i=(W/VS);i>=0;i--)
                    if(gol(j+1,j+1-VS,(W-(N-(j+1))),i))
                    {
                        K=i;
                        break;
                    }
                for(i=0;i<VS;i++)
                    a[v[i]]=K;
                TTT++;
                playRound(a,b);
                for(i=0;i<N;i++)
                    if(b[i]>K&&a[i]==K)
                    {
                        vv.pb(i);
                        mc[i]=TTT;
                    }
                v=vv;
                VS=v.size();
            }
            for(i=0;i<N;i++)
                VC[i].pb(mc[i]);
            //cout<<j<<" "<<TTT<<"\n";
            sud[v[0]]=1;
            P[v[0]]=j+1;
        }
       // cout<<TTT<<"\n";
    }
}

Compilation message

koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:128:14: warning: unused variable 'TTT' [-Wunused-variable]
         ll j,TTT=0;
              ^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 7 ms 464 KB Output is correct
3 Correct 7 ms 468 KB Output is correct
4 Correct 6 ms 468 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 504 KB Output is correct
2 Correct 19 ms 504 KB Output is correct
3 Correct 18 ms 524 KB Output is correct
4 Correct 18 ms 524 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 744 KB Output is correct
2 Correct 63 ms 744 KB Output is correct
3 Correct 54 ms 744 KB Output is correct
4 Correct 55 ms 744 KB Output is correct
5 Correct 68 ms 744 KB Output is correct
6 Correct 53 ms 744 KB Output is correct
7 Correct 52 ms 744 KB Output is correct
8 Correct 53 ms 812 KB Output is correct
9 Correct 54 ms 812 KB Output is correct
10 Correct 57 ms 812 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 812 KB Output is correct
2 Correct 41 ms 812 KB Output is correct
3 Correct 43 ms 828 KB Output is correct
4 Correct 42 ms 828 KB Output is correct
5 Correct 69 ms 828 KB Output is correct
6 Correct 51 ms 828 KB Output is correct
7 Correct 43 ms 828 KB Output is correct
8 Correct 42 ms 828 KB Output is correct
9 Correct 53 ms 828 KB Output is correct
10 Correct 44 ms 828 KB Output is correct
11 Correct 41 ms 828 KB Output is correct
12 Correct 42 ms 828 KB Output is correct
13 Correct 40 ms 828 KB Output is correct
14 Correct 41 ms 828 KB Output is correct
15 Correct 46 ms 828 KB Output is correct
16 Correct 43 ms 828 KB Output is correct
17 Correct 41 ms 828 KB Output is correct
18 Correct 47 ms 828 KB Output is correct
19 Correct 45 ms 832 KB Output is correct
20 Correct 67 ms 832 KB Output is correct

Subtask #5
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 832 KB Output is correct
2 Correct 7 ms 832 KB Output is correct
3 Correct 7 ms 832 KB Output is correct
4 Correct 7 ms 832 KB Output is correct
5 Correct 8 ms 832 KB Output is correct
6 Correct 7 ms 832 KB Output is correct
7 Correct 7 ms 832 KB Output is correct
8 Correct 7 ms 832 KB Output is correct
9 Correct 7 ms 832 KB Output is correct
10 Correct 7 ms 832 KB Output is correct
11 Correct 7 ms 832 KB Output is correct
12 Correct 7 ms 832 KB Output is correct
13 Correct 7 ms 832 KB Output is correct
14 Correct 7 ms 832 KB Output is correct
15 Correct 8 ms 832 KB Output is correct
16 Correct 7 ms 832 KB Output is correct
17 Correct 7 ms 832 KB Output is correct
18 Correct 7 ms 832 KB Output is correct
19 Correct 7 ms 832 KB Output is correct
20 Correct 7 ms 832 KB Output is correct
21 Correct 7 ms 832 KB Output is correct
22 Correct 7 ms 832 KB Output is correct
23 Correct 7 ms 832 KB Output is correct
24 Correct 7 ms 832 KB Output is correct
25 Correct 7 ms 832 KB Output is correct
26 Correct 7 ms 832 KB Output is correct
27 Correct 7 ms 832 KB Output is correct
28 Correct 7 ms 832 KB Output is correct
29 Correct 8 ms 832 KB Output is correct
30 Correct 7 ms 832 KB Output is correct
31 Correct 7 ms 832 KB Output is correct
32 Correct 8 ms 832 KB Output is correct
33 Correct 7 ms 832 KB Output is correct
34 Correct 7 ms 832 KB Output is correct
35 Correct 8 ms 832 KB Output is correct
36 Correct 8 ms 832 KB Output is correct
37 Correct 7 ms 832 KB Output is correct
38 Correct 7 ms 832 KB Output is correct
39 Correct 7 ms 832 KB Output is correct
40 Correct 7 ms 832 KB Output is correct