oj.uz

답안 #312991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312991 2020-10-14T22:24:07 Z kobus 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 10 ms 640 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#include "mushrooms.h"


int count_mushrooms(int n){
	vector<int> s[2]={{0},{}};
	int nn[2]={0,0};
	vector<int> ns;
	for(int i=1;i<n;i++)ns.pb(i);
	int k=85;
	while(ns.size()>0){
		if(k>0 && ns.size()>1 && max(s[0].size(),s[1].size())>1){
			k--;
			int a=ns[ns.size()-1];
			int b=ns[ns.size()-2];
			ns.pop_back();
			ns.pop_back();
			bool si=1;
			if(s[0].size()>s[1].size())si=0;
			vector<int> v={s[si][0],a,s[si][1],b};
			int x=use_machine(v);
			if(x%2)s[!si].pb(b);
			else s[si].pb(b);
			x=x/2;
			if(x%2)s[!si].pb(a);
			else s[si].pb(a);
		}
		else{
			bool si=1;
			if(s[0].size()>s[1].size())si=0;
			int tam=min(s[si].size(),ns.size());
			vector<int> v(2*tam);
			for(int i=0;i<tam;i++){
				v[2*i]=s[si][i];
			}
			for(int i=0;i<tam;i++){
				v[2*i+1]=ns[ns.size()-i-1];
			}
			for(int i=0;i<tam;i++)ns.pop_back();
			int x=use_machine(v);
			if(x%2)s[!si].pb(v[2*tam-1]);
			else s[si].pb(v[2*tam-1]);
			x=x/2;
			nn[!si]+=x;
			nn[si]+=tam-1-x;
		}
	}
	return s[0].size()+nn[0];
}

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Partially correct 8 ms 512 KB Output is partially correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Partially correct 6 ms 512 KB Output is partially correct
16 Partially correct 7 ms 512 KB Output is partially correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 10 ms 640 KB Output is correct
19 Partially correct 9 ms 512 KB Output is partially correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Partially correct 8 ms 512 KB Output is partially correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Partially correct 7 ms 512 KB Output is partially correct
26 Partially correct 7 ms 512 KB Output is partially correct
27 Partially correct 7 ms 512 KB Output is partially correct
28 Partially correct 7 ms 512 KB Output is partially correct
29 Partially correct 7 ms 512 KB Output is partially correct
30 Partially correct 7 ms 512 KB Output is partially correct
31 Partially correct 8 ms 512 KB Output is partially correct
32 Partially correct 9 ms 640 KB Output is partially correct
33 Partially correct 6 ms 512 KB Output is partially correct
34 Partially correct 7 ms 512 KB Output is partially correct
35 Partially correct 9 ms 512 KB Output is partially correct
36 Partially correct 8 ms 512 KB Output is partially correct
37 Partially correct 9 ms 512 KB Output is partially correct
38 Partially correct 7 ms 512 KB Output is partially correct
39 Partially correct 7 ms 512 KB Output is partially correct
40 Partially correct 7 ms 512 KB Output is partially correct
41 Partially correct 7 ms 512 KB Output is partially correct
42 Partially correct 7 ms 512 KB Output is partially correct
43 Partially correct 7 ms 512 KB Output is partially correct
44 Partially correct 6 ms 512 KB Output is partially correct
45 Partially correct 7 ms 512 KB Output is partially correct
46 Partially correct 9 ms 512 KB Output is partially correct
47 Partially correct 9 ms 512 KB Output is partially correct
48 Partially correct 9 ms 512 KB Output is partially correct
49 Partially correct 7 ms 512 KB Output is partially correct
50 Partially correct 7 ms 512 KB Output is partially correct
51 Partially correct 7 ms 512 KB Output is partially correct
52 Partially correct 7 ms 512 KB Output is partially correct
53 Partially correct 9 ms 512 KB Output is partially correct
54 Partially correct 7 ms 512 KB Output is partially correct
55 Partially correct 7 ms 512 KB Output is partially correct
56 Partially correct 8 ms 512 KB Output is partially correct
57 Partially correct 7 ms 512 KB Output is partially correct
58 Partially correct 7 ms 512 KB Output is partially correct
59 Partially correct 7 ms 512 KB Output is partially correct
60 Partially correct 7 ms 512 KB Output is partially correct
61 Partially correct 6 ms 512 KB Output is partially correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 1 ms 256 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 0 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 1 ms 256 KB Output is correct
74 Correct 0 ms 256 KB Output is correct
75 Correct 1 ms 256 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 0 ms 256 KB Output is correct
81 Correct 0 ms 256 KB Output is correct
82 Correct 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 1 ms 256 KB Output is correct
87 Correct 0 ms 256 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct