Submission #303595

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
303595	2020-09-20T13:11:21 Z	jtnydv25	Counting Mushrooms (IOI20_mushrooms)	C++17	84.0149 / 100	849 ms	624 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
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 = 300;
 
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

84.0149 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	641 ms	388 KB	Output is correct
2	Correct	638 ms	512 KB	Output is correct
3	Correct	599 ms	504 KB	Output is correct
4	Correct	603 ms	496 KB	Output is correct
5	Correct	638 ms	380 KB	Output is correct
6	Correct	625 ms	520 KB	Output is correct
7	Correct	628 ms	384 KB	Output is correct
8	Correct	637 ms	492 KB	Output is correct
9	Correct	610 ms	376 KB	Output is correct
10	Correct	623 ms	368 KB	Output is correct
11	Partially correct	663 ms	384 KB	Output is partially correct
12	Partially correct	732 ms	516 KB	Output is partially correct
13	Correct	655 ms	404 KB	Output is correct
14	Correct	617 ms	376 KB	Output is correct
15	Partially correct	624 ms	384 KB	Output is partially correct
16	Partially correct	640 ms	408 KB	Output is partially correct
17	Correct	658 ms	372 KB	Output is correct
18	Correct	658 ms	388 KB	Output is correct
19	Partially correct	621 ms	412 KB	Output is partially correct
20	Partially correct	626 ms	372 KB	Output is partially correct
21	Partially correct	660 ms	392 KB	Output is partially correct
22	Partially correct	656 ms	364 KB	Output is partially correct
23	Correct	618 ms	368 KB	Output is correct
24	Correct	614 ms	380 KB	Output is correct
25	Partially correct	672 ms	412 KB	Output is partially correct
26	Partially correct	664 ms	376 KB	Output is partially correct
27	Partially correct	672 ms	372 KB	Output is partially correct
28	Partially correct	701 ms	408 KB	Output is partially correct
29	Partially correct	624 ms	500 KB	Output is partially correct
30	Partially correct	645 ms	368 KB	Output is partially correct
31	Partially correct	597 ms	380 KB	Output is partially correct
32	Partially correct	600 ms	420 KB	Output is partially correct
33	Partially correct	598 ms	412 KB	Output is partially correct
34	Partially correct	611 ms	492 KB	Output is partially correct
35	Partially correct	616 ms	376 KB	Output is partially correct
36	Partially correct	609 ms	504 KB	Output is partially correct
37	Partially correct	608 ms	624 KB	Output is partially correct
38	Partially correct	588 ms	496 KB	Output is partially correct
39	Partially correct	619 ms	416 KB	Output is partially correct
40	Partially correct	609 ms	516 KB	Output is partially correct
41	Partially correct	618 ms	376 KB	Output is partially correct
42	Partially correct	586 ms	432 KB	Output is partially correct
43	Partially correct	597 ms	376 KB	Output is partially correct
44	Partially correct	624 ms	368 KB	Output is partially correct
45	Partially correct	607 ms	376 KB	Output is partially correct
46	Partially correct	601 ms	504 KB	Output is partially correct
47	Partially correct	588 ms	504 KB	Output is partially correct
48	Partially correct	650 ms	508 KB	Output is partially correct
49	Partially correct	666 ms	412 KB	Output is partially correct
50	Partially correct	644 ms	396 KB	Output is partially correct
51	Partially correct	668 ms	496 KB	Output is partially correct
52	Partially correct	624 ms	376 KB	Output is partially correct
53	Partially correct	701 ms	412 KB	Output is partially correct
54	Partially correct	676 ms	504 KB	Output is partially correct
55	Partially correct	605 ms	492 KB	Output is partially correct
56	Partially correct	604 ms	404 KB	Output is partially correct
57	Partially correct	645 ms	376 KB	Output is partially correct
58	Partially correct	708 ms	408 KB	Output is partially correct
59	Partially correct	620 ms	504 KB	Output is partially correct
60	Correct	684 ms	504 KB	Output is correct
61	Correct	616 ms	392 KB	Output is correct
62	Correct	600 ms	520 KB	Output is correct
63	Correct	653 ms	376 KB	Output is correct
64	Correct	605 ms	364 KB	Output is correct
65	Correct	701 ms	372 KB	Output is correct
66	Correct	614 ms	364 KB	Output is correct
67	Correct	594 ms	364 KB	Output is correct
68	Correct	595 ms	376 KB	Output is correct
69	Correct	588 ms	392 KB	Output is correct
70	Correct	592 ms	376 KB	Output is correct
71	Correct	611 ms	376 KB	Output is correct
72	Correct	656 ms	376 KB	Output is correct
73	Correct	586 ms	400 KB	Output is correct
74	Correct	595 ms	376 KB	Output is correct
75	Correct	613 ms	380 KB	Output is correct
76	Correct	587 ms	396 KB	Output is correct
77	Correct	784 ms	392 KB	Output is correct
78	Correct	849 ms	388 KB	Output is correct
79	Correct	638 ms	388 KB	Output is correct
80	Correct	619 ms	376 KB	Output is correct
81	Correct	654 ms	364 KB	Output is correct
82	Correct	715 ms	376 KB	Output is correct
83	Correct	642 ms	396 KB	Output is correct
84	Correct	597 ms	376 KB	Output is correct
85	Correct	595 ms	376 KB	Output is correct
86	Correct	646 ms	496 KB	Output is correct
87	Correct	584 ms	388 KB	Output is correct
88	Correct	586 ms	416 KB	Output is correct
89	Correct	612 ms	500 KB	Output is correct
90	Correct	598 ms	392 KB	Output is correct
91	Correct	582 ms	504 KB	Output is correct