oj.uz

답안 #1032229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032229 2024-07-23T13:39:37 Z hotboy2703 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 6 ms 1248 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL<<(i))
ll use(vector <ll> tmp){
	return use_machine(tmp);
}
int count_mushrooms(int n) {
	if (n==2){
		return 2 - use({0,1});
	}
	vector <ll> c[2];
	c[0].push_back(0);
	c[use({0,1})].push_back(1);
	c[use({0,2})].push_back(2);
	ll ptr = 3;
	ll res = 0;
	while (ptr < n){
		if (max(sz(c[0]),sz(c[1])) >= 80){
			ll id = 0;
			if (sz(c[1]) > sz(c[0]))id = 1;
			vector <ll> tmp;
			for (ll j = 0;j < sz(c[id]) && ptr < n;j ++,ptr++){
				tmp.push_back(c[id][j]);
				tmp.push_back(ptr);
			}
			ll cur = use(tmp);
			if (cur%2)c[1-id].push_back(tmp.back());
			else c[id].push_back(tmp.back());
			if (id==1)res += cur/2;
			else res += sz(tmp)/2 - (cur/2+1);
		}
		else{
			if (ptr + 1 < n){
				if (sz(c[0]) >= 2){
					ll tmp = use({ptr,c[0][0],ptr+1,c[0][1]});
					c[BIT(tmp,0)].push_back(ptr);
					c[BIT(tmp,1)].push_back(ptr+1);
				}
				else{
					ll tmp = use({ptr,c[1][0],ptr+1,c[1][1]});
					c[1-BIT(tmp,0)].push_back(ptr);
					c[1-BIT(tmp,1)].push_back(ptr+1);
				}
				ptr+=2;
			}
			else{
				c[use({0,ptr})].push_back(ptr);
				ptr++;
			}
		}
	}
	res += sz(c[0]);
	return res;
}

Subtask #1
92.623 / 100.0

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