oj.uz

Submission #1052349

# Submission time Handle Problem Language Result Execution time Memory
1052349 2024-08-10T13:39:48 Z mychecksedad Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 5 ms 712 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second


int count_mushrooms(int n) {
	// int mn = 1000000, sz;
	// for(int k = 2; k <= 500; ++k){
	// 	int q = k;
	// 	int kk = k;
	// 	int rem = 20000 - k;
	// 	for(; rem > 0; ){
	// 		rem -= k;
	// 		rem -= k;
	// 		k++;
	// 		q+=2;
	// 	}
	// 	if(mn>q) sz=kk;
	// 	k = kk;
	// 	mn=min(mn,q);
	// }
	// cout << mn << ' ' << sz;
	vector<int> A, B;
	A.pb(0);

	int last = 1, add = 0;
	int q = use_machine({0, 1});
	if(q == 0){
		A.pb(1);
		last = 2;
	}else{
		B.pb(1);
		last =2 ;
		if(n == 2) return 1;
		int q = use_machine({0, 2});
		if(q == 1) B.pb(2);
		else A.pb(2);
		last = 3;
	}
	for(int i = 0; i < 84 && last + 1 < n; ++i){
		if(A.size()>1){
			int x = use_machine({A[0], last, A[1], last + 1});
			if(x % 2 == 0) A.pb(last + 1);
			else B.pb(last + 1);

			if(x > 1) B.pb(last);
			else A.pb(last);
			last += 2;
		}else{
			int x = use_machine({B[0], last, B[1], last + 1});
			if(x % 2 == 0) B.pb(last + 1);
			else A.pb(last + 1);

			if(x > 1) A.pb(last);
			else B.pb(last);
			last += 2;
		}
	}
	while(last < n){
		if(A.size() > B.size()){
			vector<int> q;
			int s = A.size();
			for(int j = last; j < min(n, last + s); ++j){
				q.pb(j);
				q.pb(A[j - last]);
			}
			last = min(n, last + s);
			int f = use_machine(q);
			s = q.size()/2 - 1;
			add += s - f/2;
			if(f%2==0) A.pb(q[0]);
			else B.pb(q[0]);
		}else{
			vector<int> q;
			int s = B.size();
			for(int j = last; j < min(n, last + s); ++j){
				q.pb(j);
				q.pb(B[j - last]);
			}
			int f = use_machine(q);
			add += f/2;
			if(f%2==1) A.pb(q[0]);
			else B.pb(q[0]);

			last = min(n, last + s);
		}
	}


	return int(A.size()) + add;
}

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 452 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Partially correct 2 ms 456 KB Output is partially correct
12 Correct 4 ms 708 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 440 KB Output is correct
15 Partially correct 3 ms 344 KB Output is partially correct
16 Partially correct 4 ms 344 KB Output is partially correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 4 ms 448 KB Output is correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Partially correct 3 ms 344 KB Output is partially correct
26 Partially correct 2 ms 464 KB Output is partially correct
27 Partially correct 2 ms 464 KB Output is partially correct
28 Partially correct 3 ms 344 KB Output is partially correct
29 Partially correct 3 ms 344 KB Output is partially correct
30 Partially correct 2 ms 344 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 3 ms 344 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 3 ms 344 KB Output is partially correct
35 Partially correct 2 ms 460 KB Output is partially correct
36 Partially correct 2 ms 344 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 3 ms 452 KB Output is partially correct
39 Partially correct 3 ms 456 KB Output is partially correct
40 Partially correct 3 ms 440 KB Output is partially correct
41 Partially correct 5 ms 344 KB Output is partially correct
42 Partially correct 4 ms 712 KB Output is partially correct
43 Partially correct 3 ms 344 KB Output is partially correct
44 Partially correct 3 ms 452 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 4 ms 460 KB Output is partially correct
48 Partially correct 3 ms 456 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 344 KB Output is partially correct
52 Partially correct 4 ms 456 KB Output is partially correct
53 Partially correct 3 ms 344 KB Output is partially correct
54 Partially correct 4 ms 344 KB Output is partially correct
55 Partially correct 3 ms 456 KB Output is partially correct
56 Partially correct 5 ms 344 KB Output is partially correct
57 Partially correct 3 ms 464 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 3 ms 464 KB Output is partially correct
61 Partially correct 2 ms 444 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 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct