oj.uz

Submission #430552

# Submission time Handle Problem Language Result Execution time Memory
430552 2021-06-16T15:44:20 Z alishahali1382 Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
 14 ms 456 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": "; for (auto dcba:abcd) cerr<<dcba<<", ";cerr<<"\n";}
#define pb push_back
#define all(x) x.begin(), x.end()
#define SZ(x) ((int)x.size())

const int inf=1000000100; // 1e9
const ll INF=10000000001000000; // 1e16
const int mod=1000000007;
const int MAXN=20010;

int n, m, k, x, y, a, b, t=80, ans;
vi A, B;

inline int ask(vi vec){ return use_machine(vec);}
int Solve(vi vec){
	if (SZ(A)>=SZ(vec)){
		vi shit;
		for (int i=0; i<SZ(vec); i++){
			shit.pb(A[i]);
			shit.pb(vec[i]);
		}
		// shit.pb(A[SZ(vec)]);
		int res=ask(shit);
		if (res&1) B.pb(shit.back());
		else A.pb(shit.back());
		return SZ(vec)-(res+1)/2;
	}
	vi shit;
	for (int i=0; i<SZ(vec); i++){
		shit.pb(B[i]);
		shit.pb(vec[i]);
	}
	// shit.pb(B[SZ(vec)]);
	int res=ask(shit);
	if (res&1) A.pb(shit.back());
	else B.pb(shit.back());
	return (res+1)/2;
}

int count_mushrooms(int _n){
	n=_n;
	if (n<400){ // wtf am I doing?
		ans=1;
		for (int i=1; i<n; i+=2){
			if (i==n-1){
				ans+=1-ask({0, i});
				continue ;
			}
			ans+=2-ask({i, 0, i+1});
		}
		return ans;
	}
	int pos=0;
	bool rev=0;
	
	A.pb(pos++);
	while (pos<3){
		int i=pos++;
		if (ask({0, i})) B.pb(i);
		else A.pb(i);
	}
	if (SZ(A)<2){
		A.swap(B);
		rev=1;
	}
	assert(SZ(A)>=2);
	for (int i=pos; max(SZ(A), SZ(B))<t; i+=2, pos+=2){
		int tmp=ask({i, A[0], i+1, A[1]});
		if (tmp&1) B.pb(i);
		else A.pb(i);
		if (tmp&2) B.pb(i+1);
		else A.pb(i+1);
	}
	if (rev) A.swap(B);

	// assert(max(SZ(A), SZ(B))>=t);
	ans=SZ(A);
	for (int i=pos; i<n; ){
		vi vec;
		while(SZ(vec)<max(SZ(A), SZ(B)) && i<n)
			vec.pb(i++);
		// debugv(vec)
		ans+=Solve(vec);
	}
	return ans;
}

Subtask #1
92.623 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 8 ms 328 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 9 ms 328 KB Output is correct
10 Correct 10 ms 320 KB Output is correct
11 Partially correct 10 ms 308 KB Output is partially correct
12 Correct 10 ms 312 KB Output is correct
13 Correct 11 ms 304 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Partially correct 13 ms 328 KB Output is partially correct
16 Partially correct 10 ms 336 KB Output is partially correct
17 Correct 7 ms 316 KB Output is correct
18 Correct 9 ms 352 KB Output is correct
19 Partially correct 9 ms 328 KB Output is partially correct
20 Correct 12 ms 328 KB Output is correct
21 Correct 9 ms 316 KB Output is correct
22 Partially correct 14 ms 328 KB Output is partially correct
23 Correct 11 ms 368 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Partially correct 12 ms 304 KB Output is partially correct
26 Partially correct 7 ms 420 KB Output is partially correct
27 Partially correct 8 ms 356 KB Output is partially correct
28 Partially correct 9 ms 328 KB Output is partially correct
29 Partially correct 9 ms 344 KB Output is partially correct
30 Partially correct 9 ms 328 KB Output is partially correct
31 Partially correct 9 ms 368 KB Output is partially correct
32 Partially correct 8 ms 356 KB Output is partially correct
33 Partially correct 12 ms 300 KB Output is partially correct
34 Partially correct 9 ms 300 KB Output is partially correct
35 Partially correct 9 ms 328 KB Output is partially correct
36 Partially correct 9 ms 328 KB Output is partially correct
37 Partially correct 8 ms 456 KB Output is partially correct
38 Partially correct 7 ms 340 KB Output is partially correct
39 Partially correct 9 ms 344 KB Output is partially correct
40 Partially correct 12 ms 336 KB Output is partially correct
41 Partially correct 9 ms 328 KB Output is partially correct
42 Partially correct 7 ms 328 KB Output is partially correct
43 Partially correct 10 ms 328 KB Output is partially correct
44 Partially correct 9 ms 328 KB Output is partially correct
45 Partially correct 8 ms 356 KB Output is partially correct
46 Partially correct 6 ms 352 KB Output is partially correct
47 Partially correct 7 ms 328 KB Output is partially correct
48 Partially correct 12 ms 336 KB Output is partially correct
49 Partially correct 9 ms 392 KB Output is partially correct
50 Partially correct 10 ms 384 KB Output is partially correct
51 Partially correct 9 ms 328 KB Output is partially correct
52 Partially correct 7 ms 412 KB Output is partially correct
53 Partially correct 9 ms 360 KB Output is partially correct
54 Partially correct 9 ms 328 KB Output is partially correct
55 Partially correct 9 ms 332 KB Output is partially correct
56 Partially correct 9 ms 328 KB Output is partially correct
57 Partially correct 9 ms 348 KB Output is partially correct
58 Partially correct 11 ms 336 KB Output is partially correct
59 Partially correct 12 ms 328 KB Output is partially correct
60 Partially correct 9 ms 328 KB Output is partially correct
61 Partially correct 9 ms 316 KB Output is partially correct
62 Correct 0 ms 200 KB Output is correct
63 Correct 0 ms 200 KB Output is correct
64 Correct 1 ms 200 KB Output is correct
65 Correct 1 ms 200 KB Output is correct
66 Correct 1 ms 200 KB Output is correct
67 Correct 0 ms 200 KB Output is correct
68 Correct 1 ms 200 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 1 ms 200 KB Output is correct
72 Correct 1 ms 200 KB Output is correct
73 Correct 1 ms 200 KB Output is correct
74 Correct 1 ms 200 KB Output is correct
75 Correct 1 ms 200 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 1 ms 256 KB Output is correct
89 Correct 1 ms 256 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct