oj.uz

답안 #830832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830832 2023-08-19T11:07:19 Z amunduzbaev 버섯 세기 (IOI20_mushrooms) C++17
87.5969 / 100
 8 ms 312 KB 
#include "mushrooms.h"

#include "bits/stdc++.h"
using namespace std;

#define ar array
typedef long long ll;
//~ #define int ll

const int N = 20'000;

int count_mushrooms(int n){
	vector<int> p[2];
	p[0].push_back(0);
	
	int B = 2;
	
	int last = 1;
	for(int i=1;i<n && max((int)p[0].size(), (int)p[1].size()) < B;i++){
		last++;
		if(use_machine({0, i})) p[1].push_back(i);
		else p[0].push_back(i);
	}
	
	B = 143;
	for(int i=last;i + 1<n && max((int)p[0].size(), (int)p[1].size()) < B;){
		int j = i + 1, id = 0;
		if((int)p[id].size() < 2) id = 1;
		
		int c = use_machine({i, p[id][0], j, p[id][1]});
		if(c == 0) p[id].push_back(i), p[id].push_back(j);
		if(c == 1) p[!id].push_back(i), p[id].push_back(j);
		if(c == 2) p[id].push_back(i), p[!id].push_back(j);
		if(c == 3) p[!id].push_back(i), p[!id].push_back(j);
		
		i = j + 1;
		last = i;
	}
	
	ar<int, 2> cc {};
	cc[0] = p[0].size(), cc[1] = p[1].size();
	
	for(int i=last;i<n;){
		int B = p[0].size(); 
		bool is = 1;
		if((int)p[1].size() > B) is = 0, B = p[1].size();
		
		int j = min(i + B, n);
		
		vector<int> qq;
		for(int k=i;k<j;k++){
			qq.push_back(p[is ^ 1][k - i]);
			qq.push_back(k);
		}
		
		int c = use_machine(qq);
		if(c & 1) cc[is]++, p[is].push_back(j - 1), c--;
		else cc[is ^ 1]++, p[is ^ 1].push_back(j - 1);
		i++;
		
		cc[is] += (c + 1) / 2, cc[is ^ 1] += (j - i - (c + 1) / 2);
		i = j;
	}
	
	return cc[0];
}

Subtask #1
87.5969 / 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 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 308 KB Output is correct
11 Partially correct 5 ms 308 KB Output is partially correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 4 ms 308 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Partially correct 5 ms 312 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 7 ms 208 KB Output is partially correct
20 Correct 5 ms 308 KB Output is correct
21 Correct 6 ms 208 KB Output is correct
22 Partially correct 5 ms 208 KB Output is partially correct
23 Correct 5 ms 308 KB Output is correct
24 Correct 4 ms 208 KB Output is correct
25 Partially correct 5 ms 308 KB Output is partially correct
26 Partially correct 7 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 208 KB Output is partially correct
30 Partially correct 8 ms 208 KB Output is partially correct
31 Partially correct 5 ms 208 KB Output is partially correct
32 Partially correct 6 ms 208 KB Output is partially correct
33 Partially correct 6 ms 304 KB Output is partially correct
34 Partially correct 5 ms 208 KB Output is partially correct
35 Partially correct 5 ms 208 KB Output is partially correct
36 Partially correct 4 ms 312 KB Output is partially correct
37 Partially correct 5 ms 208 KB Output is partially correct
38 Partially correct 4 ms 308 KB Output is partially correct
39 Partially correct 7 ms 208 KB Output is partially correct
40 Partially correct 6 ms 208 KB Output is partially correct
41 Partially correct 7 ms 208 KB Output is partially correct
42 Partially correct 7 ms 208 KB Output is partially correct
43 Partially correct 5 ms 208 KB Output is partially correct
44 Partially correct 7 ms 208 KB Output is partially correct
45 Partially correct 6 ms 208 KB Output is partially correct
46 Partially correct 6 ms 208 KB Output is partially correct
47 Partially correct 7 ms 304 KB Output is partially correct
48 Partially correct 5 ms 208 KB Output is partially correct
49 Partially correct 5 ms 208 KB Output is partially correct
50 Partially correct 7 ms 208 KB Output is partially correct
51 Partially correct 7 ms 208 KB Output is partially correct
52 Partially correct 5 ms 208 KB Output is partially correct
53 Partially correct 7 ms 208 KB Output is partially correct
54 Partially correct 6 ms 208 KB Output is partially correct
55 Partially correct 5 ms 208 KB Output is partially correct
56 Partially correct 5 ms 208 KB Output is partially correct
57 Partially correct 5 ms 208 KB Output is partially correct
58 Partially correct 6 ms 312 KB Output is partially correct
59 Partially correct 5 ms 208 KB Output is partially correct
60 Partially correct 7 ms 304 KB Output is partially correct
61 Partially correct 6 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 1 ms 208 KB Output is correct
65 Correct 1 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 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 1 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