oj.uz

답안 #978065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978065 2024-05-08T18:20:53 Z WongYiKai 코알라 (APIO17_koala) C++14
19 / 100
 15 ms 600 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

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.
    int b[N],r[N];
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    b[0] = 1;
    playRound(b,r);
    for (int i=0;i<100;i++){
        if (r[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.
    int b[N],r[N];
    for (int i=0;i<N;i++){
        b[i] = 1;
    }
    //b[0] = 1;
    playRound(b,r);
    queue<int> next;
    for (int i=0;i<N;i++){
        if (r[i]==2) next.push(i);
    }
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    while (!next.empty()) {
        b[next.front()]=2;
        next.pop();
    }
    playRound(b,r);
    for (int i=0;i<N;i++){
        if (r[i]==3) next.push(i);
    }
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    while (!next.empty()) {
        b[next.front()]=4;
        next.pop();
    }
    playRound(b,r);
    for (int i=0;i<N;i++){
        if (r[i]==5) next.push(i);
    }
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    while (!next.empty()) {
        b[next.front()]=11;
        next.pop();
    }
    playRound(b,r);
    for (int i=0;i<N;i++){
        if (r[i]==12) return i;
    }
    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 3 ms 600 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 444 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 456 KB Output is correct
2 Correct 11 ms 504 KB Output is correct
3 Correct 15 ms 452 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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