oj.uz

Submission #173053

# Submission time Handle Problem Language Result Execution time Memory
173053 2020-01-03T09:08:51 Z arnold518 Koala Game (APIO17_koala) C++14
19 / 100
 17 ms 376 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 100;

int N, W, P[MAXN+10];
int B[MAXN+10], R[MAXN+10];

int minValue(int _N, int _W)
{
    N=_N; W=_W;
    int i, j;
    memset(B, 0, sizeof(B));
    B[0]++;
    playRound(B, R);

    if(R[0]==2) for(i=0; i<N; i++) if(R[i]==0) return i;
    return 0;
}

int maxValue(int _N, int _W)
{
    N=_N; W=_W;
    int i, j;

    vector<int> V, V2;

    for(i=0; i<N; i++) V.push_back(i);

    while(V.size()>1)
    {
        //for(auto it : V) printf("%d ", it); printf("\n");

        memset(B, 0, sizeof(B));
        for(auto it : V) B[it]=N/V.size();
        playRound(B, R); for(i=0; i<N; i++) R[i]=R[i]>B[i];

        V2.clear();
        for(i=0; i<N; i++) if(R[i] && binary_search(V.begin(), V.end(), i)) V2.push_back(i);
        V=V2;
    }
    return V[0];
}

int greaterValue(int _N, int _W)
{
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

void allValues(int _N, int _W, int *_P)
{
    if(W==2*N)
    {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
    else
    {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:17:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:29:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 376 KB Output is correct
2 Correct 17 ms 376 KB Output is correct
3 Correct 17 ms 376 KB Output is correct
4 Correct 17 ms 376 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 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 256 KB Output isn't correct
2 Halted 0 ms 0 KB -