oj.uz

Submission #1052215

# Submission time Handle Problem Language Result Execution time Memory
1052215 2024-08-10T12:31:12 Z noyancanturk Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 5 ms 600 KB 
#include "mushrooms.h"

#include <bits/stdc++.h>
using namespace std;

#define pb push_back

int ind=1;
vector<int>t1,t2;

int count_mushrooms(int n) {
	t1.pb(0);
	while(ind<n&&t1.size()<2&&t2.size()<2){
		int k=use_machine({0,ind});
		if(k==1){
			t2.pb(ind);
		}else{
			t1.pb(ind);
		}
		ind++;
	}
	for(int i=0;i<75&&ind<n;i++){
		if(ind==n-1){
			int k=use_machine({0,ind});
			if(k==1){
				t2.pb(ind);
			}else{
				t1.pb(ind);
			}
			ind++;
		}else if(1<t1.size()){
			int k=use_machine({t1[0],ind,t1[1],ind+1});
			if(!k){
				t1.pb(ind);
				t1.pb(ind+1);
			}else if(k==1){
				t1.pb(ind);
				t2.pb(ind+1);
			}else if(k==2){
				t2.pb(ind);
				t1.pb(ind+1);
			}else{
				t2.pb(ind);
				t2.pb(ind+1);
			}
			ind+=2;
		}else{
			int k=use_machine({t2[0],ind,t2[1],ind+1});
			if(!k){
				t2.pb(ind);
				t2.pb(ind+1);
			}else if(k==1){
				t2.pb(ind);
				t1.pb(ind+1);
			}else if(k==2){
				t1.pb(ind);
				t2.pb(ind+1);
			}else{
				t1.pb(ind);
				t1.pb(ind+1);
			}
			ind+=2;
		}
	}
	int ans=0;
	while(ind<n){
		if(t2.size()<t1.size()){
			vector<int>to;
			int j=ind;
			to.pb(t1[0]);
			for(int i=1;i<t1.size()&&j<n;i++){
				to.pb(j++);
				to.pb(t1[i]);
			}
			if(j<n){
				to.pb(j);
				int k=use_machine(to);
				ans+=(j-ind)-k/2;
				if(k&1)t2.pb(j);
				else t1.pb(j);
				j++;
			}else{
				int k=use_machine(to);
				ans+=(j-ind)-k/2;
			}
			ind=j;
		}else{
			vector<int>to;
			int j=ind;
			to.pb(t2[0]);
			for(int i=1;i<t2.size()&&j<n;i++){
				to.pb(j++);
				to.pb(t2[i]);
			}
			if(j<n){
				to.pb(j);
				int k=use_machine(to);
				ans+=k/2;
				if(k&1)t1.pb(j);
				else t2.pb(j);
				j++;
			}else{
				int k=use_machine(to);
				ans+=k/2;
			}
			ind=j;
		}
	}
	return ans+t1.size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:71:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |    for(int i=1;i<t1.size()&&j<n;i++){
      |                ~^~~~~~~~~~
mushrooms.cpp:91:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |    for(int i=1;i<t2.size()&&j<n;i++){
      |                ~^~~~~~~~~~

Subtask #1
92.623 / 100.0

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