oj.uz

답안 #305932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305932 2020-09-24T05:40:38 Z myungwoo 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 10 ms 384 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
 
int count_mushrooms(int N)
{
	int K = 81;
	vector<int> arr[2] = {{0}, {}};
	int pt = 1;
	// Step 1: Check type of mushroom one by one
	while (pt < N){
		arr[use_machine({0, pt})].push_back(pt);
		pt++;
		if (arr[0].size() >= 2 || arr[1].size() >= 2) break;
	}
	// Step 2: Check type of mushroom two by one
	while (pt < N){
		int t = arr[1].size() >= 2;
		vector<int> test = {arr[t][0], pt, arr[t][1]};
		if (pt+1 < N) test.push_back(pt+1);
		int res = use_machine(test);
		arr[res>>1&1^t].push_back(pt);
		if (pt+1 < N) arr[res&1^t].push_back(pt+1);
		pt += 2;
		if (arr[0].size() >= K || arr[1].size() >= K) break;
	}
	// Step 3: Count number of type 0 mushrooms K by one
	int zero_count = arr[0].size();
	while (pt < N){
		int t = arr[1].size() > arr[0].size();
		vector<int> test;
		for (int i=0;pt+i<N&&i<arr[t].size();i++){
			test.push_back(arr[t][i]);
			test.push_back(pt+i);
		}
		int res = use_machine(test);
		arr[res&1^t].push_back(test.back());
		int cnt = res+1>>1;
		if (!t) cnt = test.size()/2-cnt;
		zero_count += cnt;
		pt += test.size()/2;
	}
	return zero_count;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:22:13: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   22 |   arr[res>>1&1^t].push_back(pt);
      |       ~~~~~~^~
mushrooms.cpp:23:24: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   23 |   if (pt+1 < N) arr[res&1^t].push_back(pt+1);
      |                     ~~~^~
mushrooms.cpp:25:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |   if (arr[0].size() >= K || arr[1].size() >= K) break;
      |       ~~~~~~~~~~~~~~^~~~
mushrooms.cpp:25:43: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |   if (arr[0].size() >= K || arr[1].size() >= K) break;
      |                             ~~~~~~~~~~~~~~^~~~
mushrooms.cpp:32:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   for (int i=0;pt+i<N&&i<arr[t].size();i++){
      |                        ~^~~~~~~~~~~~~~
mushrooms.cpp:37:10: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   37 |   arr[res&1^t].push_back(test.back());
      |       ~~~^~
mushrooms.cpp:38:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |   int cnt = res+1>>1;
      |             ~~~^~

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 7 ms 256 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Correct 7 ms 256 KB Output is correct
11 Partially correct 7 ms 384 KB Output is partially correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 7 ms 256 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Partially correct 7 ms 256 KB Output is partially correct
16 Partially correct 8 ms 384 KB Output is partially correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 9 ms 256 KB Output is correct
19 Partially correct 7 ms 256 KB Output is partially correct
20 Correct 7 ms 256 KB Output is correct
21 Correct 7 ms 256 KB Output is correct
22 Partially correct 8 ms 256 KB Output is partially correct
23 Correct 7 ms 256 KB Output is correct
24 Correct 4 ms 256 KB Output is correct
25 Partially correct 7 ms 256 KB Output is partially correct
26 Partially correct 7 ms 384 KB Output is partially correct
27 Correct 7 ms 256 KB Output is correct
28 Partially correct 7 ms 256 KB Output is partially correct
29 Partially correct 9 ms 384 KB Output is partially correct
30 Partially correct 7 ms 376 KB Output is partially correct
31 Partially correct 7 ms 384 KB Output is partially correct
32 Partially correct 8 ms 256 KB Output is partially correct
33 Partially correct 9 ms 384 KB Output is partially correct
34 Partially correct 8 ms 384 KB Output is partially correct
35 Partially correct 7 ms 256 KB Output is partially correct
36 Partially correct 7 ms 256 KB Output is partially correct
37 Partially correct 7 ms 256 KB Output is partially correct
38 Partially correct 9 ms 256 KB Output is partially correct
39 Partially correct 7 ms 256 KB Output is partially correct
40 Partially correct 8 ms 256 KB Output is partially correct
41 Partially correct 7 ms 256 KB Output is partially correct
42 Partially correct 7 ms 256 KB Output is partially correct
43 Partially correct 7 ms 256 KB Output is partially correct
44 Partially correct 9 ms 256 KB Output is partially correct
45 Partially correct 7 ms 384 KB Output is partially correct
46 Partially correct 9 ms 256 KB Output is partially correct
47 Partially correct 8 ms 256 KB Output is partially correct
48 Partially correct 6 ms 380 KB Output is partially correct
49 Partially correct 7 ms 256 KB Output is partially correct
50 Partially correct 8 ms 256 KB Output is partially correct
51 Partially correct 7 ms 256 KB Output is partially correct
52 Partially correct 10 ms 384 KB Output is partially correct
53 Partially correct 7 ms 256 KB Output is partially correct
54 Partially correct 7 ms 256 KB Output is partially correct
55 Partially correct 9 ms 256 KB Output is partially correct
56 Partially correct 7 ms 384 KB Output is partially correct
57 Partially correct 8 ms 256 KB Output is partially correct
58 Partially correct 8 ms 256 KB Output is partially correct
59 Partially correct 7 ms 256 KB Output is partially correct
60 Partially correct 8 ms 384 KB Output is partially correct
61 Partially correct 7 ms 256 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 1 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 1 ms 256 KB Output is correct
68 Correct 0 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 1 ms 256 KB Output is correct
74 Correct 1 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 1 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 0 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 1 ms 256 KB Output is correct
86 Correct 1 ms 256 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 1 ms 256 KB Output is correct
89 Correct 1 ms 288 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 256 KB Output is correct