oj.uz

답안 #226157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
226157 2020-04-22T16:45:17 Z theStaticMind 코알라 (APIO17_koala) C++14
52 / 100
 108 ms 512 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int B[105], R[105];

int minValue(int N, int W) {

    for(int i = 0; i < N; i++) B[i] = 1;

    playRound(B, R);

    for(int i = 0; i < N; i++) B[i] = 0;
    for(int i = 0; i < N; i++){
        if(R[i] > 1){
            B[i] = 1;
            break;
        }
    }

    playRound(B, R);

    for(int i = 0; i < N; i++){
        if(R[i] <= B[i]) return i;
    }
    assert(0);

}


int maxValue(int N, int W) {
    bool rem[105];
    for(int i = 0; i < N; i++) rem[i] = true;
    auto recalc = [&](){
        int sum = 0;
        for(int i = 0; i < N; i++) if(rem[i]) sum++;
        for(int i = 0; i < N; i++){
            if(rem[i]) B[i] = W / sum;
            else B[i] = 0;
        }
    };

    for(int t = 0; t < 4; t++){
        recalc();
        playRound(B, R);
        for(int i = 0; i < N; i++){
            if(R[i] <= B[i]) rem[i] = false;
        }
    }

    for(int i = 0; i < N; i++){
        if(rem[i]) return i;
    }
    assert(0);
}

bool comp(int x, int y){
    int l = 1, r = 8;

    while(l <= r){
        int mid = (l + r) / 2;

        for(int i = 0; i < 100; i++) B[i] = 0;
        B[x] = B[y] = mid;
        playRound(B, R);

        if(R[x] <= B[x] && R[y] <= B[y]) r = mid - 1;
        else if(R[x] > B[x] && R[y] > B[y]) l = mid + 1;
        else{
            return R[x] <= B[x];
        }

    }
    assert(0);
}

int greaterValue(int N, int W) {
    if(comp(0, 1)) return 1;
    else return 0;
}

struct Comp{
    bool operator()(int x, int y){
            for(int i = 0; i < 100; i++) B[i] = 0;
            B[x] = B[y] = 100;
            playRound(B, R);
            return R[x] <= B[x];
        }
};

void allValues(int N, int W, int *P) {
    vector<int> ptr(N);
    multiset<int, Comp> seq;
    for(int i = 0; i < N; i++) ptr[i] = i;
    if (W == 2*N) {
        for(int i = 0; i < N; i++) seq.insert(i);
        ptr.clear();
        for(auto i : seq) ptr.push_back(i);
    } 
    else {
        sort(ptr.begin(), ptr.end(), comp);
    }
    for(int i = 0; i < N; i++){
        P[ptr[i]] = i + 1;
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 91 ms 384 KB Output is partially correct
2 Partially correct 108 ms 384 KB Output is partially correct
3 Partially correct 90 ms 384 KB Output is partially correct
4 Partially correct 90 ms 384 KB Output is partially correct
5 Partially correct 90 ms 384 KB Output is partially correct
6 Partially correct 95 ms 384 KB Output is partially correct
7 Partially correct 94 ms 384 KB Output is partially correct
8 Partially correct 92 ms 384 KB Output is partially correct
9 Partially correct 94 ms 384 KB Output is partially correct
10 Partially correct 89 ms 384 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
19.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 54 ms 360 KB Output is partially correct
2 Partially correct 73 ms 384 KB Output is partially correct
3 Partially correct 65 ms 384 KB Output is partially correct
4 Partially correct 68 ms 380 KB Output is partially correct
5 Partially correct 74 ms 376 KB Output is partially correct
6 Partially correct 64 ms 384 KB Output is partially correct
7 Partially correct 69 ms 384 KB Output is partially correct
8 Partially correct 68 ms 384 KB Output is partially correct
9 Partially correct 69 ms 384 KB Output is partially correct
10 Partially correct 63 ms 376 KB Output is partially correct
11 Partially correct 65 ms 384 KB Output is partially correct
12 Partially correct 44 ms 384 KB Output is partially correct
13 Partially correct 68 ms 384 KB Output is partially correct
14 Partially correct 67 ms 384 KB Output is partially correct
15 Partially correct 63 ms 504 KB Output is partially correct
16 Partially correct 69 ms 376 KB Output is partially correct
17 Partially correct 75 ms 384 KB Output is partially correct
18 Partially correct 77 ms 384 KB Output is partially correct
19 Partially correct 65 ms 376 KB Output is partially correct
20 Partially correct 68 ms 384 KB Output is partially correct
21 Partially correct 64 ms 376 KB Output is partially correct
22 Partially correct 70 ms 384 KB Output is partially correct
23 Partially correct 52 ms 384 KB Output is partially correct
24 Partially correct 67 ms 376 KB Output is partially correct
25 Partially correct 69 ms 384 KB Output is partially correct
26 Partially correct 71 ms 384 KB Output is partially correct
27 Partially correct 65 ms 384 KB Output is partially correct
28 Partially correct 68 ms 384 KB Output is partially correct
29 Partially correct 69 ms 504 KB Output is partially correct
30 Partially correct 65 ms 384 KB Output is partially correct
31 Partially correct 65 ms 384 KB Output is partially correct
32 Partially correct 68 ms 384 KB Output is partially correct
33 Partially correct 68 ms 384 KB Output is partially correct
34 Partially correct 61 ms 384 KB Output is partially correct
35 Partially correct 67 ms 384 KB Output is partially correct
36 Partially correct 63 ms 384 KB Output is partially correct
37 Partially correct 67 ms 384 KB Output is partially correct
38 Partially correct 73 ms 384 KB Output is partially correct
39 Partially correct 66 ms 384 KB Output is partially correct
40 Partially correct 69 ms 384 KB Output is partially correct