oj.uz

답안 #254443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254443 2020-07-30T02:10:54 Z 79brue 코알라 (APIO17_koala) C++14
4 / 100
 10 ms 384 KB 
#include <bits/stdc++.h>
#include "koala.h"

using namespace std;

int minValue(int n, int w) {
    int B[102]={0}, R[102]={0};
    for(int i=0; i<n; i++) B[i] = 1;
    playRound(B, R);

    int done = 0;
    for(int i=0; i<n; i++){
        if(R[i] == 0) B[i] = 0;
        else{
            if(!done) B[i] = 1, done = 1;
            else B[i] = 0;
        }
    }
    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) {
    // 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.
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

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 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -