답안 #51187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
51187 2018-06-17T06:54:46 Z TAMREF 코알라 (APIO17_koala) C++11
4 / 100
8 ms 476 KB
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int B[105], R[105];

int minValue(int N, int W) {
    B[0] = 1;
    playRound(B,R);
    return (R[0] ? min_element(R,R+N) - R : 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.
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 452 KB Output is correct
2 Correct 8 ms 452 KB Output is correct
3 Correct 7 ms 476 KB Output is correct
4 Correct 8 ms 476 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 476 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 476 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 476 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 476 KB Output isn't correct
2 Halted 0 ms 0 KB -