oj.uz

답안 #800706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800706 2023-08-01T18:35:59 Z FEDIKUS 버섯 세기 (IOI20_mushrooms) C++17
92.2449 / 100
 7 ms 348 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn=20010;

int count_mushrooms(int n) {
	vector<int> aovi={0};
	vector<int> bovi;
	int ret=1;
	int w=100;
	for(int i=1;i<n;i++){
		if(max(aovi.size(),bovi.size())<2){
			int sta=use_machine({0,i});
			if(sta==1) bovi.push_back(i);
			else aovi.push_back(i);
			ret=aovi.size();
			continue;
		}

		bool zamenio=false;
		if(bovi.size()>=aovi.size()){swap(aovi,bovi); zamenio=true;}
		int uzimam=int(aovi.size())>=w ? int(aovi.size()):2;

		vector<int> tmp;
		for(int j=i;j<min(i+uzimam,n);j++){
			tmp.push_back(aovi[j-i]);
			tmp.push_back(j);
		}
		int klkb=use_machine(tmp);
		i+=uzimam-1;
		int bio=klkb;
		if(klkb&1) bovi.push_back(tmp.back());
		else aovi.push_back(tmp.back());
		klkb=klkb/2+(klkb&1);
		int klka=tmp.size()/2-klkb;
		ret+=(zamenio ? klkb:klka);
		if(bio&1) klkb--;
		if(klkb==int(tmp.size())/2-1) for(int j=1;j<int(tmp.size())-1;j+=2) bovi.push_back(tmp[j]);
		else if(klkb==0) for(int j=1;j<int(tmp.size())-1;j+=2) aovi.push_back(tmp[j]);

		if(zamenio) swap(aovi,bovi);
	}
	return ret;
}

Subtask #1
92.2449 / 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 348 KB Output is correct
8 Correct 4 ms 328 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Partially correct 7 ms 344 KB Output is partially correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 4 ms 316 KB Output is correct
15 Partially correct 7 ms 316 KB Output is partially correct
16 Partially correct 7 ms 312 KB Output is partially correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Partially correct 5 ms 320 KB Output is partially correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 7 ms 308 KB Output is correct
22 Partially correct 7 ms 308 KB Output is partially correct
23 Correct 5 ms 208 KB Output is correct
24 Correct 3 ms 304 KB Output is correct
25 Partially correct 5 ms 208 KB Output is partially correct
26 Partially correct 6 ms 324 KB Output is partially correct
27 Partially correct 6 ms 208 KB Output is partially correct
28 Partially correct 6 ms 312 KB Output is partially correct
29 Partially correct 6 ms 312 KB Output is partially correct
30 Partially correct 4 ms 324 KB Output is partially correct
31 Partially correct 5 ms 316 KB Output is partially correct
32 Partially correct 6 ms 208 KB Output is partially correct
33 Partially correct 4 ms 324 KB Output is partially correct
34 Partially correct 7 ms 208 KB Output is partially correct
35 Partially correct 6 ms 208 KB Output is partially correct
36 Partially correct 4 ms 324 KB Output is partially correct
37 Partially correct 5 ms 308 KB Output is partially correct
38 Partially correct 5 ms 208 KB Output is partially correct
39 Partially correct 7 ms 312 KB Output is partially correct
40 Partially correct 5 ms 308 KB Output is partially correct
41 Partially correct 7 ms 320 KB Output is partially correct
42 Partially correct 6 ms 304 KB Output is partially correct
43 Partially correct 4 ms 328 KB Output is partially correct
44 Partially correct 5 ms 208 KB Output is partially correct
45 Partially correct 6 ms 316 KB Output is partially correct
46 Partially correct 5 ms 312 KB Output is partially correct
47 Partially correct 5 ms 312 KB Output is partially correct
48 Partially correct 5 ms 324 KB Output is partially correct
49 Partially correct 6 ms 324 KB Output is partially correct
50 Partially correct 6 ms 208 KB Output is partially correct
51 Partially correct 7 ms 316 KB Output is partially correct
52 Partially correct 6 ms 208 KB Output is partially correct
53 Partially correct 4 ms 324 KB Output is partially correct
54 Partially correct 5 ms 208 KB Output is partially correct
55 Partially correct 6 ms 208 KB Output is partially correct
56 Partially correct 4 ms 324 KB Output is partially correct
57 Partially correct 5 ms 208 KB Output is partially correct
58 Partially correct 7 ms 208 KB Output is partially correct
59 Partially correct 6 ms 312 KB Output is partially correct
60 Partially correct 5 ms 208 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 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 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 0 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 220 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 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 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 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