oj.uz

Submission #735180

# Submission time Handle Problem Language Result Execution time Memory
735180 2023-05-03T16:39:11 Z bin9638 Koala Game (APIO17_koala) C++17
18 / 100
 77 ms 448 KB 
#include<bits/stdc++.h>

#ifndef SKY
#include "koala.h"
#endif // SKY

using namespace std;

#ifdef SKY
void playRound(int *B, int *R)
{
}
#endif // SKY

int n,w;

int minValue(int NNN, int WWW)
{
    n=NNN;
    w=WWW;
    vector<int>B(n,0),R(n,0);
    B[0]=1;
    playRound(&B[0],&R[0]);
    if(R[0]<=1)
        return 0;
    for(int i=1;i<n;i++)
        if(R[i]==0)
            return i;
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int NNN, int WWW) {
    n=NNN;
    w=WWW;
    int l=1,r=8;
    while(l<=r)
    {
        int mid=(l+r)/2;
        vector<int>B(n,0),R(n,0);
        B[0]=B[1]=mid;
        playRound(&B[0],&R[0]);
        if(R[0]>mid&&R[1]>mid)
        {
            l=mid+1;
            continue;
        }
        if(R[0]>mid)
            return 0;
        if(R[1]>mid)
            return 1;
        r=mid-1;
    }
    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.
    }
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);

    return 0;
}
#endif

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:21:21: warning: control reaches end of non-void function [-Wreturn-type]
   21 |     vector<int>B(n,0),R(n,0);
      |                     ^

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 67 ms 328 KB Output is partially correct
2 Partially correct 73 ms 448 KB Output is partially correct
3 Partially correct 62 ms 320 KB Output is partially correct
4 Partially correct 61 ms 324 KB Output is partially correct
5 Partially correct 64 ms 328 KB Output is partially correct
6 Partially correct 64 ms 312 KB Output is partially correct
7 Partially correct 71 ms 324 KB Output is partially correct
8 Partially correct 77 ms 328 KB Output is partially correct
9 Partially correct 66 ms 324 KB Output is partially correct
10 Partially correct 59 ms 316 KB Output is partially correct

Subtask #4
0 / 10.0

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