oj.uz

Submission #969488

# Submission time Handle Problem Language Result Execution time Memory
969488 2024-04-25T08:33:45 Z socpite Koala Game (APIO17_koala) C++17
15 / 100
 45 ms 604 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;

int B[105], R[105];

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 maxValue(int N, int W) {
    vector<int> vec = {1, 2, 4, 11};
    vector<int> good(N);
    iota(good.begin(), good.end(), 0);
    for(auto v: vec){
        fill(B, B + N, 0);
        for(auto id: good)B[id] = v;
        playRound(B, R);
        good.clear();
        for(int i = 0; i < N; i++)if(R[i] > v)good.push_back(i);
    }
    return good.back();
}

int greaterValue(int N, int W) {
    B[0] = B[1] = 3;
    playRound(B, R);
    if (R[0] > 3 and R[1] <= 3) return 0;
    if (R[1] > 3 and R[0] <= 3) return 1;
    B[0] = B[1] = 6;
    playRound(B, R);
    if (R[0] > 6 and R[1] <= 6) return 0;
    if (R[1] > 6 and R[0] <= 6) return 1;
    B[0] = B[1] = 9;
    playRound(B, R);
    if (R[0] > 9 and R[1] <= 9) return 0;
    if (R[1] > 9 and R[0] <= 9) return 1;
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;

    // k p0 <= sum (k+1)so dau tien < p1
}

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.
    }
}

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 348 KB Output is correct
2 Correct 15 ms 344 KB Output is correct
3 Correct 10 ms 348 KB Output is correct
4 Correct 10 ms 456 KB Output is correct

Subtask #3
0 / 18.0

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