oj.uz

답안 #831241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831241 2023-08-20T01:58:36 Z Username4132 버섯 세기 (IOI20_mushrooms) C++17
80.427 / 100
 7 ms 336 KB 
#include "mushrooms.h"
#include<iostream>
#include<vector>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
#define PB push_back

const int SZ = 135;

int count_mushrooms(int n) {
	if(n==2) return !use_machine({0, 1}) + 1;
	int a, b, f, s, type, pen = min(2*SZ + 3, n);
	a = use_machine({0, 1});
	b = use_machine({0, 2});
	if(a==0) f=0, s=1, type=0;
	else if(b==0) f=0, s=2, type=0;
	else f=1, s=2, type=1;

	vector<bool> res(pen);
	res[0]=0, res[1]=a, res[2]=b;

	for(int i=3; i<pen; i+=2){
		if(i+1<pen){
			int ret = use_machine({f, i, s, i+1});
			res[i]=(ret>>1)^type, res[i+1]=(ret&1)^type;
		}
		else{
			int ret = use_machine({f, i, s});
			res[i]=(ret>>1)^type;
		}
	}
	int tot=0, ans=0;
	vector<int> toUse;
	forn(i, pen) tot+=res[i];
	bool cond = 2*tot > pen;
	forn(i, pen) if(res[i] == cond) toUse.PB(i);
	forn(i, pen) ans+=!res[i];
	int sz = (int)toUse.size(), l=pen;
	while(l<n){
		vector<int> ask;
		int r = min(l+sz, n);
		forn(i, r-l){
			ask.PB(toUse[i]);
			ask.PB(l+i);
		}
		int ret = use_machine(ask);
		int ad = ((ret+1)>>1);
		ans+=(cond? ad : r-l-ad);
		l=r;
	}
	return ans;
}

Subtask #1
80.427 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 5 ms 308 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Partially correct 4 ms 304 KB Output is partially correct
11 Partially correct 7 ms 208 KB Output is partially correct
12 Partially correct 5 ms 208 KB Output is partially correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Partially correct 6 ms 208 KB Output is partially correct
16 Partially correct 5 ms 208 KB Output is partially correct
17 Correct 3 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Partially correct 6 ms 208 KB Output is partially correct
20 Partially correct 5 ms 308 KB Output is partially correct
21 Partially correct 5 ms 208 KB Output is partially correct
22 Partially correct 6 ms 208 KB Output is partially correct
23 Partially correct 5 ms 308 KB Output is partially correct
24 Correct 4 ms 208 KB Output is correct
25 Partially correct 7 ms 208 KB Output is partially correct
26 Partially correct 7 ms 208 KB Output is partially correct
27 Partially correct 5 ms 208 KB Output is partially correct
28 Partially correct 7 ms 208 KB Output is partially correct
29 Partially correct 5 ms 208 KB Output is partially correct
30 Partially correct 5 ms 336 KB Output is partially correct
31 Partially correct 6 ms 208 KB Output is partially correct
32 Partially correct 5 ms 208 KB Output is partially correct
33 Partially correct 5 ms 208 KB Output is partially correct
34 Partially correct 5 ms 208 KB Output is partially correct
35 Partially correct 7 ms 208 KB Output is partially correct
36 Partially correct 6 ms 208 KB Output is partially correct
37 Partially correct 6 ms 208 KB Output is partially correct
38 Partially correct 5 ms 208 KB Output is partially correct
39 Partially correct 5 ms 220 KB Output is partially correct
40 Partially correct 5 ms 304 KB Output is partially correct
41 Partially correct 6 ms 304 KB Output is partially correct
42 Partially correct 5 ms 208 KB Output is partially correct
43 Partially correct 5 ms 208 KB Output is partially correct
44 Partially correct 5 ms 300 KB Output is partially correct
45 Partially correct 5 ms 208 KB Output is partially correct
46 Partially correct 5 ms 208 KB Output is partially correct
47 Partially correct 6 ms 208 KB Output is partially correct
48 Partially correct 6 ms 208 KB Output is partially correct
49 Partially correct 6 ms 208 KB Output is partially correct
50 Partially correct 6 ms 208 KB Output is partially correct
51 Partially correct 7 ms 208 KB Output is partially correct
52 Partially correct 6 ms 208 KB Output is partially correct
53 Partially correct 6 ms 208 KB Output is partially correct
54 Partially correct 6 ms 208 KB Output is partially correct
55 Partially correct 4 ms 304 KB Output is partially correct
56 Partially correct 5 ms 208 KB Output is partially correct
57 Partially correct 6 ms 208 KB Output is partially correct
58 Partially correct 6 ms 208 KB Output is partially correct
59 Partially correct 6 ms 208 KB Output is partially correct
60 Partially correct 6 ms 208 KB Output is partially correct
61 Partially correct 7 ms 308 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 1 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 1 ms 208 KB Output is correct
72 Correct 0 ms 208 KB Output is correct
73 Correct 1 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 0 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