oj.uz

Submission #408211

# Submission time Handle Problem Language Result Execution time Memory
408211 2021-05-19T06:20:54 Z benedict0724 Koala Game (APIO17_koala) C++17
47 / 100
 86 ms 420 KB 
#include "koala.h"
#include <assert.h>

int B[100], R[100], U[100], S[100];

void initialize(int N)
{
    for(int i=0;i<N;i++)
    {
        B[i] = 0;
        R[i] = 0;
    }
    return;
}
int minValue(int N, int W) {
    initialize(N);
    B[0] = 1;
    playRound(B, R);
    int ans = 0;
    for(int i=1;i<N;i++)
    {
        if(R[i] == 0) ans = i;
    }
    return ans;
}

int maxValue(int N, int W) {
    int cnt = N;
    for(int i=0;i<N;i++) U[i] = true;
    while(cnt > 1)
    {
        initialize(N);
        for(int i=0;i<N;i++)
        {
            if(U[i]) B[i] = N/cnt;
        }
        playRound(B, R);
        for(int i=0;i<N;i++)
        {
            if(R[i] <= B[i] && U[i])
            {
                U[i] = false;
                cnt--;
            }
        }
    }
    for(int i=0;i<N;i++) if(U[i]) return i;
}

int greaterValue(int N, int W) {
    int l = 1, r = 14;
    while(l <= r)
    {
        initialize(N);
        int mid = (2*l + r)/3;
        B[0] = B[1] = mid;
        playRound(B, R);

        if(R[0] != R[1])
        {
            return (R[0] == 0) ? 1 : 0;
        }

        if(R[0] == 0) r = mid-1;
        else l = mid+2;
    }
}

int compare(int i, int j, int N)
{
    initialize(N);
    B[i] = B[j] = N;
    playRound(B, R);
    if(R[i] == 0) return j;
    else return i;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        for(int i=0;i<N;i++) S[i] = 0;
        for(int i=1;i<N;i++)
        {
            int l = 0, r = i;
            while(l < r)
            {
                int mid = (l + r)/2;
                if(compare(i, S[mid], N) == i) l = mid + 1;
                else r = mid;
            }
            for(int j=N-1;j>l;j--) S[j] = S[j-1];
            S[l] = i;
        }
        for(int i=0;i<N;i++)
        {
            P[S[i]] = i+1;
        }
    } 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 maxValue(int, int)':
koala.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
   67 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 200 KB Output is correct
2 Correct 5 ms 200 KB Output is correct
3 Correct 5 ms 200 KB Output is correct
4 Correct 5 ms 200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 300 KB Output is correct
2 Correct 19 ms 360 KB Output is correct
3 Correct 15 ms 296 KB Output is correct
4 Correct 22 ms 200 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 304 KB Output is correct
2 Correct 86 ms 300 KB Output is correct
3 Correct 73 ms 308 KB Output is correct
4 Correct 73 ms 304 KB Output is correct
5 Correct 76 ms 328 KB Output is correct
6 Correct 78 ms 304 KB Output is correct
7 Correct 79 ms 300 KB Output is correct
8 Correct 82 ms 300 KB Output is correct
9 Correct 71 ms 312 KB Output is correct
10 Correct 60 ms 420 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 308 KB Output is correct
2 Correct 37 ms 200 KB Output is correct
3 Correct 38 ms 200 KB Output is correct
4 Correct 35 ms 268 KB Output is correct
5 Correct 35 ms 200 KB Output is correct
6 Correct 40 ms 200 KB Output is correct
7 Correct 40 ms 200 KB Output is correct
8 Correct 35 ms 200 KB Output is correct
9 Correct 35 ms 288 KB Output is correct
10 Correct 34 ms 268 KB Output is correct
11 Correct 33 ms 284 KB Output is correct
12 Correct 45 ms 268 KB Output is correct
13 Correct 34 ms 200 KB Output is correct
14 Correct 41 ms 200 KB Output is correct
15 Correct 35 ms 200 KB Output is correct
16 Correct 34 ms 200 KB Output is correct
17 Correct 37 ms 200 KB Output is correct
18 Correct 34 ms 268 KB Output is correct
19 Correct 33 ms 200 KB Output is correct
20 Correct 34 ms 336 KB Output is correct

Subtask #5
0 / 53.0

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