oj.uz

답안 #1075342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075342 2024-08-26T03:21:01 Z HappyCapybara 코알라 (APIO17_koala) C++17
22 / 100
 47 ms 728 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;

int minValue(int N, int W) {
    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<N; i++){
        if (B[i] >= R[i]) return i;
    }
}

int maxValue(int N, int W) {
    int B[N], R[N];
    for (int i=0; i<N; i++) B[i] = 1;
    playRound(B, R);
    vector<int> v;
    for (int i=0; i<N; i++){
        if (R[i] > 1) v.push_back(i);
    }
    for (int i=0; i<N; i++) B[i] = 0;
    for (int x : v) B[x] = 2;
    playRound(B, R);
    vector<int> w;
    for (int x : v){
        if (R[x] > 2) w.push_back(x);
    }
    for (int i=0; i<N; i++) B[i] = 0;
    for (int x : w) B[x] = 10;
    playRound(B, R);
    for (int x : w){
        if (R[x] > 10) return x;
    }
    return 0;
}

int greaterValue(int N, int W) {
    int B[N], R[N];
    for (int i=0; i<N; i++) B[i] = 0;
    int l = 0, r = 13;
    while (l != r){
        int m = (l+r)/2;
        B[0] = m;
        B[1] = m;
        playRound(B, R);
        if (R[0] > B[0] && R[1] > B[1]) l = m;
        if (R[0] <= B[0] && R[1] <= B[1]) r = m;
        if (R[0] > B[0] && R[1] <= B[1]) return 0;
        if (R[0] <= B[0] && R[1] > B[1]) return 1;
    }
}

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.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:13:1: warning: control reaches end of non-void function [-Wreturn-type]
   13 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
   53 | }
      | ^

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 344 KB Output is correct
2 Correct 47 ms 344 KB Output is correct
3 Correct 38 ms 728 KB Output is correct
4 Correct 35 ms 344 KB Output is correct
5 Correct 34 ms 344 KB Output is correct
6 Correct 36 ms 344 KB Output is correct
7 Correct 33 ms 344 KB Output is correct
8 Correct 34 ms 344 KB Output is correct
9 Correct 33 ms 344 KB Output is correct
10 Correct 33 ms 344 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 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 -