oj.uz

Submission #523273

# Submission time Handle Problem Language Result Execution time Memory
523273 2022-02-07T09:54:29 Z valerikk Koala Game (APIO17_koala) C++17
100 / 100
 75 ms 444 KB 
#include "koala.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <functional>

using namespace std;

int B[100], R[100];

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.
    
    memset(B, 0, sizeof(B));
    B[0] = 1;
    playRound(B, R);
    for (int i = 0; i < N; ++i) {
        if (R[i] == 0) {
            return i;
        }
    }
    
    assert(false);
    return 0;
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    vector<int> cur;
    for (int i = 0; i < N; ++i) {
        cur.push_back(i);
    }
    while (cur.size() != 1) {
        int x = W / (int)cur.size();
        memset(B, 0, sizeof(B));
        for (int i : cur) {
            B[i] = x;
        }
        playRound(B, R);
        vector<int> ncur;
        for (int i : cur) {
            if (R[i] > B[i]) {
                ncur.push_back(i);
            }
        }
        cur = ncur;
    }
    return cur[0];
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int l = 1, r = min(N / 2, 9);
    int res = -1;
    while (r - l > 1) {
        int m = (l + r) / 2;
        memset(B, 0, sizeof(B));
        B[0] = B[1] = m;
        playRound(B, R);
        if ((B[1] < R[1]) != (B[0] < R[0])) {
            res = B[1] < R[1];
        }
        if (B[0] < R[0] || B[1] < R[1]) {
            l = m + 1;
        } else {
            r = m - 1;
        }
    }
    if (res == -1) {
        memset(B, 0, sizeof(B));
        B[0] = B[1] = l;
        playRound(B, R);
        res = B[1] < R[1];
    }
    return res;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
        auto cmp = [&](int a, int b) {
            memset(B, 0, sizeof(B));
            B[a] = B[b] = N;
            playRound(B, R);
            return R[b] > B[b];
        };
        vector<int> sorted(N);
        for (int i = 0; i < N; ++i) {
            sorted[i] = i;
        }
        stable_sort(sorted.begin(), sorted.end(), cmp);
        for (int i = 0; i < N; ++i) {
            *(P + sorted[i]) = i + 1;
        }
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
        
        auto check = [&](int l, int r, int x) {
            vector<int> a, b;
            for (int i = 1; i <= N; ++i) {
                if (l <= i && i <= r) {
                    a.push_back(i);
                } else {
                    b.push_back(i);
                }
            }
            sort(a.rbegin(), a.rend());
            sort(b.rbegin(), b.rend());
            int sz_a = a.size(), sz_b = b.size();
            vector<int> pref_a(sz_a + 1, 0);
            for (int i = 0; i < sz_a; ++i) {
                pref_a[i + 1] = pref_a[i] + a[i];
            }
            vector<int> pref_b(sz_b + 1, 0);
            for (int i = 0; i < sz_b; ++i) {
                pref_b[i + 1] = pref_b[i] + b[i];
            }
            vector<pair<int, int>> keks;
            for (int take_a = 0; take_a <= sz_a && take_a * (x + 1) <= W; ++take_a) {
                int take_b = min(sz_b, W - take_a * (x + 1));
                keks.push_back({pref_a[take_a] + pref_b[take_b], take_a});
            }
            sort(keks.rbegin(), keks.rend());
            for (auto kek : keks) {
                if (kek.first == keks[0].first && (kek.second == 0 || kek.second == sz_a)) {
                    return false;
                }
            }
            return true;
        };

        function<void(vector<int>, int, int)> rec = [&](vector<int> guys, int l, int r) {
            if (guys.size() == 1) {
                *(P + guys[0]) = l;
                return;
            }
            for (int x = 0; x * (r - l + 1) <= W; ++x) {
                if (check(l, r, x)) {
                    memset(B, 0, sizeof(B));
                    for (int i : guys) {
                        B[i] = x;
                    }
                    playRound(B, R);
                    vector<int> small, big;
                    for (int i : guys) {
                        if (B[i] < R[i]) {
                            big.push_back(i);
                        } else {
                            small.push_back(i);
                        }
                    }
                    rec(small, l, l + (int)small.size() - 1);
                    rec(big, r - (int)big.size() + 1, r);
                    return;
                }
            }
            assert(false);
        };
        vector<int> guys;
        for (int i = 0; i < N; ++i) {
            guys.push_back(i);
        }
        rec(guys, 1, N);
    }   
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 200 KB Output is correct
2 Correct 4 ms 200 KB Output is correct
3 Correct 4 ms 200 KB Output is correct
4 Correct 3 ms 200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 200 KB Output is correct
2 Correct 12 ms 200 KB Output is correct
3 Correct 11 ms 200 KB Output is correct
4 Correct 12 ms 200 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 444 KB Output is correct
2 Correct 66 ms 312 KB Output is correct
3 Correct 75 ms 324 KB Output is correct
4 Correct 69 ms 324 KB Output is correct
5 Correct 65 ms 316 KB Output is correct
6 Correct 70 ms 320 KB Output is correct
7 Correct 69 ms 316 KB Output is correct
8 Correct 66 ms 320 KB Output is correct
9 Correct 65 ms 316 KB Output is correct
10 Correct 63 ms 320 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 308 KB Output is correct
2 Correct 31 ms 292 KB Output is correct
3 Correct 30 ms 200 KB Output is correct
4 Correct 30 ms 292 KB Output is correct
5 Correct 30 ms 200 KB Output is correct
6 Correct 34 ms 312 KB Output is correct
7 Correct 30 ms 200 KB Output is correct
8 Correct 30 ms 200 KB Output is correct
9 Correct 30 ms 308 KB Output is correct
10 Correct 29 ms 200 KB Output is correct
11 Correct 31 ms 200 KB Output is correct
12 Correct 13 ms 308 KB Output is correct
13 Correct 29 ms 308 KB Output is correct
14 Correct 28 ms 200 KB Output is correct
15 Correct 27 ms 200 KB Output is correct
16 Correct 27 ms 308 KB Output is correct
17 Correct 27 ms 200 KB Output is correct
18 Correct 30 ms 288 KB Output is correct
19 Correct 28 ms 200 KB Output is correct
20 Correct 27 ms 308 KB Output is correct

Subtask #5
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 328 KB Output is correct
2 Correct 4 ms 292 KB Output is correct
3 Correct 3 ms 200 KB Output is correct
4 Correct 3 ms 328 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 4 ms 200 KB Output is correct
7 Correct 4 ms 328 KB Output is correct
8 Correct 4 ms 200 KB Output is correct
9 Correct 4 ms 328 KB Output is correct
10 Correct 4 ms 328 KB Output is correct
11 Correct 4 ms 324 KB Output is correct
12 Correct 4 ms 328 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 4 ms 328 KB Output is correct
17 Correct 4 ms 328 KB Output is correct
18 Correct 4 ms 324 KB Output is correct
19 Correct 4 ms 324 KB Output is correct
20 Correct 4 ms 200 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 4 ms 316 KB Output is correct
26 Correct 4 ms 328 KB Output is correct
27 Correct 4 ms 200 KB Output is correct
28 Correct 6 ms 280 KB Output is correct
29 Correct 6 ms 200 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 4 ms 328 KB Output is correct
33 Correct 3 ms 328 KB Output is correct
34 Correct 4 ms 328 KB Output is correct
35 Correct 4 ms 328 KB Output is correct
36 Correct 4 ms 328 KB Output is correct
37 Correct 4 ms 328 KB Output is correct
38 Correct 4 ms 328 KB Output is correct
39 Correct 4 ms 328 KB Output is correct
40 Correct 3 ms 328 KB Output is correct