oj.uz

Submission #824906

# Submission time Handle Problem Language Result Execution time Memory
824906 2023-08-14T11:48:37 Z NothingXD Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 9 ms 344 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 2e4 + 10;
const int sq = 75;

int count_mushrooms(int n) {
	vector<int> A, B;
	A.push_back(0);
	vector<int> ask = {0, 1};
	if (use_machine(ask)){
		B.push_back(1);
	}
	else{
		A.push_back(1);
	}
	if (n == 2) return A.size();
	ask = {0, 2};
	if (use_machine(ask)){
		B.push_back(2);
	}
	else{
		A.push_back(2);
	}
	bool flg = false;
	if (A.size() == 1){
		swap(A, B);
		flg = true;
	}
	for (int i = 3; i < n && A.size() < sq && B.size() < sq; i += 2){
		vector<int> ask;
		ask.push_back(A[0]);
		ask.push_back(i);
		ask.push_back(A[1]);
		if (i+1 < n) ask.push_back(i+1);
		int tmp = use_machine(ask);
		if ((tmp >> 1) & 1) B.push_back(i);
		else A.push_back(i);
		if (tmp & 1) B.push_back(i+1);
		else if (i + 1 < n) A.push_back(i+1);
	}
	int sz;
	int cnta = 0, cntb = 0;
	for (int i = A.size()+B.size(); i < n; i += sz){
		//debug(i);
		if (A.size() < B.size()){
			swap(A, B);
			swap(cnta, cntb);
			flg = !flg;
		}
		sz = A.size();
		//assert(0);
		vector<int> ask;
		for (int j = 0; j < A.size(); j++){
			ask.push_back(A[j]);
			if (i+j < n) ask.push_back(i+j);
		}
		int tmp = use_machine(ask);
	//	debug(tmp);
		if (i + sz-1 < n && tmp % 2 == 0){
			A.push_back(ask.back());
			debug(flg, ask.back());
		}
		else if (i + sz-1 < n){
			B.push_back(ask.back());
			debug(!flg, ask.back());
		}
		cntb += tmp/2;
		cnta += min(sz-1, n-i) - tmp/2;
		//debug(flg, A.size(), cnta, B.size(), cntb);
	}
	return (flg? B.size() + cntb: A.size() + cnta);
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:73:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |   for (int j = 0; j < A.size(); j++){
      |                   ~~^~~~~~~~~~

Subtask #1
92.623 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 228 KB Output is correct
7 Correct 8 ms 340 KB Output is correct
8 Correct 8 ms 316 KB Output is correct
9 Correct 8 ms 336 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Partially correct 6 ms 324 KB Output is partially correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 8 ms 320 KB Output is correct
14 Correct 4 ms 324 KB Output is correct
15 Partially correct 7 ms 344 KB Output is partially correct
16 Partially correct 9 ms 332 KB Output is partially correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 6 ms 336 KB Output is correct
19 Partially correct 8 ms 324 KB Output is partially correct
20 Correct 7 ms 324 KB Output is correct
21 Correct 6 ms 336 KB Output is correct
22 Partially correct 6 ms 336 KB Output is partially correct
23 Correct 5 ms 336 KB Output is correct
24 Correct 4 ms 208 KB Output is correct
25 Partially correct 8 ms 312 KB Output is partially correct
26 Partially correct 6 ms 336 KB Output is partially correct
27 Partially correct 6 ms 336 KB Output is partially correct
28 Partially correct 9 ms 336 KB Output is partially correct
29 Partially correct 9 ms 316 KB Output is partially correct
30 Partially correct 8 ms 340 KB Output is partially correct
31 Partially correct 8 ms 332 KB Output is partially correct
32 Partially correct 6 ms 340 KB Output is partially correct
33 Partially correct 9 ms 328 KB Output is partially correct
34 Partially correct 8 ms 336 KB Output is partially correct
35 Partially correct 7 ms 332 KB Output is partially correct
36 Partially correct 9 ms 332 KB Output is partially correct
37 Partially correct 9 ms 324 KB Output is partially correct
38 Partially correct 9 ms 340 KB Output is partially correct
39 Partially correct 6 ms 340 KB Output is partially correct
40 Partially correct 6 ms 308 KB Output is partially correct
41 Partially correct 8 ms 320 KB Output is partially correct
42 Partially correct 8 ms 336 KB Output is partially correct
43 Partially correct 6 ms 324 KB Output is partially correct
44 Partially correct 6 ms 320 KB Output is partially correct
45 Partially correct 7 ms 336 KB Output is partially correct
46 Partially correct 6 ms 336 KB Output is partially correct
47 Partially correct 9 ms 336 KB Output is partially correct
48 Partially correct 6 ms 308 KB Output is partially correct
49 Partially correct 7 ms 312 KB Output is partially correct
50 Partially correct 6 ms 336 KB Output is partially correct
51 Partially correct 7 ms 340 KB Output is partially correct
52 Partially correct 9 ms 336 KB Output is partially correct
53 Partially correct 8 ms 340 KB Output is partially correct
54 Partially correct 6 ms 340 KB Output is partially correct
55 Partially correct 6 ms 332 KB Output is partially correct
56 Partially correct 8 ms 332 KB Output is partially correct
57 Partially correct 8 ms 332 KB Output is partially correct
58 Partially correct 9 ms 336 KB Output is partially correct
59 Partially correct 6 ms 344 KB Output is partially correct
60 Partially correct 8 ms 328 KB Output is partially correct
61 Partially correct 9 ms 336 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 1 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 0 ms 208 KB Output is correct
68 Correct 0 ms 208 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 0 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 0 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 0 ms 208 KB Output is correct
83 Correct 0 ms 208 KB Output is correct
84 Correct 0 ms 208 KB Output is correct
85 Correct 0 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