oj.uz

답안 #434763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434763 2021-06-21T18:13:18 Z arayi 버섯 세기 (IOI20_mushrooms) C++17
92.2449 / 100
 9 ms 340 KB 
#include "mushrooms.h"
#include <iostream>
#include <vector>
#define ad push_back
using namespace std;
 
int n;
vector<int> a, b, p;
int sm;
int count_mushrooms(int n) 
{
	::n = n;
	if(n < 226)
	{
		p.ad(0);
		for (int i = 1; i < n; i++)
		{
			p.ad(i);
			if(use_machine(p) == 0) sm++;
			p.pop_back();
		}
		return sm + 1;
	}
	a.ad(0);
	p.ad(0); p.ad(1);
	if(use_machine(p)) b.ad(1);
	else a.ad(1);
	p.pop_back(); p.ad(2);
	if(use_machine(p)) b.ad(2);
	else a.ad(2);
	p.pop_back();
	int i;
	for (i = 3; i <= 144; i+=2)
	{
		p.clear();
		if(a.size() >= b.size())
		{
			p.ad(a[0]), p.ad(i);
			p.ad(a[1]), p.ad(i+1);
			int s = use_machine(p);
			if(s%2==1) b.ad(i+1);
			else a.ad(i+1);
			if(s>=2) b.ad(i);
			else a.ad(i);
		}
		else
		{
			p.ad(b[0]), p.ad(i);
			p.ad(b[1]), p.ad(i+1);
			int s = use_machine(p);
			if(s%2==1) a.ad(i+1);
			else b.ad(i+1);
			if(s>=2) a.ad(i);
			else b.ad(i);
		}
	}
	sm = a.size();
	for (;i < n;)
	{
		p.clear();
		if(a.size() >= b.size())
		{
			int k = min((int)a.size(), n-i);
			for (int j = 0; j < k; j++)
				p.ad(a[j]), p.ad(i+j);
			int s = use_machine(p);
			if(s%2==1) b.ad(i+k-1), s--;
			else a.ad(i+k-1), sm++;
			k--, s/=2; sm+=k-s; i+=k+1;
		}
		else
		{
			int k = min((int)b.size(), n-i);
			for (int j = 0; j < k; j++)
				p.ad(b[j]), p.ad(i+j);
			int s = use_machine(p);
			if(s%2==1) a.ad(i+k-1), s--, sm++;
			else b.ad(i+k-1);
			s/=2; sm+=s; i+=k;
		}
	}
	return sm;	
}

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