답안 #303810

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303810	2020-09-20T16:22:06 Z	temurbek_khujaev	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	9 ms	384 KB

mushrooms

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

using namespace std;

int count_mushrooms(int n) {
        vector<int> a = {0};
        vector<int> b;
        int pos = 1;
        if (n > 2000) {
            while (a.size() < 2 && b.size() < 2) {
                int res = use_machine({0, pos});
                if (res == 0) a.push_back(pos);
                else b.push_back(pos);
                pos++;
            }

            int k = 138;
            int p = 20000 / k - k / 2;
            for (int i = 0; i < p; i++) {
                if (a.size() >= 2) {
                    int res = use_machine({a[0], pos, a[1], pos + 1});
                    if (res & 2) b.push_back(pos); else a.push_back(pos);
                    if (res & 1) b.push_back(pos + 1); else a.push_back(pos + 1);
                } else {
                    int res = use_machine({b[0], pos, b[1], pos + 1});
                    if (res & 2) a.push_back(pos); else b.push_back(pos);
                    if (res & 1) a.push_back(pos + 1); else b.push_back(pos + 1);
                }
                pos += 2;
            }
        }
        int cnta = a.size();
        while (pos < n) {
            vector<int> q;
            if (a.size() > b.size()) {
                int f = min(n - pos, (int) a.size());
                for (int i = 0; i < f; i++) {
                    q.push_back(a[i]);
                    q.push_back(pos++);
                }
                int res = use_machine(q);
                if (res & 1) {
                    b.push_back(q.back());
                } else a.push_back(q.back());
                cnta += f - (res + 1) / 2;
            } else {
                int f = min(n - pos, (int) b.size());
                for (int i = 0; i < f; i++) {
                    q.push_back(b[i]);
                    q.push_back(pos++);
                }
                int res = use_machine(q);
                if (res & 1) {
                    a.push_back(q.back());
                } else b.push_back(q.back());
                cnta += (res + 1) / 2;
            }
        }
        return cnta;

}

Subtask #1

92.623 / 100.0

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