oj.uz

답안 #715878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715878 2023-03-28T09:45:08 Z tht2005 코알라 (APIO17_koala) C++17
30 / 100
 92 ms 340 KB 
#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 102;

int B[N], R[N];

int minValue(int N, int W) {
    memset(B, 0, N * sizeof *B);
    B[0] = 1;
    playRound(B, R);
    for(int i = 0; i < N; ++i) {
        if(R[i] <= B[i]) {
            return i;
        }
    }
}

int maxValue(int N, int W) {
    vector<int> S(N);
    iota(S.begin(), S.end(), 0);
    while((int)S.size() > 1) {
        memset(B, 0, N * sizeof *B);
        for(int i : S) {
            B[i] = N / S.size();
        }
        playRound(B, R);
        vector<int> T;
        for(int i : S) {
            if(R[i] > B[i]) {
                T.push_back(i);
            }
        }
        S.swap(T);
    }
    return S[0];
}

int greaterValue(int N, int W) {
    memset(B, 0, N * sizeof *B);
    int l = 1, r = N / 2;
    while(l <= r) {
        int mid = (l + r) >> 1;
        B[0] = B[1] = mid;
        playRound(B, R);
        bool check = (R[0] > B[0]), check1 = (R[1] > B[1]);
        if(check != check1) {
            return check ? 0 : 1;
        }
        if(check) {
            l = mid + 1;
        }
        else {
            r = mid - 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:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
   60 | }
      | ^

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 316 KB Output is correct
2 Correct 12 ms 208 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 12 ms 320 KB Output is correct

Subtask #3
11.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 92 ms 324 KB Output is partially correct
2 Partially correct 91 ms 324 KB Output is partially correct
3 Partially correct 80 ms 324 KB Output is partially correct
4 Partially correct 81 ms 328 KB Output is partially correct
5 Partially correct 76 ms 328 KB Output is partially correct
6 Partially correct 83 ms 328 KB Output is partially correct
7 Partially correct 85 ms 320 KB Output is partially correct
8 Partially correct 81 ms 340 KB Output is partially correct
9 Partially correct 76 ms 324 KB Output is partially correct
10 Partially correct 79 ms 320 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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