oj.uz

Submission #334020

# Submission time Handle Problem Language Result Execution time Memory
334020 2020-12-08T06:15:31 Z mohamedsobhi777 Koala Game (APIO17_koala) C++14
4 / 100
 10 ms 492 KB 
#include "koala.h"
#include <bits/stdc++.h>
#define vi vector<int>
using namespace std;

int NN;

vector<int> play(vector<int> v)
{
    int *arr;
    int *arr2;
    arr = new int[NN];
    arr2 = new int[NN];
    for (int i = 0; i < NN; ++i)
    {
        arr[i] = v[i];
    }

    playRound(arr, arr2);
    vector<int> ret;
    for (int i = 0; i < NN; ++i)
    {
        ret.push_back(arr2[i]);
    }
    return ret;
}

int minValue(int N, int W)
{
    NN = N;
    vector<int> v(N, 0);
    v[0] = v[1] = 1;
    vi ret = play(v);
    if (v[0] && v[1])
    {
        for (int i = 0; i < N; ++i)
            v[i] = (!ret[i]);
        ret = play(v);
        for (int i = 0; i < N; ++i)
            if (!ret[i])
                return i;
    }
    else if (v[0])
        return 1;
    else
        return 0;
}

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

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:31:23: warning: control reaches end of non-void function [-Wreturn-type]
   31 |     vector<int> v(N, 0);
      |                       ^

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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