oj.uz

답안 #738536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738536 2023-05-09T04:09:09 Z bobthebuilder 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 11 ms 336 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define lowb(x) (x&(-x))
#define ALL(_x) _x.begin(),_x.end()
#define pii pair<int,int>
#define f first
#define s second
#define SORT_UNIQUE(x) sort(ALL(x)),x.erase(unique(ALL(x)),x.end())
#define ll long long
#define MNTO(x,y) x=min(x,y)
#define MXTO(x,y) x=max(x,y)
int count_mushrooms(int n) {
	const int blk=80;
	if(n<=200){
		int ans=1;
		REP1(i,n-1){
			ans+=1-use_machine({0,i});
		}
		return ans;
	}	
	vector<int> v[2];
	v[0].pb(0);
	int z=use_machine({0,1}),zz=use_machine({0,2});
	if(z) v[1].pb(1);
	else v[0].pb(1);
	if(zz) v[1].pb(2);
	else v[0].pb(2);
	for(int i=3;i<2*blk-1;i+=2){
		if(sz(v[0])>=2){
			int k=use_machine({i,v[0][0],i+1,v[0][1]});
			v[k%2].pb(i),v[k/2].pb(i+1);
		}
		else{
			int k=use_machine({i,v[1][0],i+1,v[1][1]});
			v[1-k%2].pb(i),v[1-k/2].pb(i+1);
		}
	}
	int mx=max(sz(v[0]),sz(v[1]));
	int ans=0;
	for(int i=2*blk-1;i<n;i+=mx){
		mx=max(sz(v[0]),sz(v[1]));
		vector<int> vv;
		int p=0;
		if(sz(v[1])==mx) p=1;
		REP(j,mx){
			if(i+j>=n) break; 
			vv.pb(i+j);
			vv.pb(v[p][j]);
		}
		int k=use_machine(vv);
		v[(k%2)^(p)].pb(i);
		ans+=(p?k/2:sz(vv)/2-k/2-1);
	}
	//for(int x:v[0]) cout<<x<<' ';
	ans+=sz(v[0]);
	return ans;
}

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 6 ms 208 KB Output is correct
8 Correct 5 ms 312 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 6 ms 324 KB Output is correct
11 Partially correct 7 ms 208 KB Output is partially correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 5 ms 308 KB Output is correct
15 Partially correct 7 ms 316 KB Output is partially correct
16 Partially correct 6 ms 316 KB Output is partially correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Partially correct 7 ms 304 KB Output is partially correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 8 ms 208 KB Output is correct
22 Partially correct 7 ms 316 KB Output is partially correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Partially correct 5 ms 328 KB Output is partially correct
26 Partially correct 6 ms 208 KB Output is partially correct
27 Partially correct 7 ms 208 KB Output is partially correct
28 Partially correct 7 ms 208 KB Output is partially correct
29 Partially correct 6 ms 328 KB Output is partially correct
30 Partially correct 6 ms 324 KB Output is partially correct
31 Partially correct 6 ms 312 KB Output is partially correct
32 Partially correct 10 ms 316 KB Output is partially correct
33 Partially correct 8 ms 312 KB Output is partially correct
34 Partially correct 6 ms 320 KB Output is partially correct
35 Partially correct 5 ms 208 KB Output is partially correct
36 Partially correct 6 ms 312 KB Output is partially correct
37 Partially correct 7 ms 312 KB Output is partially correct
38 Partially correct 8 ms 316 KB Output is partially correct
39 Partially correct 5 ms 328 KB Output is partially correct
40 Partially correct 9 ms 336 KB Output is partially correct
41 Partially correct 5 ms 336 KB Output is partially correct
42 Partially correct 7 ms 328 KB Output is partially correct
43 Partially correct 5 ms 208 KB Output is partially correct
44 Partially correct 8 ms 336 KB Output is partially correct
45 Partially correct 8 ms 320 KB Output is partially correct
46 Partially correct 7 ms 320 KB Output is partially correct
47 Partially correct 8 ms 336 KB Output is partially correct
48 Partially correct 7 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 336 KB Output is partially correct
52 Partially correct 7 ms 332 KB Output is partially correct
53 Partially correct 8 ms 328 KB Output is partially correct
54 Partially correct 7 ms 208 KB Output is partially correct
55 Partially correct 7 ms 328 KB Output is partially correct
56 Partially correct 9 ms 328 KB Output is partially correct
57 Partially correct 9 ms 208 KB Output is partially correct
58 Partially correct 7 ms 208 KB Output is partially correct
59 Partially correct 11 ms 320 KB Output is partially correct
60 Partially correct 6 ms 336 KB Output is partially correct
61 Partially correct 7 ms 328 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 0 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 1 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 0 ms 208 KB Output is correct
74 Correct 1 ms 208 KB Output is correct
75 Correct 0 ms 208 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 216 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 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 1 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct