Submission #303757

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
303757	2020-09-20T15:45:14 Z	kylych03	Counting Mushrooms (IOI20_mushrooms)	C++14	92.2449 / 100	11 ms	532 KB

mushrooms

#include <bits/stdc++.h>
#include "mushrooms.h"
//#include "stub.cpp"
using namespace std;
int count_mushrooms(int n) {
	vector<int> m;
	vector <int> a,b;
	srand(time(0));
	for (int i = 0; i < n; i++)
		m.push_back(i);
    //random_shuffle(m.begin()+1, m.end());
    int cnt = 0;
    int l=1;
    vector <int> vec1;
    vec1.push_back(0);
    vec1.push_back(m[1]);
    a.push_back(0);
    if(!use_machine(vec1))
    	a.push_back(m[1]);
    else
    	b.push_back(m[1]);
    vec1[1]=m[2];
	if(n>2)
    if(use_machine(vec1)==0)
    	a.push_back(m[2]);
    else
    	b.push_back(m[2]);
    l=3;
    
    while(l < n - 1 && max(a.size(), b.size()) <66 ){
    	vector <int> vec2;
		if(a.size() > 1){
    		vec2.push_back(a[0]);
			vec2.push_back(m[l]);
			vec2.push_back(a[1]);
			vec2.push_back(m[l+1]);
			int res = use_machine(vec2);
			if(res==0){
				a.push_back(m[l]);
				a.push_back(m[l+1]);
			}
			if(res==1){
				a.push_back(m[l]);
				b.push_back(m[l+1]);
			}	
			if(res==2){
				b.push_back(m[l]);
				a.push_back(m[l+1]);
			}
			if(res==3){
				b.push_back(m[l]);
				b.push_back(m[l+1]);
			}
			l=l+2;
		}
		else{
			vec2.push_back(b[0]);
			vec2.push_back(m[l]);
			vec2.push_back(b[1]);
			vec2.push_back(m[l+1]);
			int res = use_machine(vec2);
			if(res==3){
				a.push_back(m[l]);
				a.push_back(m[l+1]);
			}
			if(res==2){
				a.push_back(m[l]);
				b.push_back(m[l+1]);
			}	
			if(res==1){
				b.push_back(m[l]);
				a.push_back(m[l+1]);
			}
			if(res==0){
				b.push_back(m[l]);
				b.push_back(m[l+1]);
			}
			l=l+2;
		}	
    }
    cnt = a.size();
    while(l < n){
    	if(a.size()>= b.size()){
    		vector <int> vec;
    		for(int i = 0 ; i < a.size() && l<n; i++){
    			vec.push_back(a[i]);
    			vec.push_back(m[l]);
    			l++;
			}
			int res = use_machine(vec);
			if(res%2==1)
				b.push_back(vec[vec.size()-1]);
			else
				a.push_back(vec[vec.size()-1]);
			cnt +=(vec.size()/2 - (res+1)/2);
		}
		else{
			vector <int> vec;
    		for(int i = 0 ; i < b.size() && l<n; i++){
    			vec.push_back(b[i]);
    			vec.push_back(m[l]);
    			l++;
			}
			int res = use_machine(vec);
			if(res%2==0)
				b.push_back(vec[vec.size()-1]);
			else
				a.push_back(vec[vec.size()-1]);
			cnt +=((res+1)/2);
		}	
	}
	
	return cnt;
	
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:23:4: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   23 |  if(n>2)
      |    ^
mushrooms.cpp:85:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |       for(int i = 0 ; i < a.size() && l<n; i++){
      |                       ~~^~~~~~~~~~
mushrooms.cpp:99:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |       for(int i = 0 ; i < b.size() && l<n; i++){
      |                       ~~^~~~~~~~~~

Subtask #1

92.2449 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	11 ms	512 KB	Output is correct
8	Correct	11 ms	512 KB	Output is correct
9	Correct	8 ms	512 KB	Output is correct
10	Correct	8 ms	512 KB	Output is correct
11	Partially correct	9 ms	512 KB	Output is partially correct
12	Correct	9 ms	512 KB	Output is correct
13	Correct	9 ms	512 KB	Output is correct
14	Correct	6 ms	384 KB	Output is correct
15	Partially correct	8 ms	512 KB	Output is partially correct
16	Partially correct	9 ms	532 KB	Output is partially correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	7 ms	512 KB	Output is correct
19	Partially correct	9 ms	512 KB	Output is partially correct
20	Correct	8 ms	512 KB	Output is correct
21	Correct	9 ms	512 KB	Output is correct
22	Partially correct	10 ms	512 KB	Output is partially correct
23	Correct	10 ms	488 KB	Output is correct
24	Correct	5 ms	480 KB	Output is correct
25	Partially correct	9 ms	512 KB	Output is partially correct
26	Partially correct	9 ms	512 KB	Output is partially correct
27	Partially correct	9 ms	512 KB	Output is partially correct
28	Partially correct	9 ms	512 KB	Output is partially correct
29	Partially correct	10 ms	512 KB	Output is partially correct
30	Partially correct	9 ms	512 KB	Output is partially correct
31	Partially correct	10 ms	512 KB	Output is partially correct
32	Partially correct	9 ms	512 KB	Output is partially correct
33	Partially correct	7 ms	488 KB	Output is partially correct
34	Partially correct	11 ms	512 KB	Output is partially correct
35	Partially correct	11 ms	512 KB	Output is partially correct
36	Partially correct	9 ms	512 KB	Output is partially correct
37	Partially correct	9 ms	512 KB	Output is partially correct
38	Partially correct	10 ms	512 KB	Output is partially correct
39	Partially correct	9 ms	512 KB	Output is partially correct
40	Partially correct	7 ms	512 KB	Output is partially correct
41	Partially correct	9 ms	512 KB	Output is partially correct
42	Partially correct	8 ms	512 KB	Output is partially correct
43	Partially correct	8 ms	512 KB	Output is partially correct
44	Partially correct	10 ms	512 KB	Output is partially correct
45	Partially correct	9 ms	512 KB	Output is partially correct
46	Partially correct	8 ms	512 KB	Output is partially correct
47	Partially correct	7 ms	512 KB	Output is partially correct
48	Partially correct	11 ms	512 KB	Output is partially correct
49	Partially correct	9 ms	512 KB	Output is partially correct
50	Partially correct	10 ms	512 KB	Output is partially correct
51	Partially correct	11 ms	512 KB	Output is partially correct
52	Partially correct	10 ms	512 KB	Output is partially correct
53	Partially correct	9 ms	512 KB	Output is partially correct
54	Partially correct	10 ms	512 KB	Output is partially correct
55	Partially correct	10 ms	512 KB	Output is partially correct
56	Partially correct	7 ms	512 KB	Output is partially correct
57	Partially correct	10 ms	512 KB	Output is partially correct
58	Partially correct	10 ms	512 KB	Output is partially correct
59	Partially correct	10 ms	512 KB	Output is partially correct
60	Partially correct	10 ms	512 KB	Output is partially correct
61	Partially correct	10 ms	512 KB	Output is partially correct
62	Correct	0 ms	256 KB	Output is correct
63	Correct	1 ms	256 KB	Output is correct
64	Correct	0 ms	256 KB	Output is correct
65	Correct	0 ms	256 KB	Output is correct
66	Correct	0 ms	256 KB	Output is correct
67	Correct	1 ms	256 KB	Output is correct
68	Correct	1 ms	256 KB	Output is correct
69	Correct	0 ms	256 KB	Output is correct
70	Correct	1 ms	256 KB	Output is correct
71	Correct	1 ms	256 KB	Output is correct
72	Correct	1 ms	360 KB	Output is correct
73	Correct	0 ms	256 KB	Output is correct
74	Correct	1 ms	256 KB	Output is correct
75	Correct	1 ms	384 KB	Output is correct
76	Correct	1 ms	256 KB	Output is correct
77	Correct	0 ms	256 KB	Output is correct
78	Correct	1 ms	256 KB	Output is correct
79	Correct	1 ms	256 KB	Output is correct
80	Correct	1 ms	256 KB	Output is correct
81	Correct	1 ms	256 KB	Output is correct
82	Correct	1 ms	256 KB	Output is correct
83	Correct	0 ms	256 KB	Output is correct
84	Correct	1 ms	256 KB	Output is correct
85	Correct	0 ms	256 KB	Output is correct
86	Correct	1 ms	256 KB	Output is correct
87	Correct	0 ms	256 KB	Output is correct
88	Correct	1 ms	256 KB	Output is correct
89	Correct	1 ms	256 KB	Output is correct
90	Correct	0 ms	256 KB	Output is correct
91	Correct	0 ms	256 KB	Output is correct