oj.uz

답안 #1116741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116741 2024-11-22T09:22:38 Z OI_Account 코알라 (APIO17_koala) C++17
4 / 100
 6 ms 384 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 100;

int n = 100;
int a[N + 10], b[N + 10];

int minValue(int N, int W) {
    for (int i = 0; i < n; i++)
        a[i] = 1;
    playRound(a, b);
    vector<int> vec;
    for (int i = 0; i < n; i++)
        if (b[i] == 2)
            vec.push_back(i);
    fill(a, a + n, 0);
    a[vec[0]] = 1;
    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.
    return 0;
}

int greaterValue(int N, int W) {
    for (int i = 2; i < n; i++) 
        a[i] = 0;
    a[0] = a[1] = 1;
    playRound(a, b);
    return b[1] == 2;
    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

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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