oj.uz

답안 #557667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557667 2022-05-05T18:20:58 Z nutella 코알라 (APIO17_koala) C++17
47 / 100
 58 ms 336 KB 
#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxN = 100;
int B[maxN], R[maxN];

void cl() {
    memset(B, 0, sizeof(B));
    memset(R, 0, sizeof(R));
}

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.
    cl();
    B[0] = 1;
    playRound(B, R);
    if (R[0]) {
        return int(min_element(R, R + N) - R);
    } else {
        return 0;
    }
}

int maxValue(int N, int W) {
    // return i such as P[i] = n
    vector<int> left(N);
    iota(begin(left), end(left), 0);
    while (size(left) > 1) {
        int x = W / (int) size(left);
        cl();
        for (int i: left)
            B[i] = x;
        playRound(B, R);
        vector<int> tmp;
        for (int i: left)
            if (B[i] < R[i])
                tmp.push_back(i);
        swap(tmp, left);
    }
    assert(size(left) == 1);
    return left[0];
}

int greaterValue(int N, int W) {
    // compare P[0] and P[1]
    int l = 0, r = W / 8;
    while (l + 1 < r) {
        int m = (l + r) >> 1;
        cl();
        B[0] = B[1] = m;
        playRound(B, R);
        bool took1 = R[0] > B[0];
        bool took2 = R[1] > B[1];
        if (took1 && took2) l = m;
        else if (!took1 && !took2) r = m;
        else if (took1) return 0;
        else return 1;
    }
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == N) {
        vector<int> ord(N);
        iota(begin(ord), end(ord), 0);
        stable_sort(begin(ord), end(ord), [&](int i, int j) {
            cl();
            int l = 0, r = W / 12;
            while (l + 1 < r) {
                int m = (l + r) >> 1;
                cl();
                B[i] = B[j] = m;
                playRound(B, R);
                bool took1 = R[i] > B[i];
                bool took2 = R[j] > B[j];
                if (took1 && took2) l = m;
                else if (!took1 && !took2) r = m;
                else if (took1) return false;
                else return true;
            }
            return false;
        });
        for (int i = 0; i < N; ++i)
            P[ord[i]] = i + 1;
    } else {
        vector<int> ord(N);
        iota(begin(ord), end(ord), 0);
        stable_sort(begin(ord), end(ord), [&](int i, int j) {
            cl();
            B[i] = N, B[j] = N;
            playRound(B, R);
            return B[i] >= R[i];
        });
        for (int i = 0; i < N; ++i)
            P[ord[i]] = i + 1;
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 332 KB Output is correct
2 Correct 54 ms 328 KB Output is correct
3 Correct 44 ms 336 KB Output is correct
4 Correct 44 ms 336 KB Output is correct
5 Correct 53 ms 328 KB Output is correct
6 Correct 46 ms 328 KB Output is correct
7 Correct 49 ms 336 KB Output is correct
8 Correct 43 ms 336 KB Output is correct
9 Correct 44 ms 324 KB Output is correct
10 Correct 44 ms 336 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 208 KB Output is correct
2 Correct 34 ms 208 KB Output is correct
3 Correct 33 ms 208 KB Output is correct
4 Correct 30 ms 208 KB Output is correct
5 Correct 35 ms 208 KB Output is correct
6 Correct 32 ms 208 KB Output is correct
7 Correct 34 ms 300 KB Output is correct
8 Correct 34 ms 208 KB Output is correct
9 Correct 31 ms 296 KB Output is correct
10 Correct 31 ms 296 KB Output is correct
11 Correct 32 ms 312 KB Output is correct
12 Correct 13 ms 312 KB Output is correct
13 Correct 29 ms 208 KB Output is correct
14 Correct 33 ms 208 KB Output is correct
15 Correct 28 ms 208 KB Output is correct
16 Correct 30 ms 208 KB Output is correct
17 Correct 30 ms 208 KB Output is correct
18 Correct 32 ms 208 KB Output is correct
19 Correct 31 ms 312 KB Output is correct
20 Correct 27 ms 208 KB Output is correct

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 20 ms 320 KB Output is partially correct
2 Incorrect 29 ms 208 KB Output isn't correct
3 Halted 0 ms 0 KB -