oj.uz

Submission #1046757

# Submission time Handle Problem Language Result Execution time Memory
1046757 2024-08-06T21:34:29 Z mariaclara Counting Mushrooms (IOI20_mushrooms) C++17
80.7143 / 100
 5 ms 716 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair 
#define pb push_back
#define fr first 
#define sc second

int C = 0;
int count_mushrooms(int n) {
	vector<int> A, B;

	A.pb(0);
	// for(int i = 1; i < n; i++) {
	// 	if(use_machine({0,i}) == 0) A.pb(i);
	// 	else B.pb(i);
	// 	if(sz(A) >= C or sz(B) >= C) break;
	// }

	int use = 0;
	if(sz(A) < sz(B)) use = 1;

	int ans = sz(A);
	for(int i = sz(A) + sz(B); i < n; i+=C) {
		if(sz(A) < sz(B)) use = 1, C = sz(B);
		else use = 0, C = sz(A);

		if(use == 0) {
			vector<int> q;
			for(int j = i; j < min(n,i+C); j++)
				q.pb(A[j-i]), q.pb(j);

			int x = use_machine(q);
			if(x%2 == 1) B.pb(q.back());
			else A.pb(q.back());
			x = sz(q) - 1 - x; // número de posições que são iguais
			ans += (x+1)/2;
		}
		else {
			vector<int> q;
			for(int j = i; j < min(n,i+C); j++)
				q.pb(B[j-i]), q.pb(j);

			int x = use_machine(q);
			// número de posições que são diferentes
			if(x%2 == 1) A.pb(q.back());
			else B.pb(q.back());
			ans += (x+1)/2;
		}
	}

	return ans;
}

Subtask #1
80.7143 / 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 1 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 472 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 5 ms 472 KB Output is partially correct
12 Partially correct 3 ms 460 KB Output is partially correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Partially correct 3 ms 480 KB Output is partially correct
16 Partially correct 3 ms 464 KB Output is partially correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 3 ms 476 KB Output is correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Partially correct 3 ms 460 KB Output is partially correct
21 Partially correct 3 ms 600 KB Output is partially correct
22 Partially correct 4 ms 716 KB Output is partially correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Partially correct 3 ms 344 KB Output is partially correct
26 Partially correct 3 ms 472 KB Output is partially correct
27 Partially correct 3 ms 600 KB Output is partially correct
28 Partially correct 3 ms 456 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 3 ms 464 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 480 KB Output is partially correct
35 Partially correct 3 ms 340 KB Output is partially correct
36 Partially correct 5 ms 464 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 3 ms 344 KB Output is partially correct
39 Partially correct 3 ms 468 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 3 ms 344 KB Output is partially correct
42 Partially correct 3 ms 468 KB Output is partially correct
43 Partially correct 3 ms 452 KB Output is partially correct
44 Partially correct 3 ms 344 KB Output is partially correct
45 Partially correct 3 ms 464 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 344 KB Output is partially correct
50 Partially correct 3 ms 344 KB Output is partially correct
51 Partially correct 3 ms 344 KB Output is partially correct
52 Partially correct 5 ms 600 KB Output is partially correct
53 Partially correct 3 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 4 ms 600 KB Output is partially correct
58 Partially correct 3 ms 448 KB Output is partially correct
59 Partially correct 3 ms 452 KB Output is partially correct
60 Partially correct 3 ms 344 KB Output is partially correct
61 Partially correct 3 ms 452 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