oj.uz

Submission #1003447

# Submission time Handle Problem Language Result Execution time Memory
1003447 2024-06-20T10:45:57 Z PoPularPlusPlus Counting Mushrooms (IOI20_mushrooms) C++17
75.3333 / 100
 6 ms 344 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) x.begin(),x.end()
#define vf first 
#define vs second

pair<int,int> cal(int tp , int type){
	pair<int,int> p = mp(0,0);
	if(type == 0){
		if(tp % 2 == 1){
			p.vf = 1;
		}
		if(tp >= 2){
			p.vs = 1;
		}
	}
	else {
		if(tp % 2 == 0){
			p.vf = 1;
		}
		if(tp < 2){
			p.vs = 1;
		}
	}
	return p;
}

int cal1(int tp , int type , int tot){
	int res = 0;
	if(type == 0){
		if(tp % 2 == 0)res++;
		tot--;
		res += tot;
		res -= tp/2;
	}
	else {
		if(tp % 2 == 1)res++;
		res += tp/2;
	}

	return res;
}

int count_mushrooms(int n) {
	if(n == 2){
		return 1 + (use_machine({0,1}) == 0 ? 1 : 0);
	}
	int ans = 1;
	vector<int> ask;
	ask.pb(0);
	ask.pb(1);
	int tp = use_machine(ask);
	vector<int> a , b;
	a.pb(0);
	pair<int,int> p;
	int start = 2;
	int type = 0;
	if(tp == 0){
		a.pb(1);
		ans++;
		p = mp(0 , 1);
	}
	else {
		b.pb(1);
		start++;
		ask.pop_back();
		ask.pb(2);
		tp = use_machine(ask);
		if(tp == 0){
			a.pb(2);
			ans++;
			p = mp(0,2);
		}
		else {
			b.pb(2);
			p = mp(1,2);
			type = 1;
		}
	}

	while(a.size() < 99 && b.size() < 99 && start < n){
		if(start + 1 == n){
			tp = use_machine({0 , start});
			if(tp == 0){
				ans++;
			}
			start++;
		}
		else {
			tp = use_machine({start,p.vf,start + 1,p.vs});
			pair<int,int> val = cal(tp , type);
			if(val.vf == 0){
				ans++;
				a.pb(start);
			}
			else {
				b.pb(start);
			}
			start++;
			if(val.vs == 0){
				ans++;
				a.pb(start);
			}
			else {
				b.pb(start);
			}
			start++;
		}
	}
	if(start >= n){
		return ans;
	}
	while(start < n){
		int rem = n - start;
		if(rem > max(a.size(),b.size())){
			ask.clear();
			for(int i = start , j = 0; j < max(a.size(), b.size()); i++,j++){
				ask.pb(start++);
				if(a.size() >= b.size()){
					ask.pb(a[j]);
				}
				else ask.pb(b[j]);
			}

			tp = use_machine(ask);
			ans += cal1(tp , (a.size() >= b.size() ? 0 : 1),ask.size()/2);
		}
		else {
			ask.clear();

			for(int i = start , j = 0; i < n; i++,j++){
				ask.pb(start++);
				if(a.size() >= b.size()){
					ask.pb(a[j]);
				}
				else ask.pb(b[j]);
			}

			tp = use_machine(ask);
			ans += cal1(tp , (a.size() >= b.size() ? 0 : 1),ask.size()/2);
		}
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:119:10: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
  119 |   if(rem > max(a.size(),b.size())){
      |      ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:121:33: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
  121 |    for(int i = start , j = 0; j < max(a.size(), b.size()); i++,j++){
      |                               ~~^~~~~~~~~~~~~~~~~~~~~~~~~

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