oj.uz

답안 #1018978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018978 2024-07-10T11:28:14 Z j_vdd16 버섯 세기 (IOI20_mushrooms) C++17
56.2189 / 100
 8 ms 608 KB 
#include "mushrooms.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

//int use_machine(vi x);

int count_mushrooms(int n)
{
	vi a = { 0 };
	vi b;

	int i = 1;
	for (; i < n; i++)
	{
		int res = use_machine({ 0, i });
		if (res == 0)
			a.push_back(i);
		else
			b.push_back(i);

		if (a.size() >= 2 && 2 * a.size() * a.size() >= n)
			break;

		if (b.size() >= 2 && 2 * b.size() * b.size() >= n)
			break;
	}
	i++;

	int result = a.size();
	if (a.size() > b.size())
	{
		int sq = a.size();
		while (i < n)
		{
			vi ask;
			int asked = min(sq, n - i);
			loop(j, asked)
			{
				ask.push_back(a[j]);
				ask.push_back(i++);
			}

			int res = use_machine(ask);
			result += asked - res / 2 - res % 2;
		}
	}
	else
	{
		int sq = b.size();
		while (i < n)
		{
			vi ask;
			loop(j, min(sq, n - i))
			{
				ask.push_back(b[j]);
				ask.push_back(i++);
			}

			int res = use_machine(ask);
			result += res / 2 + res % 2;
		}
	}

	//226 ~ log_2(20000)^2
	//226 / Q * 100 = 52,68
	//226 * 100 / 52,68 = 429

	//S = 2 * sqrt(n);
	//S + (n - S) / sqrt(n)
	//2sqrt(n) + sqrt(n) - 2
	//3sqrt(n)

	//min: 2 * n^x + (n - 2 * n^x) / n^x
	//min: 2 * n^x + n^(1 - x) >= 2 * sqrt(2 * n)
	return result;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:49:48: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |   if (a.size() >= 2 && 2 * a.size() * a.size() >= n)
      |                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~
mushrooms.cpp:52:48: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |   if (b.size() >= 2 && 2 * b.size() * b.size() >= n)
      |                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
56.2189 / 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 1 ms 340 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Partially correct 4 ms 444 KB Output is partially correct
8 Partially correct 3 ms 344 KB Output is partially correct
9 Partially correct 5 ms 344 KB Output is partially correct
10 Partially correct 4 ms 344 KB Output is partially correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Partially correct 4 ms 344 KB Output is partially correct
13 Partially correct 5 ms 344 KB Output is partially correct
14 Partially correct 3 ms 344 KB Output is partially correct
15 Partially correct 4 ms 344 KB Output is partially correct
16 Partially correct 7 ms 344 KB Output is partially correct
17 Partially correct 2 ms 344 KB Output is partially correct
18 Partially correct 5 ms 344 KB Output is partially correct
19 Partially correct 5 ms 344 KB Output is partially correct
20 Partially correct 5 ms 444 KB Output is partially correct
21 Partially correct 6 ms 344 KB Output is partially correct
22 Partially correct 4 ms 344 KB Output is partially correct
23 Partially correct 6 ms 344 KB Output is partially correct
24 Partially correct 2 ms 344 KB Output is partially correct
25 Partially correct 6 ms 344 KB Output is partially correct
26 Partially correct 5 ms 344 KB Output is partially correct
27 Partially correct 4 ms 344 KB Output is partially correct
28 Partially correct 4 ms 440 KB Output is partially correct
29 Partially correct 6 ms 344 KB Output is partially correct
30 Partially correct 4 ms 344 KB Output is partially correct
31 Partially correct 4 ms 440 KB Output is partially correct
32 Partially correct 4 ms 344 KB Output is partially correct
33 Partially correct 7 ms 344 KB Output is partially correct
34 Partially correct 4 ms 344 KB Output is partially correct
35 Partially correct 8 ms 344 KB Output is partially correct
36 Partially correct 7 ms 344 KB Output is partially correct
37 Partially correct 7 ms 344 KB Output is partially correct
38 Partially correct 5 ms 344 KB Output is partially correct
39 Partially correct 7 ms 340 KB Output is partially correct
40 Partially correct 4 ms 344 KB Output is partially correct
41 Partially correct 6 ms 440 KB Output is partially correct
42 Partially correct 4 ms 340 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 7 ms 344 KB Output is partially correct
45 Partially correct 7 ms 344 KB Output is partially correct
46 Partially correct 4 ms 344 KB Output is partially correct
47 Partially correct 6 ms 344 KB Output is partially correct
48 Partially correct 5 ms 344 KB Output is partially correct
49 Partially correct 7 ms 344 KB Output is partially correct
50 Partially correct 6 ms 344 KB Output is partially correct
51 Partially correct 5 ms 608 KB Output is partially correct
52 Partially correct 5 ms 344 KB Output is partially correct
53 Partially correct 5 ms 344 KB Output is partially correct
54 Partially correct 4 ms 440 KB Output is partially correct
55 Partially correct 4 ms 344 KB Output is partially correct
56 Partially correct 5 ms 344 KB Output is partially correct
57 Partially correct 4 ms 344 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 4 ms 428 KB Output is partially correct
60 Partially correct 7 ms 344 KB Output is partially correct
61 Partially correct 4 ms 344 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 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 0 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 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 1 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct