oj.uz

답안 #249329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249329 2020-07-14T16:15:35 Z SamAnd 코알라 (APIO17_koala) C++17
24 / 100
 217 ms 4572 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
const int N = 102;

int n;

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.
    n = N;

    int* a;
    a = new int[n];
    for (int i = 0; i < n; ++i)
        a[i] = 0;

    a[0] = 1;

    int* b = new int[n];
    playRound(a, b);

    for (int i = 0; i < n; ++i)
    {
        if (b[i] == 0)
            return i;
    }
    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.
    n = N;

    vector<int> v;
    for (int i = 0; i < n; ++i)
        v.push_back(i);

    while (1)
    {
        if (sz(v) == 1)
            return v[0];

        int* a;
        a = new int[n];
        for (int i = 0; i < n; ++i)
            a[i] = 0;

        for (int i = 0; i < v.size(); ++i)
        {
            a[v[i]] = W / sz(v);
        }

        int* b;
        b = new int[n];
        playRound(a, b);

        vector<int> nv;
        for (int i = 0; i < v.size(); ++i)
        {
            if (b[v[i]] > a[v[i]])
                nv.push_back(v[i]);
        }
        v = nv;
    }
    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.
    n = N;

    for (int i = 1; ; ++i)
    {
        int* a;
        a = new int[n];
        for (int i = 0; i < n; ++i)
            a[i] = 0;
        a[0] = a[1] = i;

        int* b;
        b = new int[n];
        playRound(a, b);

        if (b[0] > a[0] && b[1] <= a[1])
            return 0;
        if (b[0] <= a[0] && b[1] > a[1])
            return 1;
    }
    return 0;
}

void allValues(int N, int W, int *P)
{
    n = N;
    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:59:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); ++i)
                         ~~^~~~~~~~~~
koala.cpp:69:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); ++i)
                         ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 640 KB Output is correct
2 Correct 17 ms 640 KB Output is correct
3 Correct 18 ms 640 KB Output is correct
4 Correct 17 ms 640 KB Output is correct

Subtask #3
5.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 206 ms 4312 KB Output is partially correct
2 Partially correct 217 ms 4572 KB Output is partially correct
3 Partially correct 205 ms 4312 KB Output is partially correct
4 Partially correct 205 ms 4184 KB Output is partially correct
5 Partially correct 207 ms 4312 KB Output is partially correct
6 Partially correct 207 ms 4312 KB Output is partially correct
7 Partially correct 204 ms 4188 KB Output is partially correct
8 Partially correct 203 ms 4312 KB Output is partially correct
9 Partially correct 205 ms 4184 KB Output is partially correct
10 Partially correct 201 ms 4192 KB Output is partially correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -