Submission #605065

# Submission time Handle Problem Language Result Execution time Memory
605065 2022-07-25T12:41:44 Z SamAnd Counting Mushrooms (IOI20_mushrooms) C++17
92.2449 / 100
12 ms 464 KB
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define m_p make_pair
typedef long long ll;
mt19937 rnf(234);
const int M = 160;

int count_mushrooms(int n)
{
    vector<int> v;
    for (int i = 1; i < min(n, M); ++i)
        v.push_back(i);

    vector<int> a;
    vector<int> b;
    a.push_back(0);
    while (!v.empty())
    {
        if (sz(v) == 1 || (max(sz(a), sz(b)) < 2))
        {
            int q = use_machine({0, v.back()});
            if (q == 0)
                a.push_back(v.back());
            else
                b.push_back(v.back());
            v.pop_back();
            continue;
        }
        if (sz(a) >= 2)
        {
            int q = use_machine({a[0], v[0], a[1], v[1]});
            if (q == 0)
            {
                a.push_back(v[0]);
                a.push_back(v[1]);
            }
            else if (q == 3)
            {
                b.push_back(v[0]);
                b.push_back(v[1]);
            }
            else if (q == 1)
            {
                a.push_back(v[0]);
                b.push_back(v[1]);
            }
            else if (q == 2)
            {
                b.push_back(v[0]);
                a.push_back(v[1]);
            }
        }
        else
        {
            int q = use_machine({b[0], v[0], b[1], v[1]});
            if (q == 0)
            {
                b.push_back(v[0]);
                b.push_back(v[1]);
            }
            else if (q == 3)
            {
                a.push_back(v[0]);
                a.push_back(v[1]);
            }
            else if (q == 1)
            {
                b.push_back(v[0]);
                a.push_back(v[1]);
            }
            else if (q == 2)
            {
                a.push_back(v[0]);
                b.push_back(v[1]);
            }
        }
        reverse(all(v));
        v.pop_back();
        v.pop_back();
    }

    int ans = sz(a);

    for (int i = M; i < n; ++i)
        v.push_back(i);
    while (!v.empty())
    {
        if (sz(a) > sz(b))
        {
            if (sz(v) <= sz(a))
            {
                vector<int> x;
                for (int i = 0; i < sz(v); ++i)
                {
                    x.push_back(a[i]);
                    x.push_back(v[i]);
                }
                int q = use_machine(x);
                ans += (sz(v) - 1 - q / 2);
                if (q % 2 == 0)
                {
                    ++ans;
                    a.push_back(v.back());
                }
                else
                {
                    b.push_back(v.back());
                }
                v.clear();
            }
            else
            {
                vector<int> u;
                for (int i = 0; i < sz(a); ++i)
                {
                    u.push_back(v.back());
                    v.pop_back();
                }

                vector<int> x;
                for (int i = 0; i < sz(u); ++i)
                {
                    x.push_back(a[i]);
                    x.push_back(u[i]);
                }
                int q = use_machine(x);
                ans += (sz(u) - 1 - q / 2);
                if (q % 2 == 0)
                {
                    ++ans;
                    a.push_back(u.back());
                }
                else
                {
                    b.push_back(u.back());
                }
                u.clear();
            }
        }
        else
        {
            if (sz(v) <= sz(b))
            {
                vector<int> x;
                for (int i = 0; i < sz(v); ++i)
                {
                    x.push_back(b[i]);
                    x.push_back(v[i]);
                }
                int q = use_machine(x);
                ans += q / 2;
                if (q % 2 == 0)
                {
                    b.push_back(v.back());
                }
                else
                {
                    ++ans;
                    a.push_back(v.back());
                }
                v.clear();
            }
            else
            {
                vector<int> u;
                for (int i = 0; i < sz(b); ++i)
                {
                    u.push_back(v.back());
                    v.pop_back();
                }

                vector<int> x;
                for (int i = 0; i < sz(u); ++i)
                {
                    x.push_back(b[i]);
                    x.push_back(u[i]);
                }
                int q = use_machine(x);
                ans += q / 2;
                if (q % 2 == 0)
                {
                    b.push_back(u.back());
                }
                else
                {
                    ++ans;
                    a.push_back(u.back());
                }
                u.clear();
            }
        }
    }

    return ans;
}
# Verdict Execution time Memory 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 6 ms 464 KB Output is correct
8 Correct 6 ms 440 KB Output is correct
9 Correct 8 ms 464 KB Output is correct
10 Correct 6 ms 464 KB Output is correct
11 Partially correct 12 ms 444 KB Output is partially correct
12 Correct 5 ms 444 KB Output is correct
13 Correct 8 ms 464 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Partially correct 7 ms 464 KB Output is partially correct
16 Partially correct 9 ms 464 KB Output is partially correct
17 Correct 4 ms 396 KB Output is correct
18 Correct 6 ms 436 KB Output is correct
19 Partially correct 8 ms 464 KB Output is partially correct
20 Correct 5 ms 440 KB Output is correct
21 Correct 6 ms 436 KB Output is correct
22 Partially correct 6 ms 444 KB Output is partially correct
23 Correct 6 ms 464 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Partially correct 7 ms 464 KB Output is partially correct
26 Partially correct 6 ms 464 KB Output is partially correct
27 Partially correct 5 ms 436 KB Output is partially correct
28 Partially correct 5 ms 436 KB Output is partially correct
29 Partially correct 6 ms 444 KB Output is partially correct
30 Partially correct 8 ms 464 KB Output is partially correct
31 Partially correct 8 ms 464 KB Output is partially correct
32 Partially correct 6 ms 464 KB Output is partially correct
33 Partially correct 6 ms 440 KB Output is partially correct
34 Partially correct 6 ms 440 KB Output is partially correct
35 Partially correct 6 ms 464 KB Output is partially correct
36 Partially correct 6 ms 464 KB Output is partially correct
37 Partially correct 7 ms 464 KB Output is partially correct
38 Partially correct 7 ms 436 KB Output is partially correct
39 Partially correct 6 ms 464 KB Output is partially correct
40 Partially correct 6 ms 464 KB Output is partially correct
41 Partially correct 9 ms 464 KB Output is partially correct
42 Partially correct 7 ms 464 KB Output is partially correct
43 Partially correct 7 ms 464 KB Output is partially correct
44 Partially correct 7 ms 464 KB Output is partially correct
45 Partially correct 7 ms 444 KB Output is partially correct
46 Partially correct 10 ms 440 KB Output is partially correct
47 Partially correct 7 ms 440 KB Output is partially correct
48 Partially correct 8 ms 464 KB Output is partially correct
49 Partially correct 10 ms 464 KB Output is partially correct
50 Partially correct 7 ms 464 KB Output is partially correct
51 Partially correct 8 ms 464 KB Output is partially correct
52 Partially correct 7 ms 440 KB Output is partially correct
53 Partially correct 7 ms 444 KB Output is partially correct
54 Partially correct 8 ms 464 KB Output is partially correct
55 Partially correct 9 ms 464 KB Output is partially correct
56 Partially correct 8 ms 440 KB Output is partially correct
57 Partially correct 7 ms 464 KB Output is partially correct
58 Partially correct 8 ms 460 KB Output is partially correct
59 Partially correct 7 ms 464 KB Output is partially correct
60 Partially correct 9 ms 464 KB Output is partially correct
61 Partially correct 5 ms 440 KB Output is partially correct
62 Correct 1 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 0 ms 300 KB Output is correct
69 Correct 1 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 208 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 0 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 216 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 0 ms 208 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 220 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct