oj.uz

Submission #978932

# Submission time Handle Problem Language Result Execution time Memory
978932 2024-05-10T03:45:05 Z Muhammad_Aneeq Koala Game (APIO17_koala) C++17
19 / 100
 12 ms 444 KB 
#include <vector>
#include "koala.h"
using namespace std;
int minValue(int N, int W) 
{
    int    r[N],b[N]={};
    for (int i=0;i<N;i++)
        b[i]=0;
    b[0]=1;
    playRound(b,r);
    for (int i=0;i<N;i++)
        if (r[i]==0)
            return i;
    return 0;
}

int maxValue(int N, int W) 
{
    vector<int>f;
    int b[N],r[N]={};
    for (int i=0;i<N;i++)
        b[i]=1;
    playRound(b,r);
    for (int i=0;i<N;i++)
    {
        b[i]=0;
        if (r[i]==2)
            f.push_back(i);
    }
    while (f.size())
    {
        b[f.back()]=2;
        f.pop_back();
    }
    playRound(b,r);
    for (int i=0;i<N;i++)
    {
        b[i]=0;
        if (r[i]==3)
            f.push_back(i);
    }
    while (f.size())
    {
        b[f.back()]=4;
        f.pop_back();
    }
    playRound(b,r);
    for (int i=0;i<N;i++)
    {
        b[i]=0;
        if (r[i]==5)
            f.push_back(i);
    }
    while (f.size())
    {
        b[f.back()]=11;
        f.pop_back();
    }
    playRound(b,r);
    for (int i=0;i<N;i++)
        if (r[i]==12)
            return i;
    return 0;
}

int greaterValue(int N, int W) {
    int st=0,en=51;
    int b[N],r[N]={};
    while (st+1<en)
    {
        int mid=(st+en)/2;
        b[0]=b[1]=mid;
        playRound(b,r);
        if (r[0]!=r[1])
        {
            if (r[0]>r[1])
                return 0;
            else
                return 1;
        }
        if (r[0]!=0)
            st=mid;
        else
            en=mid;
    }
    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.
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 340 KB Output is correct
4 Correct 12 ms 440 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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