oj.uz

Submission #804767

# Submission time Handle Problem Language Result Execution time Memory
804767 2023-08-03T11:12:53 Z alvingogo Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
 7 ms 556 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

int count_mushrooms(int n) {
	if(n<=220){
		int ans=1;
		for(int i=1;i<n;i++){
			ans+=1-use_machine({0,i});
		}
		return ans;
	}
	int a=use_machine({0,1});
	int b=use_machine({0,2});
	vector<int> v[2];
	v[0].push_back(0);
	if(a){
		v[1].push_back(1);
	}
	else{
		v[0].push_back(1);
	}
	if(b){
		v[1].push_back(2);
	}
	else{
		v[0].push_back(2);
	}
	int r=3;
	for(;r<147;r+=2){
		int y=0;
		if(v[1].size()>=2){
			y=1;
		}
		int u34=use_machine({r,v[y][0],r+1,v[y][1]});
		if(u34%2==0){
			v[y].push_back(r);
		}
		else{
			v[y^1].push_back(r);
		}
		if(u34>=2){
			v[y^1].push_back(r+1);
		}
		else{
			v[y].push_back(r+1);
		}
	}
	int ans=0;
	while(r<n){
		int z=0;
		if(v[1].size()>v[0].size()){
			z=1;
		}
		int w=min(n,r+(int)v[z].size());
		vector<int> t;
		int s=0;
		for(int i=r;i<w;i++){
			t.push_back(i);
			t.push_back(v[z][i-r]);
			s++;
		}
		int u=use_machine(t);
		if(z==1){
			ans+=u/2;
		}
		else{
			ans+=s-(u/2)-1;
		}
		if(u%2==0){
			v[z].push_back(r);
		}
		else{
			v[z^1].push_back(r);
		}
		r=w;
	}
	ans+=v[0].size();
	return ans;
}

Subtask #1
92.623 / 100.0

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