답안 #609884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
609884	2022-07-28T02:46:07 Z	KoD	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	10 ms	464 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>

using std::array;
using std::pair;
using std::tuple;
using std::vector;

constexpr int K = 80;

int count_mushrooms(int n) {
    vector<char> color(n);
    array<vector<int>, 2> list = {};
    list[0].push_back(0);
    int k = 1;
    while (k < n and (int)std::max(list[0].size(), list[1].size()) < K) {
        if (k + 1 == n or (list[0].size() <= 1 and list[1].size() <= 1)) {
            color[k] = use_machine({0, k});
            list[color[k]].push_back(k);
            k += 1;
        } else {
            if (list[0].size() >= 2) {
                const int tmp = use_machine({list[0][0], k, list[0][1], k + 1});
                color[k] = tmp / 2;
                color[k + 1] = tmp % 2;
            } else {
                const int tmp = use_machine({list[1][0], k, list[1][1], k + 1});
                color[k] = 1 - tmp / 2;
                color[k + 1] = 1 - tmp % 2;
            }
            list[color[k]].push_back(k);
            list[color[k + 1]].push_back(k + 1);
            k += 2;
        }
    }
    int ret = std::count(color.begin(), color.begin() + k, 0);
    while (k < n) {
        const int fixed = list[0].size() >= list[1].size() ? 0 : 1;
        const int l = k;
        const int r = std::min(n, k + (int)list[fixed].size());
        k = r;
        vector<int> vec;
        for (int i = l; i < r; ++i) {
            vec.push_back(list[fixed][i - l]);
            vec.push_back(i);
        }
        const int query = use_machine(vec);
        if (fixed == 0) {
            ret += (r - l) - (query + 1) / 2;
            list[query % 2].push_back(r - 1);
        } else {
            ret += (query + 1) / 2;
            list[1 - query % 2].push_back(r - 1);
        }
    }
    return ret;
}

Subtask #1

92.623 / 100.0

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