oj.uz

Submission #953110

# Submission time Handle Problem Language Result Execution time Memory
953110 2024-03-25T14:05:18 Z Itamar Koala Game (APIO17_koala) C++14
7 / 100
 19 ms 504 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;

        playRound(a, b); 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];
        for (int i = 0; i < 100; i++)if (can[i])a[i] = op.count() / can.count(); else a[i] = 0;

        can = can & buy(a, b);
    }
    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) {
        // 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 < 100; i++)op[i] = 1;
        for (int i = N; i > 0; i--) {
            int in = mmaxValue(100, 100, 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:35:1: warning: control reaches end of non-void function [-Wreturn-type]
   35 | }
      | ^

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
7.0 / 15.0

# Verdict Execution time Memory Grader output
1 Partially correct 19 ms 436 KB Output is partially correct
2 Partially correct 19 ms 344 KB Output is partially correct
3 Partially correct 19 ms 344 KB Output is partially correct
4 Partially correct 18 ms 344 KB Output is partially correct

Subtask #3
0 / 18.0

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

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -