oj.uz

Submission #306892

# Submission time Handle Problem Language Result Execution time Memory
306892 2020-09-26T13:52:37 Z ivan24 Counting Mushrooms (IOI20_mushrooms) C++14
25 / 100
 107 ms 744 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

using ll = int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second

class Solver{
private:
    ll n;
    vi type, ctr;
    vvi byType;

    void add_type(ll x, bool t){
        if (n <= x || type[x] != -1) return;
        type[x] = t;
        byType[t].push_back(x);
        ctr[t]++;
    }

    void addOne(ll x){
        ll res = use_machine(vi{0,x});
        add_type(x,res);
    }

    void addTwo(ll x, ll y){
        //cout << x << " " << y << endl;
        bool t = 0;
        if (byType[0].size() < 2){
            t = 1;
        }
        //cout << t << " " << byType[t].size() << endl;
        ll res = use_machine(vi{x,byType[t][0],y,byType[t][1]});
        add_type(x,(res&1) ? !t : t);
        add_type(y,(res&2) ? !t : t);
    }
public:
    Solver(ll n): n(n), type(n,-1), ctr(2,0), byType(2){
        type[0] = 0;
        ctr[0]++;
        byType[0].push_back(0);
    }

    int solve(){
        //cout << "hello\n";
        addOne(1);
        if (n > 2){
            addOne(2);
            for (ll i = 2; n > 2*i; i++){
                addTwo(2*i-1,2*i);
            }
            //cout << "hello\n";
            if (type[n-1] == -1){
                addOne(n-1);
            }
        }
        return ctr[0];
    }
};

int count_mushrooms(int n) {
    Solver mySolver(n);
    return mySolver.solve();
}

Subtask #1
25.0 / 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 1 ms 256 KB Output is correct
6 Partially correct 10 ms 384 KB Output is partially correct
7 Partially correct 107 ms 660 KB Output is partially correct
8 Partially correct 90 ms 632 KB Output is partially correct
9 Partially correct 96 ms 636 KB Output is partially correct
10 Partially correct 103 ms 508 KB Output is partially correct
11 Partially correct 90 ms 504 KB Output is partially correct
12 Partially correct 104 ms 504 KB Output is partially correct
13 Partially correct 94 ms 632 KB Output is partially correct
14 Partially correct 47 ms 384 KB Output is partially correct
15 Partially correct 95 ms 640 KB Output is partially correct
16 Partially correct 84 ms 504 KB Output is partially correct
17 Partially correct 51 ms 468 KB Output is partially correct
18 Partially correct 92 ms 632 KB Output is partially correct
19 Partially correct 86 ms 520 KB Output is partially correct
20 Partially correct 103 ms 512 KB Output is partially correct
21 Partially correct 67 ms 700 KB Output is partially correct
22 Partially correct 93 ms 632 KB Output is partially correct
23 Partially correct 94 ms 504 KB Output is partially correct
24 Partially correct 48 ms 504 KB Output is partially correct
25 Partially correct 93 ms 632 KB Output is partially correct
26 Partially correct 92 ms 504 KB Output is partially correct
27 Partially correct 81 ms 548 KB Output is partially correct
28 Partially correct 99 ms 504 KB Output is partially correct
29 Partially correct 99 ms 504 KB Output is partially correct
30 Partially correct 96 ms 504 KB Output is partially correct
31 Partially correct 94 ms 504 KB Output is partially correct
32 Partially correct 56 ms 612 KB Output is partially correct
33 Partially correct 88 ms 744 KB Output is partially correct
34 Partially correct 94 ms 504 KB Output is partially correct
35 Partially correct 92 ms 504 KB Output is partially correct
36 Partially correct 70 ms 624 KB Output is partially correct
37 Partially correct 99 ms 504 KB Output is partially correct
38 Partially correct 97 ms 504 KB Output is partially correct
39 Partially correct 98 ms 504 KB Output is partially correct
40 Partially correct 98 ms 504 KB Output is partially correct
41 Partially correct 87 ms 504 KB Output is partially correct
42 Partially correct 97 ms 504 KB Output is partially correct
43 Partially correct 85 ms 520 KB Output is partially correct
44 Partially correct 92 ms 632 KB Output is partially correct
45 Partially correct 79 ms 644 KB Output is partially correct
46 Partially correct 107 ms 504 KB Output is partially correct
47 Partially correct 98 ms 504 KB Output is partially correct
48 Partially correct 99 ms 592 KB Output is partially correct
49 Partially correct 84 ms 504 KB Output is partially correct
50 Partially correct 86 ms 504 KB Output is partially correct
51 Partially correct 90 ms 620 KB Output is partially correct
52 Partially correct 101 ms 632 KB Output is partially correct
53 Partially correct 96 ms 504 KB Output is partially correct
54 Partially correct 91 ms 504 KB Output is partially correct
55 Partially correct 97 ms 504 KB Output is partially correct
56 Partially correct 95 ms 504 KB Output is partially correct
57 Partially correct 103 ms 504 KB Output is partially correct
58 Partially correct 95 ms 504 KB Output is partially correct
59 Partially correct 80 ms 612 KB Output is partially correct
60 Partially correct 80 ms 524 KB Output is partially correct
61 Partially correct 92 ms 524 KB Output is partially correct
62 Correct 1 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 1 ms 256 KB Output is correct
66 Correct 0 ms 256 KB Output is correct
67 Correct 1 ms 256 KB Output is correct
68 Correct 0 ms 256 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 1 ms 256 KB Output is correct
74 Correct 1 ms 256 KB Output is correct
75 Correct 1 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 1 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 1 ms 256 KB Output is correct
81 Correct 1 ms 256 KB Output is correct
82 Correct 1 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 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 0 ms 256 KB Output is correct
89 Correct 1 ms 256 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct