oj.uz

답안 #1052388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052388 2024-08-10T14:13:00 Z aykhn 버섯 세기 (IOI20_mushrooms) C++17
0 / 100
 6 ms 852 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

int B = 137;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int count_mushrooms(int n) 
{
	vector<int> v[2];
	vector<int> o(n);
	iota(o.begin(), o.end(), 0);
	shuffle(o.begin() + 1, o.end(), rng);
	v[0] = {0};
	int i = 1;
	while (max(v[0].size(), v[1].size()) < 2) v[use_machine({0, o[i]})].push_back(o[i]), i++;
	for (; i < n && max(v[0].size(), v[1].size()) < B + 1; i += 2) 
	{
		if (i + 1 < n)
		{
			if (v[0].size() >= 2)
			{
				int x = use_machine({v[0][0], o[i], v[0][1], o[i + 1]});
				v[x >> 1 & 1].push_back(o[i]);
				v[x & 1].push_back(o[i + 1]);
			}
			else
			{
				int x = use_machine({v[1][0], o[i], v[1][1], o[i + 1]});
				v[1 ^ (x >> 1 & 1)].push_back(o[i]);
				v[1 ^ (x & 1)].push_back(o[i + 1]);
			}
		}
		else v[use_machine({0, o[i]})].push_back(o[i]);
	}
	int res = 0;
	for (int j = i; j < n; j += B)
	{
		vector<int> q;
		int sz = min(n, j + B) - j;
		for (int k = j; k < min(n, j + B); k++)
		{
			if (v[0].size() > v[1].size())
			{
				q.push_back(v[0][k - j]);
				q.push_back(o[k]);
			}
			else
			{
				q.push_back(v[1][k - j]);
				q.push_back(o[k]);
			}
		}
		if (v[0].size() > v[1].size())
		{
			q.push_back(v[0].back());
			res += sz - (use_machine(q) / 2);
		}
		else
		{
			q.push_back(v[1].back());
			res += use_machine(q) / 2;
		}
	}
	return res + v[0].size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:19:48: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   19 |  for (; i < n && max(v[0].size(), v[1].size()) < B + 1; i += 2)
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 4 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 3 ms 344 KB Output is partially correct
12 Partially correct 4 ms 344 KB Output is partially correct
13 Correct 3 ms 344 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 4 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 Partially correct 3 ms 344 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Partially correct 5 ms 344 KB Output is partially correct
24 Correct 2 ms 600 KB Output is correct
25 Partially correct 3 ms 344 KB Output is partially correct
26 Partially correct 4 ms 344 KB Output is partially correct
27 Partially correct 3 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 3 ms 424 KB Output is partially correct
31 Partially correct 3 ms 344 KB Output is partially correct
32 Partially correct 4 ms 600 KB Output is partially correct
33 Partially correct 5 ms 344 KB Output is partially correct
34 Partially correct 3 ms 596 KB Output is partially correct
35 Partially correct 3 ms 344 KB Output is partially correct
36 Partially correct 6 ms 344 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 5 ms 344 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 3 ms 524 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 3 ms 344 KB Output is partially correct
44 Partially correct 4 ms 344 KB Output is partially correct
45 Partially correct 3 ms 524 KB Output is partially correct
46 Partially correct 4 ms 344 KB Output is partially correct
47 Partially correct 3 ms 600 KB Output is partially correct
48 Partially correct 4 ms 600 KB Output is partially correct
49 Partially correct 4 ms 852 KB Output is partially correct
50 Partially correct 3 ms 344 KB Output is partially correct
51 Partially correct 4 ms 344 KB Output is partially correct
52 Partially correct 3 ms 344 KB Output is partially correct
53 Partially correct 3 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 408 KB Output is partially correct
57 Partially correct 5 ms 344 KB Output is partially correct
58 Partially correct 4 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 600 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Incorrect 0 ms 344 KB Duplicate value 0 in the query array.
64 Halted 0 ms 0 KB -