oj.uz

답안 #969724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969724 2024-04-25T13:49:04 Z socpite 코알라 (APIO17_koala) C++14
71 / 100
 48 ms 596 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;

int B[105], R[105];

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.
    return 0;
}
vector<int> search_set = {1, 2, 3, 5, 6, 7, 8};

int maxValue(int N, int W) {
    vector<int> vec = {1, 2, 4, 11};
    vector<int> good(N);
    iota(good.begin(), good.end(), 0);
    for(auto v: vec){
        fill(B, B + N, 0);
        for(auto id: good)B[id] = v;
        playRound(B, R);
        good.clear();
        for(int i = 0; i < N; i++)if(R[i] > v)good.push_back(i);
    }
    return good.back();
}

int greaterValue(int N, int W) {
    int l = 0, r = 6;
    while(l <= r){
        int md = (l+r)>>1;
        int mid = search_set[md];
        B[0] = B[1] = mid;
        playRound(B, R);
        if (R[0] > mid and R[1] <= mid) return 0;
        if (R[1] > mid and R[0] <= mid) return 1;
        if(R[0] > mid && R[1] > mid)l = md + 1;
        else r = md - 1;
    }
    return 0;

    // k p0 <= sum (k+1)so dau tien < p1
}

int n;

int bound[9][2] = {
    {0, 0},
    {0, 4},
    {2, 10},
    {5, 19},
    {9, 31},
    {14, 46},
    {20, 64},
    {27, 85},
    {35, 101}
};

int cbound[105][2];

int cnt[105][2];
bool recmp[105][105];
int ans[105];

bool cmp(int a, int b){
    assert(a != b);
    if(recmp[a][b])return 1;
    if(recmp[b][a])return 0;
    int la = max(cnt[a][0] - 1, cbound[a][0]), ra = min(100 - cnt[a][1], cbound[a][1]);
    int lb = max(cnt[b][0] - 1, cbound[b][0]), rb = min(100 - cnt[b][1], cbound[b][1]);
    if(la >= rb){
        cnt[a][0]++;
        cnt[b][1]++;
        recmp[b][a] = 1;
        return 0;
    }
    if(lb >= ra){
        recmp[a][b] = 1;
        cnt[b][0]++;
        cnt[a][1]++;
        return 1;
    }
    int l = -1, r = -1;
    for(int i = 0; i < 7; i++){
        if(bound[search_set[i]][0] >= min(ra, rb) || bound[search_set[i]][1] <= max(la, lb))continue;
        if(l == -1)l = i;
        r = i;
    }
    while(l <= r){
        int md = (l+r)>>1;
        int mid = search_set[md];
        fill(B, B+n, 0);
        B[a] = B[b] = mid;
        playRound(B, R);
        // cout << mid << " " << R[a] << " " << R[b] << endl;
        if (R[a] > mid and R[b] <= mid) {
            cnt[a][0]++;
            cnt[b][1]++;
            recmp[b][a] = 1;
            return 0;
        }
        if (R[b] > mid and R[a] <= mid) {
            cnt[b][0]++;
            cnt[a][1]++;
            recmp[a][b] = 1;
            return 1;
        }
        if(R[a] > mid && R[b] > mid){
            l = md + 1;
            cbound[a][0] = max(cbound[a][0], bound[mid][1]);
            cbound[b][0] = max(cbound[b][0], bound[mid][1]);
        }
        else {
            r = md - 1;
            cbound[a][1] = min(cbound[a][1], bound[mid][0]);
            cbound[b][1] = min(cbound[b][1], bound[mid][0]);
        }
    }
    assert(false);
    return 0;
}

bool cmp_subtask_4(int a, int b){
    fill(B, B+n, 0);
    B[a] = B[b] = n;
    playRound(B, R);
    return R[a] < R[b];
}

mt19937 rng_lmao(69420);

void allValues(int N, int W, int *P) {
    n = N;
    if (W == 2*N) {
        vector<int> vec(N);
        iota(vec.begin(), vec.end(), 0);
        stable_sort(vec.begin(), vec.end(), cmp_subtask_4);
        for(int i = 0; i < N; i++)P[vec[i]] = i+1;
    } else {
        for(int i = 0; i < N; i++)cbound[i][1] = 101;
        vector<int> vec(N);
        iota(vec.begin(), vec.end(), 0);
        shuffle(vec.begin(), vec.end(), rng_lmao);
        sort(vec.begin(), vec.end(), cmp);
        for(int i = 0; i < N; i++)P[vec[i]] = i+1;
        
    }
}

Subtask #1
0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 472 KB Output is correct
2 Correct 47 ms 468 KB Output is correct
3 Correct 48 ms 476 KB Output is correct
4 Correct 47 ms 476 KB Output is correct
5 Correct 44 ms 476 KB Output is correct
6 Correct 42 ms 488 KB Output is correct
7 Correct 40 ms 488 KB Output is correct
8 Correct 42 ms 472 KB Output is correct
9 Correct 41 ms 484 KB Output is correct
10 Correct 40 ms 476 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 344 KB Output is correct
2 Correct 28 ms 344 KB Output is correct
3 Correct 28 ms 344 KB Output is correct
4 Correct 27 ms 344 KB Output is correct
5 Correct 29 ms 344 KB Output is correct
6 Correct 27 ms 460 KB Output is correct
7 Correct 27 ms 460 KB Output is correct
8 Correct 28 ms 460 KB Output is correct
9 Correct 27 ms 464 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 28 ms 436 KB Output is correct
12 Correct 12 ms 344 KB Output is correct
13 Correct 26 ms 344 KB Output is correct
14 Correct 24 ms 344 KB Output is correct
15 Correct 24 ms 460 KB Output is correct
16 Correct 25 ms 344 KB Output is correct
17 Correct 24 ms 344 KB Output is correct
18 Correct 25 ms 344 KB Output is correct
19 Correct 26 ms 464 KB Output is correct
20 Correct 25 ms 344 KB Output is correct

Subtask #5
28.0 / 53.0

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