oj.uz

답안 #808675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
808675 2023-08-05T09:15:30 Z thimote75 코알라 (APIO17_koala) C++14
59 / 100
 50 ms 340 KB 
#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

using di = pair<int, int>;
using vd = vector<di>;
using idata = vector<int>;
using bdata = vector<bool>;
const int MAXN = 100;
int R[MAXN], B[MAXN];

bdata defaultExclusion(MAXN, false);

idata playRound (vd V, bdata &exclusion, int offset = 0) {
    for (int i = 0; i < MAXN; i ++) B[i] = offset;

    for (const auto &x : V) B[x.first] = x.second;

    playRound(B, R);

    idata answer;
    for (int i = 0; i < MAXN; i ++)
        if (B[i] < R[i] && !exclusion[i])
            answer.push_back(i);
        
    return answer;
}
vd fill (idata values, int count) {
    vd answer;
    for (int u : values) answer.push_back({ u, count });

    return answer;
}

int minValue(int N, int W) {
    idata result = playRound({ { 0, 1 } }, defaultExclusion);

    int answer = -1;
    for (int i = 0; i < N; i ++)
        if (R[i] == 0)
            answer = i;
    return answer;
}

int maxValue(int N, int W) {
    idata answer(N);
    iota(answer.begin(), answer.end(), 0);

    bdata exclusion(N);

    idata firstSubset = playRound(fill( answer, 1 ), exclusion);
    for (int i = 0; i < N; i ++) exclusion[i] = true;
    for (int u    : firstSubset) exclusion[u] = false;

    idata secondSubset = playRound(fill( firstSubset, N / firstSubset.size()), exclusion);
    for (int i = 0; i < N; i ++) exclusion[i] = true;
    for (int u   : secondSubset) exclusion[u] = false;
    idata thirdSubset = playRound(fill( secondSubset, N / secondSubset.size()), exclusion);
    for (int i = 0; i < N; i ++) exclusion[i] = true;
    for (int u   : thirdSubset) exclusion[u] = false;
    idata fourthSubset = playRound(fill( thirdSubset, N / thirdSubset.size()), exclusion);
    for (int i = 0; i < N; i ++) exclusion[i] = true;
    for (int u   : fourthSubset) exclusion[u] = false;

    if (fourthSubset.size() != 0) return fourthSubset[0];
    if (thirdSubset .size() != 0) return thirdSubset [0];
    if (secondSubset.size() != 0) return secondSubset[0];
    return firstSubset[0];
}

int greaterValue(int N, int W, int p0 = 0, int p1 = 1) {
    bdata exclusion(N, true);
    exclusion[0] = false; exclusion[1] = false;

    int a = 1;
    int b = 9;

    int p = -1;
    while (b - a > 1) {
        int c = (a + b) >> 1;

        if (c != 2)
            playRound({ {p0, c}, {p1, c} }, exclusion);
        else
            playRound({ {p0, c}, {p1, c}, { p, W - 2 * c } }, exclusion);

        if (p == -1)
            for (int u = 0; u < MAXN; u ++)
                if (B[u] < R[u] && p0 != u && p1 != u)
                    p = u;

        bool h0 = B[p0] < R[p0];
        bool h1 = B[p1] < R[p1];
        if (h0 ^ h1) return h0 ? p0 : p1;

        if (h0 && h1) a = c;
        else b = c;
    }

    // (P_0, P_1) est soit (1, 2), soit (2, 1) 
    return -1;
}
int greaterValue(int N, int W) {
    return greaterValue(N, W, 0, 1);
}

void allValues2 (int N, int W, int* P) {

}
struct Comp {
    bool operator() (int a, int b) {
        return greaterValue(100, 100, a, b) == b;
    }
};
void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        allValues2 (N, W, P);
        return ;
    }

    idata values(N);
    iota(values.begin(), values.end(), 0);
    sort(values.begin(), values.end(), Comp());

    for (int i = 0; i < N; i ++)
        P[values[i]] = i + 1;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 332 KB Output is correct
2 Correct 50 ms 324 KB Output is correct
3 Correct 41 ms 336 KB Output is correct
4 Correct 46 ms 340 KB Output is correct
5 Correct 41 ms 328 KB Output is correct
6 Correct 44 ms 328 KB Output is correct
7 Correct 42 ms 340 KB Output is correct
8 Correct 44 ms 328 KB Output is correct
9 Correct 42 ms 328 KB Output is correct
10 Correct 40 ms 336 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
22.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 25 ms 208 KB Output is partially correct
2 Partially correct 31 ms 208 KB Output is partially correct
3 Partially correct 28 ms 208 KB Output is partially correct
4 Partially correct 28 ms 208 KB Output is partially correct
5 Partially correct 32 ms 208 KB Output is partially correct
6 Partially correct 30 ms 208 KB Output is partially correct
7 Partially correct 28 ms 208 KB Output is partially correct
8 Partially correct 30 ms 316 KB Output is partially correct
9 Partially correct 30 ms 296 KB Output is partially correct
10 Partially correct 28 ms 296 KB Output is partially correct
11 Partially correct 28 ms 316 KB Output is partially correct
12 Partially correct 19 ms 312 KB Output is partially correct
13 Partially correct 30 ms 208 KB Output is partially correct
14 Partially correct 28 ms 296 KB Output is partially correct
15 Partially correct 27 ms 208 KB Output is partially correct
16 Partially correct 30 ms 208 KB Output is partially correct
17 Partially correct 32 ms 208 KB Output is partially correct
18 Partially correct 36 ms 292 KB Output is partially correct
19 Partially correct 30 ms 312 KB Output is partially correct
20 Partially correct 29 ms 292 KB Output is partially correct
21 Partially correct 28 ms 320 KB Output is partially correct
22 Partially correct 30 ms 296 KB Output is partially correct
23 Partially correct 23 ms 316 KB Output is partially correct
24 Partially correct 29 ms 208 KB Output is partially correct
25 Partially correct 29 ms 208 KB Output is partially correct
26 Partially correct 31 ms 208 KB Output is partially correct
27 Partially correct 28 ms 208 KB Output is partially correct
28 Partially correct 29 ms 208 KB Output is partially correct
29 Partially correct 28 ms 208 KB Output is partially correct
30 Partially correct 29 ms 208 KB Output is partially correct
31 Partially correct 28 ms 296 KB Output is partially correct
32 Partially correct 29 ms 208 KB Output is partially correct
33 Partially correct 34 ms 312 KB Output is partially correct
34 Partially correct 26 ms 208 KB Output is partially correct
35 Partially correct 29 ms 208 KB Output is partially correct
36 Partially correct 27 ms 316 KB Output is partially correct
37 Partially correct 28 ms 316 KB Output is partially correct
38 Partially correct 28 ms 208 KB Output is partially correct
39 Partially correct 29 ms 208 KB Output is partially correct
40 Partially correct 29 ms 208 KB Output is partially correct