oj.uz

답안 #468362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468362 2021-08-27T20:29:01 Z kessido 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 11 ms 520 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vll vector<ll>
#define vi vector<int>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define fori(i,n) for(int i = 0; i < int(n); ++i)

bool test_is_a(int i) {
    return use_machine(vi{0, i}) == 0;
}

int count_mushrooms(int n) {
    vi opts(n-1);
    fori(i, n-1) opts[i] = i + 1;
    random_shuffle(all(opts));

    auto pop1 = [&]() {
        int i = opts.back();
        opts.pop_back();
        return i;
    };
    auto pop2 = [&]() -> pi { return {pop1(), pop1()}; };

    vi as = {0};
    vi bs = {};

    auto add_to_list = [&](int idx, bool is_a) {
        if(is_a) as.push_back(idx);
        else     bs.push_back(idx);
    };

    auto biggest_list_size = [&]() { return max(as.size(), bs.size()); };
    auto get_bigger_list = [&]() -> pair<vi&, bool> {
        if(as.size() >= bs.size()) return {as, true};
        else                       return {bs, false}; 
    };
    if(n <= 226) {
        fori(_i, n-1) {
            int i = pop1();
            add_to_list(i, test_is_a(i));
        }
        return as.size();
    }

    while (biggest_list_size() < 2) {
        int i = pop1();
        add_to_list(i, test_is_a(i));
    }

    while (biggest_list_size() < 76) {
        auto [i1, i2] = pop2();
        const auto& [ls, use_a] = get_bigger_list();
        vi test = {i1, ls[0], i2, ls[1]};
        
        int res = use_machine(test);
        add_to_list(i1, ((res&1) == 1) ^ use_a);
        add_to_list(i2, ((res&2) == 2) ^ use_a);
    }

    int as_count = 0;
    int bs_count = 0;
    
    while (!opts.empty()) {
        const auto& [ls, use_a] = get_bigger_list();
        vi test;
        for(int i : ls) {
            if(opts.empty()) break;
            test.push_back(pop1());
            test.push_back(i);
        }
        int res = use_machine(test);
        add_to_list(test[0], (res&1) ^ use_a);
        int bc1 = res >> 1;
        int ac1 = test.size()/2 - 1 - bc1;
        if (!use_a) swap(ac1, bc1);
        as_count += ac1;
        bs_count += bc1;
    }
    as_count += as.size();
    bs_count += bs.size();
    
    return as_count;
}

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 10 ms 328 KB Output is correct
8 Correct 7 ms 328 KB Output is correct
9 Correct 7 ms 328 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Partially correct 7 ms 392 KB Output is partially correct
12 Correct 8 ms 380 KB Output is correct
13 Correct 7 ms 328 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Partially correct 6 ms 404 KB Output is partially correct
16 Partially correct 8 ms 384 KB Output is partially correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 7 ms 376 KB Output is correct
19 Partially correct 6 ms 404 KB Output is partially correct
20 Correct 7 ms 400 KB Output is correct
21 Correct 8 ms 520 KB Output is correct
22 Partially correct 8 ms 328 KB Output is partially correct
23 Correct 9 ms 328 KB Output is correct
24 Correct 5 ms 352 KB Output is correct
25 Partially correct 11 ms 328 KB Output is partially correct
26 Partially correct 8 ms 384 KB Output is partially correct
27 Partially correct 11 ms 328 KB Output is partially correct
28 Partially correct 8 ms 400 KB Output is partially correct
29 Partially correct 8 ms 396 KB Output is partially correct
30 Partially correct 8 ms 408 KB Output is partially correct
31 Partially correct 7 ms 388 KB Output is partially correct
32 Partially correct 8 ms 456 KB Output is partially correct
33 Partially correct 11 ms 328 KB Output is partially correct
34 Partially correct 9 ms 384 KB Output is partially correct
35 Partially correct 8 ms 328 KB Output is partially correct
36 Partially correct 8 ms 328 KB Output is partially correct
37 Partially correct 8 ms 328 KB Output is partially correct
38 Partially correct 8 ms 328 KB Output is partially correct
39 Partially correct 8 ms 396 KB Output is partially correct
40 Partially correct 8 ms 328 KB Output is partially correct
41 Partially correct 7 ms 328 KB Output is partially correct
42 Partially correct 8 ms 372 KB Output is partially correct
43 Partially correct 8 ms 388 KB Output is partially correct
44 Partially correct 9 ms 328 KB Output is partially correct
45 Partially correct 8 ms 396 KB Output is partially correct
46 Partially correct 8 ms 380 KB Output is partially correct
47 Partially correct 8 ms 328 KB Output is partially correct
48 Partially correct 10 ms 328 KB Output is partially correct
49 Partially correct 7 ms 388 KB Output is partially correct
50 Partially correct 7 ms 328 KB Output is partially correct
51 Partially correct 8 ms 376 KB Output is partially correct
52 Partially correct 8 ms 392 KB Output is partially correct
53 Partially correct 7 ms 392 KB Output is partially correct
54 Partially correct 8 ms 396 KB Output is partially correct
55 Partially correct 8 ms 392 KB Output is partially correct
56 Partially correct 8 ms 392 KB Output is partially correct
57 Partially correct 9 ms 328 KB Output is partially correct
58 Partially correct 7 ms 328 KB Output is partially correct
59 Partially correct 7 ms 328 KB Output is partially correct
60 Partially correct 8 ms 396 KB Output is partially correct
61 Partially correct 7 ms 392 KB Output is partially correct
62 Correct 1 ms 200 KB Output is correct
63 Correct 0 ms 200 KB Output is correct
64 Correct 0 ms 200 KB Output is correct
65 Correct 0 ms 200 KB Output is correct
66 Correct 0 ms 200 KB Output is correct
67 Correct 0 ms 200 KB Output is correct
68 Correct 0 ms 200 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 0 ms 200 KB Output is correct
72 Correct 0 ms 200 KB Output is correct
73 Correct 1 ms 200 KB Output is correct
74 Correct 1 ms 200 KB Output is correct
75 Correct 0 ms 200 KB Output is correct
76 Correct 0 ms 200 KB Output is correct
77 Correct 0 ms 200 KB Output is correct
78 Correct 0 ms 200 KB Output is correct
79 Correct 0 ms 200 KB Output is correct
80 Correct 0 ms 200 KB Output is correct
81 Correct 0 ms 200 KB Output is correct
82 Correct 0 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 200 KB Output is correct
85 Correct 0 ms 200 KB Output is correct
86 Correct 0 ms 200 KB Output is correct
87 Correct 0 ms 200 KB Output is correct
88 Correct 0 ms 200 KB Output is correct
89 Correct 0 ms 200 KB Output is correct
90 Correct 0 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct