oj.uz

Submission #75794

# Submission time Handle Problem Language Result Execution time Memory
75794 2018-09-11T06:55:20 Z faustaadp Koala Game (APIO17_koala) C++17
29 / 100
 60 ms 1088 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;
}
vector<ll> v;

int maxValue(int N, int W) {
    ll VS,K;
    int a[110],b[110];
    v.clear();
    for(i=0;i<N;i++)
        v.pb(i);
    VS=N;
    K=1;
    int TTT=0;
    while(VS>1)
    {
        TTT++;
        vector<ll> vv;
        for(i=0;i<N;i++)
            a[i]=0;
        //K=N/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();
        K++;
        //break;
      //  cout<<VS<<"\n";
    }
    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) {

    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 500 KB Output is correct
3 Correct 8 ms 500 KB Output is correct
4 Correct 9 ms 532 KB Output is correct

Subtask #2
7.0 / 15.0

# Verdict Execution time Memory Grader output
1 Partially correct 31 ms 548 KB Output is partially correct
2 Partially correct 33 ms 788 KB Output is partially correct
3 Partially correct 31 ms 964 KB Output is partially correct
4 Partially correct 31 ms 964 KB Output is partially correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 964 KB Output is correct
2 Correct 60 ms 964 KB Output is correct
3 Correct 57 ms 964 KB Output is correct
4 Correct 53 ms 968 KB Output is correct
5 Correct 55 ms 980 KB Output is correct
6 Correct 53 ms 980 KB Output is correct
7 Correct 55 ms 1088 KB Output is correct
8 Correct 54 ms 1088 KB Output is correct
9 Correct 55 ms 1088 KB Output is correct
10 Correct 55 ms 1088 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1088 KB Output isn't correct
2 Halted 0 ms 0 KB -