답안 #675913

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675913	2022-12-28T10:43:28 Z	VodkaInTheJar	버섯 세기 (IOI20_mushrooms)	C++14	92.623 / 100	10 ms	336 KB

mushrooms

#include <bits/stdc++.h>

using namespace std;

const int c = 150; 

int use_machine(vector <int> x);
int count_mushrooms(int n) {
    vector <int> as;
    vector <int> bs;

    as.push_back(0);

    if (n >= 1000) {
    if (use_machine({0, 1}) == 1)
        bs.push_back(1);

    else 
        as.push_back(1);

    if (use_machine({0, 2}) == 1)
        bs.push_back(2);

    else 
        as.push_back(2);

    for (int i = 3; i <= c; i += 2) {
        if ((int)as.size() >= 2) {
            int cnt_bs = use_machine({as[0], i, as[1], i + 1});
            if (cnt_bs == 3) {
                bs.push_back(i);
                bs.push_back(i+1);
            }

            else 
                if (cnt_bs == 2) {
                    bs.push_back(i);
                    as.push_back(i+1);
                }

                else 
                    if (cnt_bs == 1) {
                        bs.push_back(i+1);
                        as.push_back(i);
                    }

                    else {
                        as.push_back(i);
                        as.push_back(i+1);
                    }
        }

        else {
            int cnt_as = use_machine({bs[0], i, bs[1], i + 1});
            if (cnt_as == 3) {
                as.push_back(i);
                as.push_back(i+1);
            }

            else 
                if (cnt_as == 2) {
                    bs.push_back(i+1);
                    as.push_back(i);
                }

                else 
                    if (cnt_as == 1) {
                        bs.push_back(i);
                        as.push_back(i+1);
                    }

                    else {
                        bs.push_back(i);
                        bs.push_back(i+1);
                    }
        }
    }
    }

    int pos = c + 1, ans = (int)as.size();
    if (n < 1000)
        pos = 1;

    while (pos < n) {
        if ((int)as.size() >= (int)bs.size()) {
            int nxt = min(n, pos + (int)as.size());
            vector <int> temp;
            for (int i = pos; i < nxt; i++) {
                temp.push_back(as[i-pos]);
                temp.push_back(i);
            }

            int cnt_b = use_machine(temp);
            if (cnt_b & 1)
                bs.push_back(nxt-1), ans += (int)temp.size() / 2 - (cnt_b + 1) / 2;
            
            else 
                as.push_back(nxt-1), ans += (int)temp.size() / 2 - cnt_b / 2;
        
            pos = nxt; 
        }

        else {
            int nxt = min(n, pos + (int)bs.size());
            vector <int> temp;
            for (int i = pos; i < nxt; i++) {
                temp.push_back(bs[i-pos]);
                temp.push_back(i);
            }

            int cnt_a = use_machine(temp);
            if (cnt_a & 1)
                as.push_back(nxt-1), ans += (cnt_a + 1) / 2;
            
            else 
                bs.push_back(nxt-1), ans += cnt_a / 2;
        
            pos = nxt; 
        }
    }

    return ans;
}

Subtask #1

92.623 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 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	5 ms	208 KB	Output is correct
8	Correct	5 ms	308 KB	Output is correct
9	Correct	7 ms	208 KB	Output is correct
10	Correct	6 ms	336 KB	Output is correct
11	Partially correct	5 ms	332 KB	Output is partially correct
12	Correct	8 ms	208 KB	Output is correct
13	Correct	6 ms	208 KB	Output is correct
14	Correct	5 ms	328 KB	Output is correct
15	Partially correct	6 ms	312 KB	Output is partially correct
16	Partially correct	7 ms	220 KB	Output is partially correct
17	Correct	3 ms	208 KB	Output is correct
18	Correct	7 ms	208 KB	Output is correct
19	Partially correct	5 ms	332 KB	Output is partially correct
20	Correct	6 ms	208 KB	Output is correct
21	Correct	6 ms	324 KB	Output is correct
22	Partially correct	8 ms	328 KB	Output is partially correct
23	Correct	6 ms	312 KB	Output is correct
24	Correct	5 ms	208 KB	Output is correct
25	Partially correct	6 ms	208 KB	Output is partially correct
26	Partially correct	6 ms	328 KB	Output is partially correct
27	Partially correct	7 ms	208 KB	Output is partially correct
28	Partially correct	6 ms	312 KB	Output is partially correct
29	Partially correct	6 ms	332 KB	Output is partially correct
30	Partially correct	10 ms	208 KB	Output is partially correct
31	Partially correct	6 ms	324 KB	Output is partially correct
32	Partially correct	8 ms	336 KB	Output is partially correct
33	Partially correct	6 ms	328 KB	Output is partially correct
34	Partially correct	6 ms	304 KB	Output is partially correct
35	Partially correct	6 ms	320 KB	Output is partially correct
36	Partially correct	6 ms	208 KB	Output is partially correct
37	Partially correct	6 ms	208 KB	Output is partially correct
38	Partially correct	8 ms	324 KB	Output is partially correct
39	Partially correct	6 ms	324 KB	Output is partially correct
40	Partially correct	8 ms	312 KB	Output is partially correct
41	Partially correct	7 ms	336 KB	Output is partially correct
42	Partially correct	6 ms	328 KB	Output is partially correct
43	Partially correct	7 ms	320 KB	Output is partially correct
44	Partially correct	8 ms	208 KB	Output is partially correct
45	Partially correct	7 ms	328 KB	Output is partially correct
46	Partially correct	7 ms	328 KB	Output is partially correct
47	Partially correct	6 ms	316 KB	Output is partially correct
48	Partially correct	5 ms	328 KB	Output is partially correct
49	Partially correct	7 ms	316 KB	Output is partially correct
50	Partially correct	7 ms	336 KB	Output is partially correct
51	Partially correct	6 ms	308 KB	Output is partially correct
52	Partially correct	6 ms	316 KB	Output is partially correct
53	Partially correct	7 ms	336 KB	Output is partially correct
54	Partially correct	6 ms	208 KB	Output is partially correct
55	Partially correct	6 ms	328 KB	Output is partially correct
56	Partially correct	6 ms	208 KB	Output is partially correct
57	Partially correct	7 ms	320 KB	Output is partially correct
58	Partially correct	7 ms	208 KB	Output is partially correct
59	Partially correct	6 ms	324 KB	Output is partially correct
60	Partially correct	6 ms	320 KB	Output is partially correct
61	Partially correct	8 ms	208 KB	Output is partially correct
62	Correct	0 ms	208 KB	Output is correct
63	Correct	0 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	1 ms	208 KB	Output is correct
68	Correct	0 ms	208 KB	Output is correct
69	Correct	0 ms	208 KB	Output is correct
70	Correct	0 ms	208 KB	Output is correct
71	Correct	0 ms	208 KB	Output is correct
72	Correct	0 ms	284 KB	Output is correct
73	Correct	0 ms	208 KB	Output is correct
74	Correct	0 ms	208 KB	Output is correct
75	Correct	0 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	0 ms	208 KB	Output is correct
80	Correct	1 ms	208 KB	Output is correct
81	Correct	1 ms	208 KB	Output is correct
82	Correct	0 ms	208 KB	Output is correct
83	Correct	1 ms	208 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	1 ms	208 KB	Output is correct
89	Correct	0 ms	208 KB	Output is correct
90	Correct	1 ms	208 KB	Output is correct
91	Correct	1 ms	208 KB	Output is correct