oj.uz

Submission #308432

# Submission time Handle Problem Language Result Execution time Memory
308432 2020-10-01T06:45:41 Z CodePlatina Counting Mushrooms (IOI20_mushrooms) C++14
92.2449 / 100
 10 ms 560 KB 
#include "mushrooms.h"
#include <vector>

using namespace std;

const int K = 90;

int count_mushrooms(int n)
{
    if(n <= 452)
    {
        int ret = 1;
        for(int i = 1; i < n; i += 2)
        {
            if(i == n - 1) ret += 1 - use_machine({0, i});
            else ret += 2 - use_machine({i, 0, i + 1});
        }
        return ret;
    }
    else
    {
        int ret = 0;
        vector<int> A, B, C;
        A.push_back(0);
        for(int i = 1; i < n; ++i) C.push_back(i);
        while(A.size() < K && B.size() < K)
        {
            if(A.size() >= 2)
            {
                int x = C.back(); C.pop_back();
                int y = C.back(); C.pop_back();
                int t = use_machine({A[0], x, A[1], y});
                if(t & 1) B.push_back(y);
                else A.push_back(y);
                if(t / 2) B.push_back(x);
                else A.push_back(x);
            }
            else if(B.size() >= 2)
            {
                int x = C.back(); C.pop_back();
                int y = C.back(); C.pop_back();
                int t = use_machine({B[0], x, B[1], y});
                if(t & 1) A.push_back(y);
                else B.push_back(y);
                if(t / 2) A.push_back(x);
                else B.push_back(x);
            }
            else
            {
                int x = C.back(); C.pop_back();
                int t = use_machine({A[0], x});
                if(t) B.push_back(x);
                else A.push_back(x);
            }
        }
        while(C.size())
        {
            if(A.size() >= B.size())
            {
                int cnt = -1;
                vector<int> tmp;
                for(int i = 0; (int)C.size() && i < (int)A.size(); ++i)
                {
                    ++cnt;
                    tmp.push_back(A[i]);
                    tmp.push_back(C.back());
                    C.pop_back();
                }
                int t = use_machine(tmp);
                if(t & 1) --t, B.push_back(tmp.back());
                else A.push_back(tmp.back());
                ret += cnt - t / 2;
            }
            else
            {
                int cnt = -1;
                vector<int> tmp;
                for(int i = 0; (int)C.size() && i < (int)B.size(); ++i)
                {
                    ++cnt;
                    tmp.push_back(B[i]);
                    tmp.push_back(C.back());
                    C.pop_back();
                }
                int t = use_machine(tmp);
                if(t & 1) --t, A.push_back(tmp.back());
                else B.push_back(tmp.back());
                ret += t / 2;
            }
        }
        return ret + A.size();
    }
}

Subtask #1
92.2449 / 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 0 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 8 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Partially correct 7 ms 512 KB Output is partially correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Partially correct 7 ms 512 KB Output is partially correct
16 Partially correct 7 ms 512 KB Output is partially correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Partially correct 7 ms 512 KB Output is partially correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Partially correct 7 ms 512 KB Output is partially correct
23 Correct 9 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Partially correct 7 ms 512 KB Output is partially correct
26 Partially correct 8 ms 512 KB Output is partially correct
27 Partially correct 7 ms 512 KB Output is partially correct
28 Partially correct 7 ms 512 KB Output is partially correct
29 Partially correct 6 ms 512 KB Output is partially correct
30 Partially correct 6 ms 512 KB Output is partially correct
31 Partially correct 7 ms 512 KB Output is partially correct
32 Partially correct 7 ms 512 KB Output is partially correct
33 Partially correct 7 ms 512 KB Output is partially correct
34 Partially correct 6 ms 512 KB Output is partially correct
35 Partially correct 7 ms 512 KB Output is partially correct
36 Partially correct 7 ms 512 KB Output is partially correct
37 Partially correct 7 ms 512 KB Output is partially correct
38 Partially correct 7 ms 512 KB Output is partially correct
39 Partially correct 7 ms 512 KB Output is partially correct
40 Partially correct 7 ms 512 KB Output is partially correct
41 Partially correct 7 ms 512 KB Output is partially correct
42 Partially correct 9 ms 512 KB Output is partially correct
43 Partially correct 8 ms 512 KB Output is partially correct
44 Partially correct 6 ms 512 KB Output is partially correct
45 Partially correct 7 ms 560 KB Output is partially correct
46 Partially correct 8 ms 512 KB Output is partially correct
47 Partially correct 6 ms 512 KB Output is partially correct
48 Partially correct 7 ms 512 KB Output is partially correct
49 Partially correct 6 ms 512 KB Output is partially correct
50 Partially correct 7 ms 512 KB Output is partially correct
51 Partially correct 9 ms 512 KB Output is partially correct
52 Partially correct 7 ms 512 KB Output is partially correct
53 Partially correct 8 ms 512 KB Output is partially correct
54 Partially correct 9 ms 512 KB Output is partially correct
55 Partially correct 10 ms 512 KB Output is partially correct
56 Partially correct 8 ms 512 KB Output is partially correct
57 Partially correct 6 ms 512 KB Output is partially correct
58 Partially correct 7 ms 512 KB Output is partially correct
59 Partially correct 7 ms 512 KB Output is partially correct
60 Partially correct 6 ms 512 KB Output is partially correct
61 Partially correct 7 ms 512 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 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 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 0 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 0 ms 256 KB Output is correct
87 Correct 0 ms 256 KB Output is correct
88 Correct 0 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