oj.uz

Submission #408623

# Submission time Handle Problem Language Result Execution time Memory
408623 2021-05-19T09:52:49 Z benedict0724 Koala Game (APIO17_koala) C++17
100 / 100
 68 ms 432 KB 
#include "koala.h"
#include <assert.h>
#include <vector>

int brue = 79, B[100], R[100], U[100], E[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 dnc(int l, int r, std::vector<int> v, int *P, int N)
{
    if(l == r)
    {
        P[v[0]] = l;
        return;
    }
    std::vector<int> small, big;
    int siz = r - l + 1, val;
    for(int k=1;k<=N/siz;k++)
    {
        int tmp = (k * siz) * (k*siz + 1) / 2;
        tmp -= (k * (siz - 1)) * (k * (siz - 1) + 1) / 2;
        if(tmp <= l) continue;

        val = k; break;
    }

    initialize(N);
    for(int i : v) B[i] = val;
    playRound(B, R);
    for(int i : v)
    {
        if(R[i] == 0) small.push_back(i);
        else big.push_back(i);
    }

    assert(small.size() > 0 && big.size() > 0);
    int a = small.size();
    dnc(l, l+a-1,small,P,N);
    dnc(l+a, r, big, P,N);
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        for(int i=0;i<N;i++) E[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, E[mid], N) == i) l = mid + 1;
                else r = mid;
            }
            for(int j=N-1;j>l;j--) E[j] = E[j-1];
            E[l] = i;
        }
        for(int i=0;i<N;i++)
        {
            P[E[i]] = i+1;
        }
    } else {
        std::vector<int> v;
        for(int i=0;i<N;i++) v.push_back(i);
        dnc(1, N, v, P, N);
    }
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
   68 | }
      | ^
koala.cpp: In function 'void dnc(int, int, std::vector<int>, int*, int)':
koala.cpp:98:25: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
   98 |     for(int i : v) B[i] = val;
      |                    ~~~~~^~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 200 KB Output is correct
2 Correct 5 ms 200 KB Output is correct
3 Correct 6 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 17 ms 200 KB Output is correct
2 Correct 15 ms 200 KB Output is correct
3 Correct 15 ms 296 KB Output is correct
4 Correct 15 ms 304 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 432 KB Output is correct
2 Correct 63 ms 288 KB Output is correct
3 Correct 68 ms 304 KB Output is correct
4 Correct 56 ms 200 KB Output is correct
5 Correct 58 ms 312 KB Output is correct
6 Correct 59 ms 312 KB Output is correct
7 Correct 59 ms 200 KB Output is correct
8 Correct 60 ms 308 KB Output is correct
9 Correct 58 ms 292 KB Output is correct
10 Correct 57 ms 324 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 272 KB Output is correct
2 Correct 34 ms 200 KB Output is correct
3 Correct 34 ms 200 KB Output is correct
4 Correct 34 ms 200 KB Output is correct
5 Correct 35 ms 280 KB Output is correct
6 Correct 34 ms 200 KB Output is correct
7 Correct 34 ms 292 KB Output is correct
8 Correct 34 ms 200 KB Output is correct
9 Correct 34 ms 200 KB Output is correct
10 Correct 34 ms 200 KB Output is correct
11 Correct 34 ms 200 KB Output is correct
12 Correct 36 ms 200 KB Output is correct
13 Correct 34 ms 288 KB Output is correct
14 Correct 35 ms 200 KB Output is correct
15 Correct 33 ms 200 KB Output is correct
16 Correct 33 ms 200 KB Output is correct
17 Correct 34 ms 200 KB Output is correct
18 Correct 35 ms 200 KB Output is correct
19 Correct 34 ms 200 KB Output is correct
20 Correct 34 ms 200 KB Output is correct

Subtask #5
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 200 KB Output is correct
2 Correct 4 ms 200 KB Output is correct
3 Correct 4 ms 200 KB Output is correct
4 Correct 4 ms 200 KB Output is correct
5 Correct 4 ms 300 KB Output is correct
6 Correct 4 ms 200 KB Output is correct
7 Correct 4 ms 200 KB Output is correct
8 Correct 4 ms 200 KB Output is correct
9 Correct 4 ms 200 KB Output is correct
10 Correct 4 ms 200 KB Output is correct
11 Correct 4 ms 200 KB Output is correct
12 Correct 5 ms 320 KB Output is correct
13 Correct 4 ms 200 KB Output is correct
14 Correct 4 ms 304 KB Output is correct
15 Correct 4 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 4 ms 200 KB Output is correct
18 Correct 4 ms 200 KB Output is correct
19 Correct 4 ms 200 KB Output is correct
20 Correct 4 ms 200 KB Output is correct
21 Correct 4 ms 200 KB Output is correct
22 Correct 4 ms 200 KB Output is correct
23 Correct 4 ms 200 KB Output is correct
24 Correct 4 ms 200 KB Output is correct
25 Correct 4 ms 200 KB Output is correct
26 Correct 4 ms 200 KB Output is correct
27 Correct 4 ms 200 KB Output is correct
28 Correct 4 ms 200 KB Output is correct
29 Correct 4 ms 200 KB Output is correct
30 Correct 4 ms 200 KB Output is correct
31 Correct 4 ms 200 KB Output is correct
32 Correct 4 ms 200 KB Output is correct
33 Correct 4 ms 200 KB Output is correct
34 Correct 4 ms 200 KB Output is correct
35 Correct 4 ms 200 KB Output is correct
36 Correct 4 ms 200 KB Output is correct
37 Correct 4 ms 200 KB Output is correct
38 Correct 4 ms 200 KB Output is correct
39 Correct 4 ms 200 KB Output is correct
40 Correct 4 ms 200 KB Output is correct