oj.uz

Submission #406437

# Submission time Handle Problem Language Result Execution time Memory
406437 2021-05-17T15:18:09 Z aryan12 Koala Game (APIO17_koala) C++17
19 / 100
 15 ms 308 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];
    a[0] = 1;
    b[0] = 0;
    for(int i = 1; i < N; i++) {
        a[i] = 0;
        b[i] = 0;
    }
    playRound(a, b);
    /*for(int i = 0; i < N; i++) {
        cout << b[i] << " ";
    }
    cout << endl;*/
    if(b[0] < 2)
        return 0;
    for(int i = 1; i < N; i++) {
        if(b[i] == 0) {
            return i;
        }
    }
    return 0;
}

int maxValue(int N, int W) {
    int values[4] = {1, 2, 4, 11};
    bool ok[N];
    for(int i = 0; i < N; i++) {
        ok[i] = true;
    }
    int a[N], b[N];
    for(int temp = 0; temp < 4; temp++) {
        for(int i = 0; i < N; i++) {
            if(ok[i]) {
                a[i] = values[temp];
            }
            else {
                a[i] = 0;
            }
        }
        playRound(a, b);
        for(int i = 0; i < N; i++) {
            if(b[i] <= a[i]) {
                ok[i] = false;
            }
        }
        int cnt = 0, idx = 0;
        for(int i = 0; i < N; i++) {
            if(ok[i]) {
                cnt++;
                idx = i;
            }
        }
        if(cnt == 1)
            return idx;
    }
    for(int i = 0; i < N; i++) {
        if(ok[i])
            return i;
    }
    // TODO: Implement Subtask 2 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 {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 200 KB Output is correct
2 Correct 15 ms 304 KB Output is correct
3 Correct 15 ms 308 KB Output is correct
4 Correct 14 ms 200 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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