Submission #306447

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
306447	2020-09-25T15:22:57 Z	SorahISA	Counting Mushrooms (IOI20_mushrooms)	C++17	91.8699 / 100	10 ms	512 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

int count_mushrooms(int n) {
    const int B = (int)floor(sqrt(2 * n + 0.5));
    vector<int> m{0};
    
    // cout << "Block size = " << B << "\n";
    
    if (n <= 227) {
        for (int i = 1; i < n; ++i) {
            m.eb(m.back() ^ use_machine({i-1, i}));
        }
        return n - accumulate(ALL(m), 0);
    }
    
    vector<int> tA{0}, tB;
    m.eb(m.back() ^ use_machine({0, 1}));
    m.back() ? tB.eb(1) : tA.eb(1);
    m.eb(m.back() ^ use_machine({1, 2}));
    m.back() ? tB.eb(2) : tA.eb(2);
    
    for (int i = 3; i < B; i += 2) {
        if (tA.size() >= 2) {
            int ret = use_machine({tA[0], i, tA[1], i + 1});
            ret & 2 ? tB.eb(i) : tA.eb(i);
            ret & 1 ? tB.eb(i + 1) : tA.eb(i + 1);
        }
        else {
            int ret = use_machine({tB[0], i, tB[1], i + 1});
            ret & 2 ? tA.eb(i) : tB.eb(i);
            ret & 1 ? tA.eb(i + 1) : tB.eb(i + 1);
        }
    }
    
    // cout << "tA : "; for (auto x : tA) cout << x << " "; cout << "\n";
    // cout << "tB : "; for (auto x : tB) cout << x << " "; cout << "\n";
    
    int ans = tA.size(), tok = B | 1;
    
    while (tok < n) {
        if (tA.size() >= tB.size()) {
            /// 0 x 0 x 0 x 0 ... 0 x 0 x ///
            int sz = tA.size();
            vector<int> tmp;
            for (int i = 0; i < sz and tok < n; ++i) {
                tmp.eb(tA[i]), tmp.eb(tok++);
            }
            int ret = use_machine(tmp);
            ans += tmp.size() / 2 - (ret + 1) / 2;
            if (~ret & 1) tA.eb(tok - 1);
            else          tB.eb(tok - 1);
        }
        else if (tB.size() > tA.size()) {
            /// 1 x 1 x 1 x 1 ... 1 x 1 x ///
            int sz = tB.size();
            vector<int> tmp;
            for (int i = 0; i < sz and tok < n; ++i) {
                tmp.eb(tB[i]), tmp.eb(tok++);
            }
            int ret = use_machine(tmp);
            ans += (ret + 1) / 2;
            if (ret & 1) tA.eb(tok - 1);
            else         tB.eb(tok - 1);
        }
    }
    
    return ans;
}

Subtask #1

91.8699 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	3 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	7 ms	384 KB	Output is correct
8	Correct	7 ms	384 KB	Output is correct
9	Correct	7 ms	384 KB	Output is correct
10	Correct	7 ms	256 KB	Output is correct
11	Partially correct	8 ms	384 KB	Output is partially correct
12	Correct	7 ms	256 KB	Output is correct
13	Correct	7 ms	384 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Partially correct	7 ms	256 KB	Output is partially correct
16	Partially correct	8 ms	256 KB	Output is partially correct
17	Correct	4 ms	372 KB	Output is correct
18	Correct	8 ms	384 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	7 ms	256 KB	Output is correct
22	Partially correct	6 ms	380 KB	Output is partially correct
23	Correct	9 ms	256 KB	Output is correct
24	Correct	4 ms	256 KB	Output is correct
25	Partially correct	10 ms	256 KB	Output is partially correct
26	Partially correct	10 ms	256 KB	Output is partially correct
27	Partially correct	7 ms	256 KB	Output is partially correct
28	Partially correct	8 ms	384 KB	Output is partially correct
29	Partially correct	7 ms	256 KB	Output is partially correct
30	Partially correct	7 ms	256 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	8 ms	384 KB	Output is partially correct
34	Partially correct	9 ms	256 KB	Output is partially correct
35	Partially correct	7 ms	380 KB	Output is partially correct
36	Partially correct	8 ms	256 KB	Output is partially correct
37	Partially correct	9 ms	384 KB	Output is partially correct
38	Partially correct	9 ms	256 KB	Output is partially correct
39	Partially correct	8 ms	256 KB	Output is partially correct
40	Partially correct	9 ms	512 KB	Output is partially correct
41	Partially correct	9 ms	256 KB	Output is partially correct
42	Partially correct	8 ms	256 KB	Output is partially correct
43	Partially correct	7 ms	256 KB	Output is partially correct
44	Partially correct	7 ms	256 KB	Output is partially correct
45	Partially correct	8 ms	256 KB	Output is partially correct
46	Partially correct	9 ms	384 KB	Output is partially correct
47	Partially correct	8 ms	256 KB	Output is partially correct
48	Partially correct	7 ms	256 KB	Output is partially correct
49	Partially correct	6 ms	380 KB	Output is partially correct
50	Partially correct	9 ms	384 KB	Output is partially correct
51	Partially correct	8 ms	384 KB	Output is partially correct
52	Partially correct	8 ms	256 KB	Output is partially correct
53	Partially correct	10 ms	384 KB	Output is partially correct
54	Partially correct	8 ms	256 KB	Output is partially correct
55	Partially correct	8 ms	256 KB	Output is partially correct
56	Partially correct	7 ms	256 KB	Output is partially correct
57	Partially correct	8 ms	256 KB	Output is partially correct
58	Partially correct	10 ms	384 KB	Output is partially correct
59	Partially correct	9 ms	384 KB	Output is partially correct
60	Partially correct	10 ms	256 KB	Output is partially correct
61	Partially correct	10 ms	384 KB	Output is partially correct
62	Correct	0 ms	256 KB	Output is correct
63	Correct	1 ms	256 KB	Output is correct
64	Correct	1 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	1 ms	256 KB	Output is correct
69	Correct	0 ms	256 KB	Output is correct
70	Correct	0 ms	256 KB	Output is correct
71	Correct	0 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	0 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	0 ms	256 KB	Output is correct
80	Correct	0 ms	256 KB	Output is correct
81	Correct	1 ms	256 KB	Output is correct
82	Correct	0 ms	256 KB	Output is correct
83	Correct	1 ms	256 KB	Output is correct
84	Correct	1 ms	256 KB	Output is correct
85	Correct	1 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	1 ms	256 KB	Output is correct
90	Correct	1 ms	256 KB	Output is correct
91	Correct	1 ms	256 KB	Output is correct