oj.uz

답안 #717135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
717135 2023-04-01T08:49:00 Z tht2005 코알라 (APIO17_koala) C++17
100 / 100
 64 ms 348 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 = 9;
    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;
        }
    }
}

bool compare(int i, int j) {
    memset(B, 0, sizeof(B));
    B[i] = B[j] = 100;
    playRound(B, R);
  	return (R[j] > B[j]);
}

void solve(int l, int r, vector<int>& A) {
    if(l == r) {
        return;
    }
    int m = (l + r) >> 1;
    solve(l, m, A);
    solve(m + 1, r, A);
    vector<int> B(r + 1 - l);
    for(int i = l, j = l, k = m + 1; i <= r; ++i) {
        if(k > r || (j <= m && compare(A[j], A[k]))) {
            B[i - l] = A[j++];
        }
        else {
            B[i - l] = A[k++];
        }
    }
    for(int i = l; i <= r; ++i) {
        A[i] = B[i - l];
    }
}

void split(const vector<int>& pos, int l, int r, int *P) {
    if(l == r) {
        P[pos[0]] = l;
    }
    else {
        int val = min((int)sqrt(l + l), 100 / (r - l + 1));
        memset(B, 0, sizeof(B));
        for(int i : pos) {
            B[i] = val;
        }
        playRound(B, R);
        vector<int> small, big;
        for(int i : pos) {
            if(R[i] > B[i]) {
                big.push_back(i);
            }
            else {
                small.push_back(i);
            }
        }
        split(small, l, l - 1 + small.size(), P);
        split(big, l + small.size(), r, P);
    }
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        vector<int> A(N);
        iota(A.begin(), A.end(), 0);
        solve(0, N - 1, A);
        for(int i = 0; i < N; ++i) {
            P[A[i]] = i + 1;
        }
    }
    else {
        vector<int> pos(N);
        iota(pos.begin(), pos.end(), 0);
        split(pos, 1, N, P);
    }
}

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 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 12 ms 324 KB Output is correct
2 Correct 12 ms 320 KB Output is correct
3 Correct 12 ms 316 KB Output is correct
4 Correct 11 ms 208 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 336 KB Output is correct
2 Correct 58 ms 328 KB Output is correct
3 Correct 51 ms 328 KB Output is correct
4 Correct 64 ms 332 KB Output is correct
5 Correct 51 ms 336 KB Output is correct
6 Correct 48 ms 332 KB Output is correct
7 Correct 53 ms 336 KB Output is correct
8 Correct 48 ms 336 KB Output is correct
9 Correct 49 ms 316 KB Output is correct
10 Correct 49 ms 336 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
53.0 / 53.0

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