oj.uz

Submission #775080

# Submission time Handle Problem Language Result Execution time Memory
775080 2023-07-06T07:27:16 Z arayi Koala Game (APIO17_koala) C++17
19 / 100
 12 ms 320 KB 
#include "koala.h"

#include <bits/stdc++.h>
using namespace std;
#define ad push_back

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 *b = new int[n];
    int *r = new int[n];
    for (int i = 0; i < n; i++) {
        b[i] = 0;
    }
    b[0] = 1;
    playRound(b, r);
    int ans = 0;
    if (r[0] <= 1)
        ans = 0;
    else {
        for (int i = 0; i < n; i++) {
            if (r[i] == 0) {
                ans = i;
                break;
            }
        }
    }
    delete b;
    delete r;
    return ans;
}

int maxValue(int n, int w) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int *b = new int[n];
    int *r = new int[n];
    vector<int> fp;
    int ans;
    for (int i = 0; i < n; i++)
        fp.ad(i);
    for (int i : {2, 3, 5}) {
        for (int j = 0; j < n; j++)
            b[j] = 0;
        for (auto p : fp)
            b[p] = n / (int)fp.size();
        playRound(b, r);
        fp.clear();
        for (int j = 0; j < n; j++)
            if (r[j] == i) fp.ad(j);
    }
    for (int j = 0; j < n; j++)
        b[j] = 0;
    for (auto p : fp)
        b[p] = 11;
    playRound(b, r);
    for (auto p : fp) {
        if (r[p] > 11) ans = p;
    }
    delete b;
    delete r;
    return ans;
}

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

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:64:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |     return ans;
      |            ^~~

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 312 KB Output is correct
2 Correct 10 ms 320 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 12 ms 316 KB Output is correct

Subtask #3
0 / 18.0

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