oj.uz

Submission #106913

# Submission time Handle Problem Language Result Execution time Memory
106913 2019-04-21T02:22:30 Z AngusRitossa Koala Game (APIO17_koala) C++14
9 / 100
 230 ms 968 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int b[500], r[500], n, w;
int minValue(int N, int W) 
{
    n = N, w = W;
    b[0] = 1;
    playRound(b, r);
    for (int i = 0; i < n; i++) if (b[i] >= r[i]) return i;
    return 0;
}

int maxValue(int N, int W) 
{
    n = N, w = W;
    return 0;
}

int greaterValue(int N, int W) 
{
    n = N, w = W;
    // TODO: Find optimal numbers
    for (int i = 1; 1; i++)
    {
        b[0] = b[1] = i;
        playRound(b, r);
        if (b[0] >= r[0] && b[1] < r[1]) return 1;
        if (b[0] < r[0] && b[1] >= r[1]) return 0;
    }
    return 0;
}

void allValues(int N, int W, int *P) {
    n = N, w = W;
    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 8 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
5.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 155 ms 384 KB Output is partially correct
2 Partially correct 230 ms 708 KB Output is partially correct
3 Partially correct 166 ms 732 KB Output is partially correct
4 Partially correct 202 ms 860 KB Output is partially correct
5 Partially correct 178 ms 632 KB Output is partially correct
6 Partially correct 174 ms 808 KB Output is partially correct
7 Partially correct 159 ms 968 KB Output is partially correct
8 Partially correct 226 ms 768 KB Output is partially correct
9 Partially correct 159 ms 760 KB Output is partially correct
10 Partially correct 143 ms 716 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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