답안 #1032368

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1032368	2024-07-23T16:17:21 Z	hotboy2703	버섯 세기 (IOI20_mushrooms)	C++17	98.69 / 100	6 ms	616 KB

mushrooms

#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL<<(i))
ll use(vector <ll> tmp){
	// for (auto x:tmp)cout<<x<<' ';
	// cout<<endl;
	return use_machine(tmp);
}
int count_mushrooms(int n) {
	if (n<=5){
		ll res = 1;
		for (ll i = 1;i < n;i ++)if (use({0,i})==0)res++;
		return res;
	}
	vector <ll> c[2];
	c[0].push_back(0);
	c[use({0,1})].push_back(1);
	c[use({0,2})].push_back(2);
	{
		ll id = 0;
		if (sz(c[1]) > sz(c[0]))id = 1;
		ll tmp = use({3,c[id][0],4,c[id][1]});
		c[id ^ (tmp%2)].push_back(3);
		c[id ^ (tmp/2)].push_back(4);
	}
	// for (auto x:c[0])cout<<x<<' ';
	// cout<<'\n';
	// for (auto x:c[1])cout<<x<<' ';
	// cout<<'\n';
	ll ptr = 5;
	ll res = 0;
	while (ptr < n){
		if (max(sz(c[0]),sz(c[1])) >= 80){
			ll id = 0;
			if (sz(c[1]) > sz(c[0]))id = 1;
			vector <ll> tmp;
			for (ll j = 0;j < sz(c[id]) && ptr < n;j ++,ptr++){
				tmp.push_back(c[id][j]);
				tmp.push_back(ptr);
			}
			ll cur = use(tmp);
			if (cur%2)c[1-id].push_back(tmp.back());
			else c[id].push_back(tmp.back());
			if (id==1)res += cur/2;
			else res += sz(tmp)/2 - (cur/2+1);
		}
		else{
			ll id = 0;
			if (sz(c[1]) > sz(c[0]))id = 1;
			if (ptr + 4 < n){
				ll tmp = use({ptr,c[id][0],ptr+1,c[id][1],ptr+2,c[id][2]});
				c[id^BIT(tmp,0)].push_back(ptr);
				tmp-=tmp%2;
				// cout<<tmp<<endl;
				if (tmp==2){
					if (sz(c[1-id]) < 2){
						tmp = use({ptr+1,c[id][0],ptr+2,c[id][1]});
						c[id ^ BIT(tmp,0)].push_back(ptr+1);
						c[id ^ BIT(tmp,1)].push_back(ptr+2);
						ptr+=3;
					}
					else{
						tmp = use({c[!id][0],ptr+1,c[!id][1],c[id][0],ptr+2,c[id][1],ptr+3,c[id][2],ptr+4});
						tmp--;
						// cout<<ptr<<' '<<tmp<<' '<<id<<endl;
						c[id^BIT(tmp,0)].push_back(ptr+4);
						c[id^BIT(tmp,1)].push_back(ptr+3);
						c[id^BIT(tmp,2)].push_back(ptr+2);
						c[1^id^BIT(tmp,2)].push_back(ptr+1);
						ptr+=5;
					}
				}
				else{
					c[id^(tmp>0)].push_back(ptr+1);
					c[id^(tmp>0)].push_back(ptr+2);
					ptr+=3;
				}
			}
			else if (ptr + 1 < n){
				ll tmp = use({ptr,c[id][0],ptr+1,c[id][1]});
				c[id ^ BIT(tmp,0)].push_back(ptr);
				c[id ^ BIT(tmp,1)].push_back(ptr+1);
				ptr+=2;
			}
			else{
				c[use({0,ptr})].push_back(ptr);
				ptr++;
			}
		}
	}
	// for (auto x:c[0])cout<<x<<' ';
	// cout<<'\n';
	// for (auto x:c[1])cout<<x<<' ';
	// cout<<'\n';
	res += sz(c[0]);
	return res;
}

Subtask #1

98.69 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	2 ms	344 KB	Output is correct
7	Correct	3 ms	344 KB	Output is correct
8	Correct	4 ms	600 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	5 ms	488 KB	Output is correct
11	Correct	4 ms	472 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	6 ms	600 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Correct	6 ms	344 KB	Output is correct
16	Correct	3 ms	444 KB	Output is correct
17	Correct	2 ms	472 KB	Output is correct
18	Correct	3 ms	600 KB	Output is correct
19	Correct	6 ms	344 KB	Output is correct
20	Correct	6 ms	344 KB	Output is correct
21	Correct	6 ms	480 KB	Output is correct
22	Correct	3 ms	344 KB	Output is correct
23	Correct	4 ms	600 KB	Output is correct
24	Correct	3 ms	600 KB	Output is correct
25	Correct	6 ms	452 KB	Output is correct
26	Correct	5 ms	452 KB	Output is correct
27	Correct	3 ms	464 KB	Output is correct
28	Correct	4 ms	344 KB	Output is correct
29	Correct	3 ms	476 KB	Output is correct
30	Correct	6 ms	344 KB	Output is correct
31	Correct	3 ms	484 KB	Output is correct
32	Correct	4 ms	344 KB	Output is correct
33	Partially correct	3 ms	436 KB	Output is partially correct
34	Partially correct	6 ms	344 KB	Output is partially correct
35	Correct	3 ms	340 KB	Output is correct
36	Correct	5 ms	600 KB	Output is correct
37	Partially correct	4 ms	344 KB	Output is partially correct
38	Partially correct	4 ms	464 KB	Output is partially correct
39	Correct	6 ms	344 KB	Output is correct
40	Correct	6 ms	344 KB	Output is correct
41	Correct	5 ms	600 KB	Output is correct
42	Correct	5 ms	476 KB	Output is correct
43	Correct	4 ms	600 KB	Output is correct
44	Partially correct	3 ms	344 KB	Output is partially correct
45	Partially correct	5 ms	344 KB	Output is partially correct
46	Partially correct	3 ms	344 KB	Output is partially correct
47	Partially correct	3 ms	344 KB	Output is partially correct
48	Partially correct	3 ms	340 KB	Output is partially correct
49	Partially correct	3 ms	344 KB	Output is partially correct
50	Correct	3 ms	344 KB	Output is correct
51	Partially correct	3 ms	344 KB	Output is partially correct
52	Partially correct	3 ms	344 KB	Output is partially correct
53	Correct	5 ms	484 KB	Output is correct
54	Correct	5 ms	616 KB	Output is correct
55	Partially correct	3 ms	340 KB	Output is partially correct
56	Partially correct	4 ms	344 KB	Output is partially correct
57	Partially correct	6 ms	344 KB	Output is partially correct
58	Correct	6 ms	600 KB	Output is correct
59	Partially correct	4 ms	472 KB	Output is partially correct
60	Correct	4 ms	436 KB	Output is correct
61	Partially correct	4 ms	600 KB	Output is partially correct
62	Correct	0 ms	344 KB	Output is correct
63	Correct	0 ms	344 KB	Output is correct
64	Correct	0 ms	344 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	1 ms	344 KB	Output is correct
67	Correct	0 ms	344 KB	Output is correct
68	Correct	1 ms	344 KB	Output is correct
69	Correct	0 ms	344 KB	Output is correct
70	Correct	0 ms	344 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	0 ms	344 KB	Output is correct
73	Correct	0 ms	344 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	0 ms	348 KB	Output is correct
76	Correct	0 ms	344 KB	Output is correct
77	Correct	0 ms	344 KB	Output is correct
78	Correct	1 ms	344 KB	Output is correct
79	Correct	0 ms	344 KB	Output is correct
80	Correct	1 ms	344 KB	Output is correct
81	Correct	0 ms	344 KB	Output is correct
82	Correct	0 ms	344 KB	Output is correct
83	Correct	1 ms	344 KB	Output is correct
84	Correct	0 ms	344 KB	Output is correct
85	Correct	0 ms	344 KB	Output is correct
86	Correct	0 ms	344 KB	Output is correct
87	Correct	0 ms	344 KB	Output is correct
88	Correct	0 ms	344 KB	Output is correct
89	Correct	0 ms	344 KB	Output is correct
90	Correct	0 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct