oj.uz

답안 #831235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831235 2023-08-20T01:31:19 Z Baytoro 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 8 ms 336 KB 
#include "mushrooms.h"
//#include "stub.cpp"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define all(x) x.begin(),x.end();
int count_mushrooms(int n) {
	vector<int> a[2];
	a[0].pb(0);
	int last=1;
	for(int i=1;i<n && max(a[0].size(),a[1].size())<2;i++){
		if(use_machine({0,i})) a[1].pb(i);
		else a[0].pb(i);
		last++;
	}
	for(int i=last;i+1<n && (int)a[0].size()<80 && (int)a[1].size()<80;){
		int x=0;
		if(a[0].size()<2) x=1;
		int cnt=use_machine({a[x][0],i,a[x][1],i+1});
		if(cnt==0) {a[x].pb(i);a[x].pb(i+1);}
		if(cnt==1) {a[x].pb(i);a[x^1].pb(i+1);}
		if(cnt==2) {a[x].pb(i+1);a[x^1].pb(i);}
		if(cnt==3) {a[x^1].pb(i);a[x^1].pb(i+1);}
		i+=2;
		last=i;
	}
	vector<int> A(2);
	A[0]=a[0].size();
	A[1]=a[1].size();
	for(int i=last;i<n;){
		int x=0,s=a[0].size();
		if(s<(int)a[1].size()) x=1,s=a[1].size();
		int l=min(i+s,n);
		vector<int> v;
		for(int j=i;j<l;j++){
			v.pb(a[x][j-i]);
			v.pb(j);
		}
		int cnt=use_machine(v);
		if(cnt%2) A[x^1]++,a[x^1].pb(l-1),cnt--;
		else A[x]++,a[x].pb(l-1);
		A[x^1]+=(cnt+1)/2,A[x]+=(l-i-1-(cnt+1)/2);
		i=l;
	}
	return A[0];
}

Subtask #1
92.623 / 100.0

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