Submission #303581

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
303581	2020-09-20T13:02:46 Z	jtnydv25	Counting Mushrooms (IOI20_mushrooms)	C++17	25 / 100	850 ms	640 KB

mushrooms

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

#define ll long long
#define pii pair<int, int>
#define F first
#define S second
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())
#define ld long double

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<", "<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	for(int i = 0;i < (int)v.size(); i++){
		if(i)os<<", ";
		os<<v[i];
	}
	os<<"}";
	return os;
}

#ifdef LOCAL
#define cerr cout
#else
#endif

#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif



const int M = 8;

int val[200005];
struct node{
	vector<int> states;
	node* res[M];
	vector<int> ask;
	int maxQueries;
	node(){
		for(int i = 0; i < M; i++) res[i] = NULL;
		maxQueries = 0;
	}
	void compute(){
		int n = states.size();
		if(n == 1) return;
		maxQueries = 1;
		int mn = 1 << 20;
		for(int mask = 1; mask < (1 << M); mask++){
			vector<int> perm;
            for(int j = 0; j < M; j++) if(mask >> j & 1) perm.push_back(j);
            if(((int)perm.size()) == 1) continue;
            do{
                vector<int> num(M);
                for(int s : states){
                    int r = 0;
                    for(int j = 0; j + 1 < (int)perm.size(); j++) r += (s >> perm[j] & 1) != (s >> perm[j + 1] & 1);
                    num[r]++;
                }
                int V = *max_element(num.begin(), num.end());
                if(V < mn){
                    mn = V;
                    ask = perm;
                }
            }while(next_permutation(perm.begin(), perm.end()));
		}
        vector<int> perm = ask;

		vector<vector<int>> childStates(M);
		
        for(int s : states){
            int r = 0;
            for(int j = 0; j + 1 < (int)perm.size(); j++) r += (s >> perm[j] & 1) != (s >> perm[j + 1] & 1);
            childStates[r].push_back(s);
        }
		for(int i = 0; i < M; i++){
			if(!childStates[i].empty()){
				res[i] = new node();
				res[i]->states = childStates[i];
				res[i]->compute();
				maxQueries = max(maxQueries, res[i]->maxQueries + 1);
			}
		}
	}
    void get(vector<int> positions){
        if((int)states.size() == 1){
            for(int i = 0; i < M; i++) val[positions[i]] = states[0] >> i & 1;
            return;
        }

        vector<int> x;
        for(int i : ask) x.push_back(positions[i]);
        res[use_machine(x)]->get(positions);
    }
};

int get(int pos){
    return val[pos] = use_machine({0, pos});
}

struct decision_tree{
	node * root;
	decision_tree(){
		root = new node();
		for(int i = 0; i < (1 << M); i+=2) root->states.push_back(i);
		root->compute();
	}
    void get(vector<int> positions){
        root->get(positions);
    }
};

const int K = 6;

int count_mushrooms(int N) {
	decision_tree DT;
    // int n = min(N, K);
    int n = N;
    // for(int j = 1; j < N; j++) get(j);
    for(int i = 1; i < n; i += M - 1){
        int st = i, en = i + M - 2;
        if(en < n){
            vector<int> positions = {0};
            for(int j = st; j <= en; j++) positions.push_back(j);
            DT.get(positions);
        } else{
            for(int j = st; j < n; j++) get(j);
        }
    }

    int curr = n - accumulate(val, val + n, 0);
    if(n == N) return curr;
	vector<vector<int>> where(2);
    for(int i = 0; i < n; i++) where[val[i]].push_back(i);
    int id = (int)where[1].size() > (int) where[0].size();
    int R = where[id].size() - 1;
    for(int i = n; i < N; i += R){
        int st = i, en = min(N - 1, i + R - 1);
        vector<int> positions = {where[id][0]};
        for(int j = 0; j <= en - st; j++){
            positions.push_back(st + j);
            positions.push_back(where[id][j + 1]);
        }
        int V = use_machine(positions);
        assert(V % 2 == 0);
        V /= 2;
        if(id == 1) curr += V;
        else curr += en - st + 1 - V;
    }
    return curr;
}

Subtask #1

25.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	601 ms	376 KB	Output is correct
2	Correct	619 ms	384 KB	Output is correct
3	Correct	689 ms	384 KB	Output is correct
4	Correct	613 ms	372 KB	Output is correct
5	Correct	621 ms	484 KB	Output is correct
6	Partially correct	632 ms	412 KB	Output is partially correct
7	Partially correct	758 ms	508 KB	Output is partially correct
8	Partially correct	634 ms	376 KB	Output is partially correct
9	Partially correct	705 ms	500 KB	Output is partially correct
10	Partially correct	780 ms	544 KB	Output is partially correct
11	Partially correct	718 ms	440 KB	Output is partially correct
12	Partially correct	727 ms	504 KB	Output is partially correct
13	Partially correct	677 ms	564 KB	Output is partially correct
14	Partially correct	664 ms	360 KB	Output is partially correct
15	Partially correct	850 ms	504 KB	Output is partially correct
16	Partially correct	747 ms	380 KB	Output is partially correct
17	Partially correct	661 ms	500 KB	Output is partially correct
18	Partially correct	781 ms	516 KB	Output is partially correct
19	Partially correct	702 ms	376 KB	Output is partially correct
20	Partially correct	796 ms	504 KB	Output is partially correct
21	Partially correct	728 ms	624 KB	Output is partially correct
22	Partially correct	717 ms	388 KB	Output is partially correct
23	Partially correct	708 ms	376 KB	Output is partially correct
24	Partially correct	668 ms	368 KB	Output is partially correct
25	Partially correct	679 ms	484 KB	Output is partially correct
26	Partially correct	703 ms	480 KB	Output is partially correct
27	Partially correct	719 ms	624 KB	Output is partially correct
28	Partially correct	710 ms	480 KB	Output is partially correct
29	Partially correct	772 ms	376 KB	Output is partially correct
30	Partially correct	789 ms	492 KB	Output is partially correct
31	Partially correct	692 ms	380 KB	Output is partially correct
32	Partially correct	682 ms	484 KB	Output is partially correct
33	Partially correct	710 ms	524 KB	Output is partially correct
34	Partially correct	746 ms	376 KB	Output is partially correct
35	Partially correct	700 ms	376 KB	Output is partially correct
36	Partially correct	736 ms	412 KB	Output is partially correct
37	Partially correct	684 ms	464 KB	Output is partially correct
38	Partially correct	737 ms	376 KB	Output is partially correct
39	Partially correct	772 ms	496 KB	Output is partially correct
40	Partially correct	743 ms	484 KB	Output is partially correct
41	Partially correct	822 ms	456 KB	Output is partially correct
42	Partially correct	713 ms	488 KB	Output is partially correct
43	Partially correct	773 ms	500 KB	Output is partially correct
44	Partially correct	786 ms	580 KB	Output is partially correct
45	Partially correct	824 ms	384 KB	Output is partially correct
46	Partially correct	809 ms	464 KB	Output is partially correct
47	Partially correct	758 ms	476 KB	Output is partially correct
48	Partially correct	686 ms	484 KB	Output is partially correct
49	Partially correct	803 ms	372 KB	Output is partially correct
50	Partially correct	759 ms	504 KB	Output is partially correct
51	Partially correct	755 ms	376 KB	Output is partially correct
52	Partially correct	828 ms	640 KB	Output is partially correct
53	Partially correct	711 ms	380 KB	Output is partially correct
54	Partially correct	832 ms	496 KB	Output is partially correct
55	Partially correct	760 ms	384 KB	Output is partially correct
56	Partially correct	773 ms	416 KB	Output is partially correct
57	Partially correct	736 ms	504 KB	Output is partially correct
58	Partially correct	764 ms	368 KB	Output is partially correct
59	Partially correct	824 ms	504 KB	Output is partially correct
60	Partially correct	698 ms	456 KB	Output is partially correct
61	Partially correct	684 ms	480 KB	Output is partially correct
62	Correct	653 ms	364 KB	Output is correct
63	Correct	643 ms	368 KB	Output is correct
64	Correct	613 ms	496 KB	Output is correct
65	Correct	759 ms	376 KB	Output is correct
66	Correct	673 ms	388 KB	Output is correct
67	Correct	646 ms	384 KB	Output is correct
68	Correct	626 ms	384 KB	Output is correct
69	Correct	637 ms	492 KB	Output is correct
70	Correct	621 ms	392 KB	Output is correct
71	Correct	644 ms	368 KB	Output is correct
72	Correct	660 ms	380 KB	Output is correct
73	Correct	642 ms	388 KB	Output is correct
74	Correct	668 ms	380 KB	Output is correct
75	Correct	600 ms	392 KB	Output is correct
76	Correct	598 ms	508 KB	Output is correct
77	Correct	601 ms	504 KB	Output is correct
78	Correct	642 ms	500 KB	Output is correct
79	Correct	640 ms	492 KB	Output is correct
80	Correct	600 ms	496 KB	Output is correct
81	Correct	609 ms	504 KB	Output is correct
82	Correct	619 ms	384 KB	Output is correct
83	Correct	639 ms	496 KB	Output is correct
84	Correct	634 ms	400 KB	Output is correct
85	Correct	606 ms	368 KB	Output is correct
86	Correct	616 ms	500 KB	Output is correct
87	Correct	650 ms	396 KB	Output is correct
88	Correct	614 ms	376 KB	Output is correct
89	Correct	628 ms	376 KB	Output is correct
90	Correct	598 ms	364 KB	Output is correct
91	Correct	671 ms	376 KB	Output is correct