oj.uz

Submission #621179

# Submission time Handle Problem Language Result Execution time Memory
621179 2022-08-03T13:36:27 Z KLPP Counting Mushrooms (IOI20_mushrooms) C++14
75.8389 / 100
 12 ms 324 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
typedef long long int lld;
int K;
int answer[1000];
int count_mushrooms(int n) {
	if(n<220){
		int ans=1;
		rep(i,1,n){
			vector<int> V;
			V.push_back(0);
			V.push_back(i);
			int u=use_machine(V);
			ans+=1-u;
		}
		return ans;
	}
	K=min(200,n-1);
	vector<int> zeros;
	vector<int> ones;
	answer[0]=0;
	zeros.push_back(0);
	rep(i,1,3){
		vector<int> V;
		V.push_back(0);
		V.push_back(i);
		int u=use_machine(V);
		answer[i]=u;
		if(u==1)ones.push_back(i);
		else zeros.push_back(i);
	}
	
	int x,y;
	if(zeros.size()>1)x=zeros[0],y=zeros[1];
	else x=ones[0],y=ones[1];
	rep(i,3,K+1){
		vector<int> V;
		V.push_back(x);
		V.push_back(i);
		V.push_back(y);
		V.push_back(i+1);
		int u=use_machine(V);
		answer[i]=u/2;
		if(answer[x])answer[i]^=1;
		answer[i+1]=u%2;
		if(answer[x])answer[i+1]^=1;
		if(answer[i]==1)ones.push_back(i);
		else zeros.push_back(i);
		if(answer[i+1]==1)ones.push_back(i+1);
		else zeros.push_back(i+1);
		i++;
	}
	int revert=false;
	if(zeros.size()<ones.size()){
		swap(zeros,ones);
		revert=true;
	}
	/*trav(a,ones)cout<<a<<" ";
	cout<<endl;
	trav(a,zeros)cout<<a<<" ";
	cout<<endl;*/
	vector<int> analyse;
	int cnt=0;
	int ans=0;
	rep(i,0,K+1)ans+=(answer[i]==0);
	rep(i,K+1,n){
		analyse.push_back(i);
		analyse.push_back(zeros[cnt]);
		//cout<<zeros[cnt]<<endl;
		cnt++;
		if(i==n-1 || cnt==zeros.size()){
			//cout<<cnt<<" "<<zeros.size()<<endl;
			int u=use_machine(analyse);
			
			if(u%2==1)u++;
			if(revert){
				ans+=u/2;
			}else{
				ans+=analyse.size()/2-u/2;
			}
			analyse.clear();
			cnt=0;
		}
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:74:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   if(i==n-1 || cnt==zeros.size()){
      |                ~~~^~~~~~~~~~~~~~

Subtask #1
75.8389 / 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 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 6 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Partially correct 6 ms 208 KB Output is partially correct
11 Partially correct 7 ms 208 KB Output is partially correct
12 Partially correct 7 ms 256 KB Output is partially correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Partially correct 8 ms 208 KB Output is partially correct
16 Partially correct 6 ms 208 KB Output is partially correct
17 Correct 3 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Partially correct 12 ms 208 KB Output is partially correct
20 Partially correct 8 ms 208 KB Output is partially correct
21 Partially correct 9 ms 208 KB Output is partially correct
22 Partially correct 6 ms 208 KB Output is partially correct
23 Partially correct 7 ms 312 KB Output is partially correct
24 Correct 4 ms 208 KB Output is correct
25 Partially correct 10 ms 208 KB Output is partially correct
26 Partially correct 7 ms 208 KB Output is partially correct
27 Partially correct 9 ms 208 KB Output is partially correct
28 Partially correct 6 ms 312 KB Output is partially correct
29 Partially correct 7 ms 208 KB Output is partially correct
30 Partially correct 9 ms 208 KB Output is partially correct
31 Partially correct 6 ms 208 KB Output is partially correct
32 Partially correct 8 ms 312 KB Output is partially correct
33 Partially correct 9 ms 208 KB Output is partially correct
34 Partially correct 9 ms 208 KB Output is partially correct
35 Partially correct 6 ms 208 KB Output is partially correct
36 Partially correct 7 ms 208 KB Output is partially correct
37 Partially correct 7 ms 324 KB Output is partially correct
38 Partially correct 7 ms 208 KB Output is partially correct
39 Partially correct 8 ms 208 KB Output is partially correct
40 Partially correct 6 ms 208 KB Output is partially correct
41 Partially correct 6 ms 208 KB Output is partially correct
42 Partially correct 7 ms 208 KB Output is partially correct
43 Partially correct 6 ms 208 KB Output is partially correct
44 Partially correct 7 ms 308 KB Output is partially correct
45 Partially correct 12 ms 312 KB Output is partially correct
46 Partially correct 9 ms 208 KB Output is partially correct
47 Partially correct 8 ms 208 KB Output is partially correct
48 Partially correct 8 ms 208 KB Output is partially correct
49 Partially correct 6 ms 208 KB Output is partially correct
50 Partially correct 8 ms 208 KB Output is partially correct
51 Partially correct 6 ms 208 KB Output is partially correct
52 Partially correct 7 ms 208 KB Output is partially correct
53 Partially correct 9 ms 208 KB Output is partially correct
54 Partially correct 7 ms 208 KB Output is partially correct
55 Partially correct 6 ms 208 KB Output is partially correct
56 Partially correct 6 ms 312 KB Output is partially correct
57 Partially correct 6 ms 208 KB Output is partially correct
58 Partially correct 7 ms 208 KB Output is partially correct
59 Partially correct 7 ms 208 KB Output is partially correct
60 Partially correct 6 ms 208 KB Output is partially correct
61 Partially correct 8 ms 308 KB Output is partially correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 0 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 268 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 1 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 1 ms 208 KB Output is correct
74 Correct 0 ms 208 KB Output is correct
75 Correct 0 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 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 0 ms 208 KB Output is correct
85 Correct 1 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 0 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct