oj.uz

답안 #303713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303713 2020-09-20T15:03:02 Z aljasdlas 버섯 세기 (IOI20_mushrooms) C++14
25 / 100
 147 ms 416 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

int count_mushrooms(int n) {
	if(n < 220) {
		int B = 0;
		for(int i = 1; i < n; i++) {
			B += use_machine({0, i});
		}
		return n-B;
	}

	vector<int> A, B;
	A = {0};
	if(use_machine({0,1})) B.push_back(1);
	else A.push_back(1);
	if(use_machine({0,2})) B.push_back(2);
	else A.push_back(2);

	if(B.size() > A.size()) swap(A,B);

	for(int i = 3; i < n && A.size()*A.size() < (n-A.size()-B.size()) && B.size()*B.size() < (n-A.size()-B.size()) && (n-A.size()-B.size())/A.size() < (n-A.size()-B.size()-2)/(A.size()) && (n-A.size()-B.size())/B.size() < (n-A.size()-B.size()-2)/(B.size()); i+=2) {
		vector<int> cur;
		cur.push_back(A[0]);
		cur.push_back(i);
		cur.push_back(A[1]);
		if(i+1 < n) cur.push_back(i+1);

		// for(auto x: cur) cerr << x << " ";
		// cerr << endl;
		int res = use_machine(cur);

		if(res & 2) B.push_back(i);
		else A.push_back(i);

		if(i+1 < n) {
			if(res & 1) B.push_back(i+1);
			else A.push_back(i+1);
		}
	}

	if(B.size() > A.size()) swap(A,B);

	int countA = 0;
	int countB = 0;
	for(int i = A.size()+B.size(); i < n; i+=A.size()) {
		vector<int> cur;
		int j = 0;
		for(j = 0; i+j < n && j < A.size(); j++) {
			cur.push_back(A[j]);
			cur.push_back(i+j);
		}

		// for(auto x: cur) cerr << x << " ";
		// cerr << ": ";
		int res = use_machine(cur);
		countB += (res+1)/2;
		countA += j - ((res+1)/2);
		// cerr << res << " -> " << countA << " " << countA << endl;;
	}

	if(A[0] == 0) return A.size()+countA;
	else return B.size()+countB;
}

Compilation message

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

Subtask #1
25.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Partially correct 10 ms 384 KB Output is partially correct
7 Partially correct 92 ms 388 KB Output is partially correct
8 Partially correct 80 ms 256 KB Output is partially correct
9 Partially correct 121 ms 256 KB Output is partially correct
10 Partially correct 112 ms 416 KB Output is partially correct
11 Partially correct 56 ms 256 KB Output is partially correct
12 Partially correct 100 ms 256 KB Output is partially correct
13 Partially correct 110 ms 256 KB Output is partially correct
14 Partially correct 30 ms 256 KB Output is partially correct
15 Partially correct 105 ms 384 KB Output is partially correct
16 Partially correct 124 ms 256 KB Output is partially correct
17 Partially correct 62 ms 256 KB Output is partially correct
18 Partially correct 130 ms 320 KB Output is partially correct
19 Partially correct 102 ms 256 KB Output is partially correct
20 Partially correct 51 ms 256 KB Output is partially correct
21 Partially correct 107 ms 256 KB Output is partially correct
22 Partially correct 87 ms 256 KB Output is partially correct
23 Partially correct 83 ms 384 KB Output is partially correct
24 Partially correct 41 ms 256 KB Output is partially correct
25 Partially correct 117 ms 256 KB Output is partially correct
26 Partially correct 61 ms 256 KB Output is partially correct
27 Partially correct 73 ms 256 KB Output is partially correct
28 Partially correct 87 ms 256 KB Output is partially correct
29 Partially correct 147 ms 256 KB Output is partially correct
30 Partially correct 88 ms 256 KB Output is partially correct
31 Partially correct 76 ms 256 KB Output is partially correct
32 Partially correct 125 ms 256 KB Output is partially correct
33 Partially correct 76 ms 256 KB Output is partially correct
34 Partially correct 69 ms 256 KB Output is partially correct
35 Partially correct 122 ms 256 KB Output is partially correct
36 Partially correct 100 ms 256 KB Output is partially correct
37 Partially correct 115 ms 256 KB Output is partially correct
38 Partially correct 113 ms 256 KB Output is partially correct
39 Partially correct 105 ms 256 KB Output is partially correct
40 Partially correct 108 ms 256 KB Output is partially correct
41 Partially correct 63 ms 256 KB Output is partially correct
42 Partially correct 122 ms 308 KB Output is partially correct
43 Partially correct 135 ms 360 KB Output is partially correct
44 Partially correct 134 ms 256 KB Output is partially correct
45 Partially correct 127 ms 288 KB Output is partially correct
46 Partially correct 94 ms 256 KB Output is partially correct
47 Partially correct 57 ms 256 KB Output is partially correct
48 Partially correct 83 ms 256 KB Output is partially correct
49 Partially correct 97 ms 256 KB Output is partially correct
50 Partially correct 87 ms 256 KB Output is partially correct
51 Partially correct 99 ms 256 KB Output is partially correct
52 Partially correct 82 ms 256 KB Output is partially correct
53 Partially correct 108 ms 304 KB Output is partially correct
54 Partially correct 135 ms 256 KB Output is partially correct
55 Partially correct 133 ms 256 KB Output is partially correct
56 Partially correct 93 ms 256 KB Output is partially correct
57 Partially correct 114 ms 256 KB Output is partially correct
58 Partially correct 97 ms 384 KB Output is partially correct
59 Partially correct 99 ms 256 KB Output is partially correct
60 Partially correct 104 ms 256 KB Output is partially correct
61 Partially correct 113 ms 256 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 0 ms 256 KB Output is correct
67 Correct 0 ms 256 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 0 ms 256 KB Output is correct
74 Correct 1 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 1 ms 256 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 1 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 1 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 0 ms 256 KB Output is correct
87 Correct 1 ms 288 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct