oj.uz

Submission #736518

# Submission time Handle Problem Language Result Execution time Memory
736518 2023-05-05T21:00:33 Z vjudge1 Koala Game (APIO17_koala) C++11
33 / 100
 46 ms 336 KB 
#include "koala.h"

#include <bits/stdc++.h>
using namespace std;

int minValue(int N, int W) {
        // TODO: Implement Subtask 1 solution here.
        // You may leave this function unmodified if you are not attempting this
        // subtask.
        int A[N], B[N];
        for (int i = 0; i < N; i++) A[i] = i == 0;
        playRound(A, B);
        for (int i = 0; i < N; i++) {
                if (B[i] <= A[i]) return i;
        }
        return -1;
}

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.
        vector<int> candidates(N);
        iota(candidates.begin(), candidates.end(), 0);
        while (candidates.size() != 1) {
                int cnt = W / candidates.size();
                int A[N], B[N];
                for (int i = 0; i < N; i++) A[i] = 0;
                for (int i : candidates) A[i] = cnt;
                playRound(A, B);
                vector<int> nc;
                for (int i : candidates) {
                        if (B[i] > A[i]) nc.emplace_back(i);
                }
                candidates = nc;
        }
        return candidates[0];
}

int greaterValue(int N, int W) {
        int l = 0, r = 13;
        int A[N], B[N];
        for (int i = 0; i < N; i++) A[i] = 0;
        while (l <= r) {
                int mid = l + r >> 1;
                A[0] = A[1] = mid;
                playRound(A, B);
                if (B[0] > A[0] && B[1] > A[1]) {
                        l = mid + 1;
                } else if (B[0] <= A[0] && B[1] <= A[1]) {
                        r = mid - 1;
                } else {
                        return B[1] > A[1];
                }
        }
        // TODO: Implement Subtask 3 solution here.
        // You may leave this function unmodified if you are not attempting this
        // subtask.
        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.
        }
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:45:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |                 int mid = l + r >> 1;
      |                           ~~^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 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
15.0 / 15.0

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

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 328 KB Output is correct
2 Partially correct 46 ms 320 KB Output is partially correct
3 Correct 40 ms 320 KB Output is correct
4 Correct 44 ms 336 KB Output is correct
5 Partially correct 44 ms 336 KB Output is partially correct
6 Correct 39 ms 324 KB Output is correct
7 Partially correct 39 ms 324 KB Output is partially correct
8 Correct 45 ms 324 KB Output is correct
9 Correct 44 ms 336 KB Output is correct
10 Correct 40 ms 332 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 -