oj.uz

Submission #953172

# Submission time Handle Problem Language Result Execution time Memory
953172 2024-03-25T15:19:43 Z Itamar Koala Game (APIO17_koala) C++14
55 / 100
 11 ms 600 KB 
#include "koala.h"
using namespace std;
#include <bitset>
#include <vector>

bitset<100> buy(int* a, int* b) {
    playRound(a, b);
    bitset<100> ans;
    for (int i = 0; i < 100; i++)if (b[i] > a[i])ans[i] = 1;
    return ans;
}

int maxValue(int N, int W) {
    bitset<100> can; for (int i = 0; i < N; i++)can[i] = 1;

    while (can.count() > 1) {
        int a[100], b[100];
        for (int i = 0; i < 100; i++)if (can[i])a[i] = 100 / can.count(); else a[i] = 0;

        can = can & buy(a, b);
    }
    for (int i = 0; i < N; i++)if (can[i])return i;
}

int mmaxValue(int N, int W, bitset<100> op) {
    bitset<100> can = op;

    while (can.count() > 1) {
        int a[100], b[100];
        int l = 0, r = 2 * (op.count() / can.count());
        while (l < r) {
            int mid = (l + r) / 2;
            for (int i = 0; i < 100; i++)if (can[i])a[i] = mid; else a[i] = 0;
            bitset<100> c = can & buy(a, b);
            if (c == can) {
                l = mid + 1;
            }
            else if (c.count() == 0) {
                r = mid - 1;
            }
            else {
                can = c;
                break;
            }
        }
    }
    for (int i = 0; i < N; i++)if (can[i])return i;
}




int minValue(int N, int W) {
    int a[100], b[100];
    for (int i = 0; i < N; i++)a[i] = 0;
    a[1] = 1;
    bitset<100> ans = buy(a, b);
    for (int i = 0; i < N; i++)if (ans[i] == 0)return i;
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int N, int W) {
    // 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 {
        bitset<100> op; for (int i = 0; i < N; i++)op[i] = 1;
        for (int i = N; i > 0; i--) {
            int in = mmaxValue(N, W, op);
            P[in] = i;
            op[in] = 0;
        }
    }
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^
koala.cpp: In function 'int mmaxValue(int, int, std::bitset<100>)':
koala.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 436 KB Output is correct
3 Correct 10 ms 436 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
36.0 / 53.0

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