oj.uz

Submission #953144

# Submission time Handle Problem Language Result Execution time Memory
953144 2024-03-25T14:42:10 Z Itamar Koala Game (APIO17_koala) C++14
15 / 100
 32 ms 436 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*((N+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) {
    // 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) {
        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;
        }
    }
    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
0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 32 ms 344 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 344 KB Output isn't correct
2 Halted 0 ms 0 KB -