Submission #1052258

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1052258	2024-08-10T12:50:07 Z	Huseyn123	Counting Mushrooms (IOI20_mushrooms)	C++17	80.427 / 100	6 ms	624 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h> 
using namespace std; 
mt19937 rng(552);
int count_mushrooms(int n) {
	vector<int> c;
	for(int i=1;i<n;i++){
		c.push_back(i);
	}
	shuffle(c.begin(),c.end(),rng);
	vector<int> v0,v1;
	v0.push_back(0);
	int cnt=0;
	int cnt1=0;
	int i=0;
	while(i<n-1){
		if((v0.size()<2 && v1.size()<2) || i==n-2){
			int h=use_machine({c[i],0});
			if(h==0){
				v0.push_back(c[i]);
			}
			else{
				v1.push_back(c[i]);
			}
			cnt=i+1;
			i++;
			cnt1++;
		}
		else{
			if(v0.size()>=2){
				int h=use_machine({v0[0],c[i],v0[1],c[i+1]});
				if(h==0){
					v0.push_back(c[i]); 
					v0.push_back(c[i+1]);
				}
				else if(h==1){
					v1.push_back(c[i+1]);
					v0.push_back(c[i]);
				}
				else if(h==2){
					v1.push_back(c[i]);
					v0.push_back(c[i+1]);
				}
				else{
					v1.push_back(c[i]); 
					v1.push_back(c[i+1]);
				}
			}
			else{
				int h=use_machine({v1[0],c[i],v1[1],c[i+1]});
				if(h==0){
					v1.push_back(c[i]); 
					v1.push_back(c[i+1]);
				}
				else if(h==1){
					v0.push_back(c[i+1]);
					v1.push_back(c[i]);
				}
				else if(h==2){
					v0.push_back(c[i]);
					v1.push_back(c[i+1]);
				}
				else{
					v0.push_back(c[i]); 
					v0.push_back(c[i+1]);
				}
			}
			cnt=i+2;
			i+=2;
			cnt1++;
		}
		int mx=max((int)v0.size(),(int)v1.size());
		if(mx>1 && cnt1+(n-cnt-1)/mx<=280){
			break;
		}
	}
	int res=(int)v0.size();
	vector<int> v=v0;
	int tp=0; 
	if((int)v1.size()>(int)v0.size()){
		tp=1;
		v=v1;
	}
	vector<int> d;
	for(int i=cnt;i<n-1;i++){
		d.push_back(v[(int)d.size()/2]);
		d.push_back(c[i]);
		if((int)d.size()==2*v.size()){
			int h=use_machine(d);
			int sz=(int)d.size();
			d.clear();
			if(tp){
				res+=h/2+h%2;
			}
			else{
				res+=sz/2-h/2-h%2;
			}
		}
	}
	if((int)d.size()>0){
		int h=use_machine(d);
		int sz=(int)d.size();
		d.clear();
		if(tp){
			res+=h/2+h%2;
		}
		else{
			res+=sz/2-h/2-h%2;
		}
	}
	return res; 
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:88:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |   if((int)d.size()==2*v.size()){
      |      ~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1

80.427 / 100.0

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