oj.uz

답안 #399173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399173 2021-05-05T11:31:20 Z Antekb 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 9 ms 456 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb(x) push_back(x)
using namespace std;
int count_mushrooms(int n) {
	vector<int> A, B, C(n-1);
	A.pb(0);
	iota(C.begin(), C.end(), 1);
	int k=81;
	for(int i=0; i<2 && C.size(); i++){
		int c1 = use_machine({0, C.back()});
		if(c1==1)B.pb(C.back());
		else A.pb(C.back());
		C.pop_back();
	}
	bool swa=0;
	if(A.size()<B.size()){
		swap(A, B);
		swa=1;
	}
	for(int i=0; i<k && C.size()>1; i++){
		int c1 = use_machine({A[0], C.back(), A[1], C[C.size()-2]});
		if(c1>=2)B.pb(C.back());
		else A.pb(C.back());
		C.pop_back();
		if(c1&1)B.pb(C.back());
		else A.pb(C.back());
		C.pop_back();
	}
	int a=A.size(), b=B.size();
	while(C.size()){
		/*cout<<"A: ";
		for(int i:A)cout<<i<<" ";
			cout<<"\n";
		cout<<"B: ";
		for(int i:B)cout<<i<<" ";
			cout<<"\n";
		cout<<a<<" "<<b<<"\n";*/
		if(A.size()<B.size()){
			//cout<<"...";
			swap(A, B);
			swap(a, b);
			swa^=1;
		}
		int t=min(A.size(), C.size());
		vector<int> V;
		for(int i=0; i<t; i++){
			V.pb(A[i]);
			V.pb(C.back());
			C.pop_back();
		}
		int c=use_machine(V);
		//cout<<t<<" "<<c<<"\n";
		b+=(c+1)/2;
		a+=t-(c+1)/2;
		if(c&1)B.pb(V.back());
		else A.pb(V.back());
	}
	if(swa)swap(a, b);
	return a;
}

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 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 1 ms 200 KB Output is correct
6 Correct 3 ms 200 KB Output is correct
7 Correct 8 ms 328 KB Output is correct
8 Correct 7 ms 328 KB Output is correct
9 Correct 8 ms 328 KB Output is correct
10 Correct 7 ms 328 KB Output is correct
11 Partially correct 6 ms 404 KB Output is partially correct
12 Correct 7 ms 328 KB Output is correct
13 Correct 7 ms 328 KB Output is correct
14 Correct 5 ms 328 KB Output is correct
15 Partially correct 8 ms 404 KB Output is partially correct
16 Partially correct 8 ms 328 KB Output is partially correct
17 Correct 4 ms 328 KB Output is correct
18 Correct 9 ms 328 KB Output is correct
19 Partially correct 8 ms 328 KB Output is partially correct
20 Correct 8 ms 328 KB Output is correct
21 Correct 8 ms 328 KB Output is correct
22 Partially correct 7 ms 328 KB Output is partially correct
23 Correct 7 ms 456 KB Output is correct
24 Correct 5 ms 332 KB Output is correct
25 Partially correct 7 ms 396 KB Output is partially correct
26 Partially correct 8 ms 388 KB Output is partially correct
27 Partially correct 8 ms 328 KB Output is partially correct
28 Partially correct 8 ms 328 KB Output is partially correct
29 Partially correct 7 ms 328 KB Output is partially correct
30 Partially correct 6 ms 408 KB Output is partially correct
31 Partially correct 7 ms 404 KB Output is partially correct
32 Partially correct 9 ms 328 KB Output is partially correct
33 Partially correct 8 ms 328 KB Output is partially correct
34 Partially correct 8 ms 456 KB Output is partially correct
35 Partially correct 8 ms 384 KB Output is partially correct
36 Partially correct 7 ms 392 KB Output is partially correct
37 Partially correct 8 ms 328 KB Output is partially correct
38 Partially correct 9 ms 396 KB Output is partially correct
39 Partially correct 7 ms 400 KB Output is partially correct
40 Partially correct 8 ms 380 KB Output is partially correct
41 Partially correct 8 ms 328 KB Output is partially correct
42 Partially correct 8 ms 328 KB Output is partially correct
43 Partially correct 8 ms 396 KB Output is partially correct
44 Partially correct 9 ms 404 KB Output is partially correct
45 Partially correct 8 ms 392 KB Output is partially correct
46 Partially correct 8 ms 328 KB Output is partially correct
47 Partially correct 8 ms 328 KB Output is partially correct
48 Partially correct 9 ms 328 KB Output is partially correct
49 Partially correct 8 ms 384 KB Output is partially correct
50 Partially correct 8 ms 396 KB Output is partially correct
51 Partially correct 8 ms 404 KB Output is partially correct
52 Partially correct 7 ms 328 KB Output is partially correct
53 Partially correct 9 ms 328 KB Output is partially correct
54 Partially correct 8 ms 456 KB Output is partially correct
55 Partially correct 8 ms 400 KB Output is partially correct
56 Partially correct 8 ms 328 KB Output is partially correct
57 Partially correct 8 ms 328 KB Output is partially correct
58 Partially correct 8 ms 328 KB Output is partially correct
59 Partially correct 7 ms 328 KB Output is partially correct
60 Partially correct 8 ms 328 KB Output is partially correct
61 Partially correct 8 ms 384 KB Output is partially correct
62 Correct 1 ms 200 KB Output is correct
63 Correct 1 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 1 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 200 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 200 KB Output is correct
89 Correct 1 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct