답안 #1072237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1072237	2024-08-23T15:52:24 Z	Itamar	버섯 세기 (IOI20_mushrooms)	C++14	34.6095 / 100	83 ms	992 KB

mushrooms

using namespace std;
#include <vector>
#define ll long long
#define vll vector<ll>
#include<iostream>
#define vi vector<int>
int use_machine(std::vector<int> x);
#include<bitset>
	const int k = 15;
int count_mushrooms(int n) {
	vi v[2];
	v[0].push_back(0);
	/*v[use_machine({0,1})].push_back(1);
	if(n==2)return v[0].size();
	v[use_machine({0,2})].push_back(2);
	if(n == 3)return v[0].size();
	int i1,i2;*/
	int ans = 0;
	bool f;

	int sq = min(n-1,320);
	int m= 1;
	
	for(int i = 1; i+k-2 < sq; i+=k-1){
		vector<bitset<k>> b;
		for(int j = 0; j < (1<<k); j+=2){
			bitset<k> bb = j;
			b.push_back(bb);
		}
		bitset<(1<<(k-1))>pos;for(int i = 0; i < 1<<(k-1); i++)pos[i]=1;
		vi ind = {0}; for(int j = i; j < i+k-1; j++)ind.push_back(j);
		while(pos.count()>1){
			vi vec;
			vi r;
			for(int j = 0; j < k; j++)if(rand()%2)r.push_back(j);
			for(int i : r)vec.push_back(ind[i]);
			int c = use_machine(vec);
			for(int j = 0; j < (1<<(k-1)); j++){
				int cc = 0;
				for(int t= 0; t < vec.size()-1; t++){
					cc+=(b[j][r[t]]^b[j][r[t+1]]);
				}
				if(cc!=c)pos[j]=0;
			}
		}
		for(int j = 0; j < (1<<(k-1)); j++){
			if(pos[j]){
				for(int t=  1; t < k; t++){
					v[(b[j][t])].push_back(ind[t]);
				}
			}
		}
		m = i+k-1;
	}

	ans = v[0].size();
	f = (v[1].size() > v[0].size());
	int s = v[f].size();
	for(int i = m; i < n; i+=s){
		int j = min(n-1, i+s-1);
		vi q;
		for(int k = i; k <= j; k++){
			q.push_back(k);
			q.push_back(v[f][k-i]);
		}
		int c = use_machine(q);
		if(!f){
			ans += q.size()/2;
			ans -= (c/2);
			ans -= (c%2);
		}else{
			ans += c/2;
			ans+=c%2;
		}
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:40:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int t= 0; t < vec.size()-1; t++){
      |                   ~~^~~~~~~~~~~~~~

Subtask #1

34.6095 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	3 ms	600 KB	Output is correct
5	Correct	33 ms	992 KB	Output is correct
6	Partially correct	62 ms	624 KB	Output is partially correct
7	Correct	22 ms	632 KB	Output is correct
8	Correct	21 ms	716 KB	Output is correct
9	Correct	26 ms	896 KB	Output is correct
10	Partially correct	49 ms	624 KB	Output is partially correct
11	Partially correct	49 ms	740 KB	Output is partially correct
12	Partially correct	53 ms	624 KB	Output is partially correct
13	Partially correct	35 ms	636 KB	Output is partially correct
14	Partially correct	44 ms	632 KB	Output is partially correct
15	Partially correct	51 ms	712 KB	Output is partially correct
16	Partially correct	47 ms	880 KB	Output is partially correct
17	Partially correct	40 ms	844 KB	Output is partially correct
18	Partially correct	34 ms	632 KB	Output is partially correct
19	Partially correct	40 ms	624 KB	Output is partially correct
20	Partially correct	41 ms	712 KB	Output is partially correct
21	Partially correct	41 ms	908 KB	Output is partially correct
22	Partially correct	46 ms	712 KB	Output is partially correct
23	Partially correct	38 ms	640 KB	Output is partially correct
24	Partially correct	48 ms	628 KB	Output is partially correct
25	Partially correct	44 ms	632 KB	Output is partially correct
26	Partially correct	44 ms	628 KB	Output is partially correct
27	Partially correct	39 ms	628 KB	Output is partially correct
28	Partially correct	54 ms	712 KB	Output is partially correct
29	Partially correct	51 ms	888 KB	Output is partially correct
30	Partially correct	45 ms	864 KB	Output is partially correct
31	Partially correct	45 ms	632 KB	Output is partially correct
32	Partially correct	57 ms	712 KB	Output is partially correct
33	Partially correct	57 ms	680 KB	Output is partially correct
34	Partially correct	42 ms	632 KB	Output is partially correct
35	Partially correct	56 ms	628 KB	Output is partially correct
36	Partially correct	45 ms	620 KB	Output is partially correct
37	Partially correct	39 ms	712 KB	Output is partially correct
38	Partially correct	53 ms	676 KB	Output is partially correct
39	Partially correct	51 ms	732 KB	Output is partially correct
40	Partially correct	47 ms	628 KB	Output is partially correct
41	Partially correct	83 ms	624 KB	Output is partially correct
42	Partially correct	58 ms	632 KB	Output is partially correct
43	Partially correct	48 ms	676 KB	Output is partially correct
44	Partially correct	45 ms	632 KB	Output is partially correct
45	Partially correct	55 ms	628 KB	Output is partially correct
46	Partially correct	54 ms	696 KB	Output is partially correct
47	Partially correct	39 ms	628 KB	Output is partially correct
48	Partially correct	42 ms	872 KB	Output is partially correct
49	Partially correct	60 ms	676 KB	Output is partially correct
50	Partially correct	49 ms	628 KB	Output is partially correct
51	Partially correct	58 ms	680 KB	Output is partially correct
52	Partially correct	52 ms	616 KB	Output is partially correct
53	Partially correct	42 ms	632 KB	Output is partially correct
54	Partially correct	48 ms	636 KB	Output is partially correct
55	Partially correct	57 ms	748 KB	Output is partially correct
56	Partially correct	45 ms	632 KB	Output is partially correct
57	Partially correct	54 ms	632 KB	Output is partially correct
58	Partially correct	51 ms	712 KB	Output is partially correct
59	Partially correct	47 ms	628 KB	Output is partially correct
60	Partially correct	45 ms	760 KB	Output is partially correct
61	Partially correct	50 ms	880 KB	Output is partially correct
62	Correct	0 ms	340 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	0 ms	344 KB	Output is correct
67	Correct	0 ms	344 KB	Output is correct
68	Correct	0 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	340 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	344 KB	Output is correct
75	Correct	1 ms	344 KB	Output is correct
76	Correct	0 ms	344 KB	Output is correct
77	Correct	0 ms	344 KB	Output is correct
78	Correct	0 ms	344 KB	Output is correct
79	Correct	0 ms	344 KB	Output is correct
80	Correct	0 ms	344 KB	Output is correct
81	Correct	0 ms	344 KB	Output is correct
82	Correct	1 ms	344 KB	Output is correct
83	Correct	0 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	340 KB	Output is correct