oj.uz

답안 #1052291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052291 2024-08-10T13:04:53 Z TahirAliyev 버섯 세기 (IOI20_mushrooms) C++17
80.427 / 100
 7 ms 760 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define all(v) v.begin(), v.end()
#define oo 1e9
int B = 141;
	
int count_mushrooms(int n){
	pair<double, int> best = {oo, 0};
	for(int x = 3; x <= n; x++){
		best = min(best, {(double)x + (double)n / x, x});
	}
	B = best.second;
	vector<int> id;		
	for(int i = 0; i < n; i++) id.push_back(i);
	random_shuffle(id.begin() + 1, id.end());
	vector<int> v[2];
	v[0] = {0};
	int i = 1;
	for(; i < min(3, n); i++){
		v[use_machine({0, id[i]})].push_back(i);
	}
	int t = (v[0].size() < v[1].size());
	for(; i + 1 < n && (int)max(v[0].size(), v[1].size()) < B; i += 2){
		int a = use_machine({id[i], id[v[t][0]], id[i + 1], id[v[t][1]]}); 
		v[t ^ (a & 1)].push_back(i);
		v[t ^ bool(a & 2)].push_back(i + 1);
	}
	if(i == n - 1){
		v[use_machine({0, id[i]})].push_back(i);
		i++;
	}
	int ans = v[0].size();
	if(i == n) return ans;
	t = (v[0].size() < v[1].size());
	while(i < n){
		vector<int> tmp;
		for(int j = 0; j < v[t].size() && i < n; j++, i++){
			tmp.push_back(id[v[t][j]]);
			tmp.push_back(id[i]);
		}
		if(t) ans += (use_machine(tmp) + 1) / 2;
		else ans += (tmp.size() / 2) - (use_machine(tmp) + 1) / 2;
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   for(int j = 0; j < v[t].size() && i < n; j++, i++){
      |                  ~~^~~~~~~~~~~~~

Subtask #1
80.427 / 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 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Partially correct 5 ms 600 KB Output is partially correct
11 Partially correct 5 ms 600 KB Output is partially correct
12 Partially correct 5 ms 600 KB Output is partially correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Partially correct 4 ms 600 KB Output is partially correct
16 Partially correct 5 ms 596 KB Output is partially correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Partially correct 4 ms 600 KB Output is partially correct
20 Partially correct 5 ms 600 KB Output is partially correct
21 Partially correct 3 ms 600 KB Output is partially correct
22 Partially correct 5 ms 600 KB Output is partially correct
23 Partially correct 4 ms 600 KB Output is partially correct
24 Correct 3 ms 344 KB Output is correct
25 Partially correct 4 ms 600 KB Output is partially correct
26 Partially correct 5 ms 600 KB Output is partially correct
27 Partially correct 3 ms 600 KB Output is partially correct
28 Partially correct 4 ms 600 KB Output is partially correct
29 Partially correct 3 ms 600 KB Output is partially correct
30 Partially correct 3 ms 600 KB Output is partially correct
31 Partially correct 5 ms 600 KB Output is partially correct
32 Partially correct 4 ms 600 KB Output is partially correct
33 Partially correct 3 ms 600 KB Output is partially correct
34 Partially correct 5 ms 600 KB Output is partially correct
35 Partially correct 4 ms 600 KB Output is partially correct
36 Partially correct 5 ms 600 KB Output is partially correct
37 Partially correct 5 ms 600 KB Output is partially correct
38 Partially correct 4 ms 600 KB Output is partially correct
39 Partially correct 6 ms 600 KB Output is partially correct
40 Partially correct 4 ms 600 KB Output is partially correct
41 Partially correct 4 ms 600 KB Output is partially correct
42 Partially correct 4 ms 600 KB Output is partially correct
43 Partially correct 4 ms 600 KB Output is partially correct
44 Partially correct 3 ms 600 KB Output is partially correct
45 Partially correct 4 ms 600 KB Output is partially correct
46 Partially correct 3 ms 600 KB Output is partially correct
47 Partially correct 3 ms 760 KB Output is partially correct
48 Partially correct 4 ms 600 KB Output is partially correct
49 Partially correct 4 ms 600 KB Output is partially correct
50 Partially correct 4 ms 600 KB Output is partially correct
51 Partially correct 6 ms 600 KB Output is partially correct
52 Partially correct 3 ms 600 KB Output is partially correct
53 Partially correct 7 ms 488 KB Output is partially correct
54 Partially correct 4 ms 600 KB Output is partially correct
55 Partially correct 4 ms 600 KB Output is partially correct
56 Partially correct 3 ms 600 KB Output is partially correct
57 Partially correct 3 ms 600 KB Output is partially correct
58 Partially correct 3 ms 600 KB Output is partially correct
59 Partially correct 3 ms 600 KB Output is partially correct
60 Partially correct 6 ms 600 KB Output is partially correct
61 Partially correct 5 ms 600 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 1 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 1 ms 344 KB Output is correct
71 Correct 0 ms 596 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 596 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 504 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 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 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 1 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct