oj.uz

답안 #590660

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590660 2022-07-06T08:25:19 Z Lucpp 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 9 ms 344 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

int count_mushrooms(int n) {
	int ans = 1;
	vector<int> a{0}, b;
	for(int j = 1; j < min(3, n); j++){
		if(use_machine({0, j})) b.push_back(j);
		else ans++, a.push_back(j);
	}
	int i = 3;
	for(int j = 0; j < 73 && n-i >= 2; j++){
		if(a.size() >= 2){
			int x = use_machine({a[0], i, a[1], i+1});
			if(x & 2) b.push_back(i);
			else ans++, a.push_back(i);
			if(x & 1) b.push_back(i+1);
			else ans++, a.push_back(i+1);
		}
		else{
			int x = use_machine({b[0], i, b[1], i+1});
			if(x & 2) ans++, a.push_back(i);
			else b.push_back(i);
			if(x & 1) ans++, a.push_back(i+1);
			else b.push_back(i+1);
		}
		i += 2;
	}
	while(i < n){
		if(a.size() > b.size()){
			int s = min((int)a.size(), n-i);
			vector<int> m;
			int k = 0;
			for(int j = i; j < i+s; j++){
				m.push_back(a[k++]);
				m.push_back(j);
			}
			int x = use_machine(m);
			ans += s-(x+1)/2;
			if(x%2 == 0) a.push_back(i+s-1);
			else b.push_back(i+s-1);
			i += s;
		}
		else{
			int s = min((int)b.size(), n-i);
			vector<int> m;
			int k = 0;
			for(int j = i; j < i+s; j++){
				m.push_back(b[k++]);
				m.push_back(j);
			}
			int x = use_machine(m);
			ans += (x+1)/2;
			if(x%2 == 0) b.push_back(i+s-1);
			else a.push_back(i+s-1);
			i += s;
		}
	}
	return ans;
}

Subtask #1
92.623 / 100.0

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