oj.uz

Submission #306934

# Submission time Handle Problem Language Result Execution time Memory
306934 2020-09-26T14:38:08 Z ivan24 Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
 10 ms 584 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);
    }
    bool big_query (){
        bool t = ((byType[0].size() > byType[1].size()) ? 0 : 1);
        ll min_idx = ctr[0]+ctr[1];
        ll max_idx = min((int)min_idx + (int)byType[t].size()-1,n-1);
        ll sz = max_idx-min_idx+1;
        if (min_idx >= n) return false;

        vi v;
        for (ll i = min_idx; max_idx >= i && n > i; i++){
            v.push_back(i);
            v.push_back(byType[t][i-min_idx]);
        }
        /*
        cout << min_idx << " - " << max_idx << endl;
        for (auto i: v) cout << i << " ";
        cout << endl;
        */
        ll res = use_machine(v);
        if (res%2 == 1){
            res--;
            add_type(min_idx,!t);
        }else add_type(min_idx,t);

        ctr[!t] += res/2;
        ctr[t] += sz-1-res/2;
        return true;
    }
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 = 0; 80 > i && n > 2*i+4; i++){
                addTwo(2*i+3,2*i+4);
            }
            //cout << "hello\n";
            while(big_query()){}
        }
        return ctr[0];
    }
};

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

Subtask #1
92.623 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Partially correct 10 ms 384 KB Output is partially correct
12 Correct 10 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Partially correct 9 ms 384 KB Output is partially correct
16 Partially correct 9 ms 384 KB Output is partially correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 9 ms 384 KB Output is correct
19 Partially correct 8 ms 384 KB Output is partially correct
20 Correct 8 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Partially correct 9 ms 384 KB Output is partially correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Partially correct 8 ms 384 KB Output is partially correct
26 Partially correct 9 ms 384 KB Output is partially correct
27 Partially correct 9 ms 384 KB Output is partially correct
28 Partially correct 8 ms 384 KB Output is partially correct
29 Partially correct 8 ms 384 KB Output is partially correct
30 Partially correct 9 ms 384 KB Output is partially correct
31 Partially correct 8 ms 384 KB Output is partially correct
32 Partially correct 8 ms 384 KB Output is partially correct
33 Partially correct 8 ms 384 KB Output is partially correct
34 Partially correct 7 ms 384 KB Output is partially correct
35 Partially correct 9 ms 384 KB Output is partially correct
36 Partially correct 8 ms 384 KB Output is partially correct
37 Partially correct 8 ms 384 KB Output is partially correct
38 Partially correct 9 ms 384 KB Output is partially correct
39 Partially correct 7 ms 384 KB Output is partially correct
40 Partially correct 10 ms 384 KB Output is partially correct
41 Partially correct 8 ms 384 KB Output is partially correct
42 Partially correct 8 ms 384 KB Output is partially correct
43 Partially correct 9 ms 504 KB Output is partially correct
44 Partially correct 8 ms 384 KB Output is partially correct
45 Partially correct 8 ms 384 KB Output is partially correct
46 Partially correct 8 ms 504 KB Output is partially correct
47 Partially correct 10 ms 384 KB Output is partially correct
48 Partially correct 8 ms 384 KB Output is partially correct
49 Partially correct 8 ms 384 KB Output is partially correct
50 Partially correct 8 ms 384 KB Output is partially correct
51 Partially correct 8 ms 384 KB Output is partially correct
52 Partially correct 7 ms 584 KB Output is partially correct
53 Partially correct 8 ms 384 KB Output is partially correct
54 Partially correct 7 ms 456 KB Output is partially correct
55 Partially correct 8 ms 384 KB Output is partially correct
56 Partially correct 8 ms 384 KB Output is partially correct
57 Partially correct 7 ms 384 KB Output is partially correct
58 Partially correct 8 ms 384 KB Output is partially correct
59 Partially correct 8 ms 384 KB Output is partially correct
60 Partially correct 10 ms 384 KB Output is partially correct
61 Partially correct 7 ms 384 KB Output is partially correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 0 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 1 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 1 ms 256 KB Output is correct
74 Correct 1 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 1 ms 256 KB Output is correct
78 Correct 0 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 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 1 ms 256 KB Output is correct
86 Correct 1 ms 256 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 1 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct