oj.uz

Submission #716536

# Submission time Handle Problem Language Result Execution time Memory
716536 2023-03-30T09:20:34 Z tht2005 Koala Game (APIO17_koala) C++17
47 / 100
 61 ms 464 KB 
#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 102;

int B[N], R[N];

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

int maxValue(int N, int W) {
    vector<int> S(N);
    iota(S.begin(), S.end(), 0);
    while((int)S.size() > 1) {
        memset(B, 0, N * sizeof *B);
        for(int i : S) {
            B[i] = N / S.size();
        }
        playRound(B, R);
        vector<int> T;
        for(int i : S) {
            if(R[i] > B[i]) {
                T.push_back(i);
            }
        }
        S.swap(T);
    }
    return S[0];
}

int greaterValue(int N, int W) {
    memset(B, 0, N * sizeof *B);
    int l = 1, r = 9;
    while(l <= r) {
        int mid = (l + r) >> 1;
        B[0] = B[1] = mid;
        playRound(B, R);
        bool check = (R[0] > B[0]), check1 = (R[1] > B[1]);
        if(check != check1) {
            return check ? 0 : 1;
        }
        if(check) {
            l = mid + 1;
        }
        else {
            r = mid - 1;
        }
    }
}

bool compare(int i, int j) {
    memset(B, 0, sizeof(B));
    int l = 57, r = 60;
    while(l <= r) {
        int mid = (l + r) >> 1;
        B[i] = B[j] = mid;
        playRound(B, R);
        bool check = (R[i] > B[i]), check1 = (R[j] > B[j]);
        if(check != check1) {
            return !check;
        }
        if(check) {
            l = mid + 1;
        }
        else {
            r = mid - 1;
        }
    }
}

void solve(int l, int r, vector<int>& A) {
    if(l == r) {
        return;
    }
    int m = (l + r) >> 1;
    solve(l, m, A);
    solve(m + 1, r, A);
    vector<int> B(r + 1 - l);
    for(int i = l, j = l, k = m + 1; i <= r; ++i) {
        if(k > r || (j <= m && compare(A[j], A[k]))) {
            B[i - l] = A[j++];
        }
        else {
            B[i - l] = A[k++];
        }
    }
    for(int i = l; i <= r; ++i) {
        A[i] = B[i - l];
    }
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        vector<int> A(N);
        iota(A.begin(), A.end(), 0);
        solve(0, N - 1, A);
        for(int i = 0; i < N; ++i) {
            P[A[i]] = i + 1;
        }
    }
    else {

    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
   60 | }
      | ^
koala.cpp: In function 'bool compare(int, int)':
koala.cpp:80:1: warning: control reaches end of non-void function [-Wreturn-type]
   80 | }
      | ^

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 208 KB Output is correct
3 Correct 6 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 340 KB Output is correct
2 Correct 61 ms 452 KB Output is correct
3 Correct 50 ms 464 KB Output is correct
4 Correct 45 ms 328 KB Output is correct
5 Correct 45 ms 324 KB Output is correct
6 Correct 48 ms 324 KB Output is correct
7 Correct 45 ms 328 KB Output is correct
8 Correct 53 ms 464 KB Output is correct
9 Correct 49 ms 328 KB Output is correct
10 Correct 45 ms 328 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 208 KB Output is correct
2 Correct 28 ms 208 KB Output is correct
3 Correct 33 ms 300 KB Output is correct
4 Correct 35 ms 208 KB Output is correct
5 Correct 27 ms 208 KB Output is correct
6 Correct 31 ms 208 KB Output is correct
7 Correct 27 ms 208 KB Output is correct
8 Correct 27 ms 336 KB Output is correct
9 Correct 26 ms 296 KB Output is correct
10 Correct 26 ms 312 KB Output is correct
11 Correct 28 ms 208 KB Output is correct
12 Correct 16 ms 308 KB Output is correct
13 Correct 27 ms 208 KB Output is correct
14 Correct 26 ms 312 KB Output is correct
15 Correct 27 ms 208 KB Output is correct
16 Correct 24 ms 292 KB Output is correct
17 Correct 24 ms 208 KB Output is correct
18 Correct 25 ms 208 KB Output is correct
19 Correct 26 ms 292 KB Output is correct
20 Correct 31 ms 296 KB Output is correct

Subtask #5
0 / 53.0

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