oj.uz

답안 #305868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305868 2020-09-24T03:40:38 Z myungwoo 버섯 세기 (IOI20_mushrooms) C++17
92.2449 / 100
 9 ms 384 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)

int count_mushrooms(int N)
{
	const int K = 73;
	int add = 0;
	vector <int> arr[2];
	arr[0] = {0};
	for (int i=1;i<N;i++){
		if (arr[0].size() > arr[1].size() && arr[0].size() >= K){
			vector <int> test;
			for (int j=0;j<arr[0].size()&&i+j<N;j++){
				test.push_back(arr[0][j]);
				test.push_back(i+j);
			}
			int res = use_machine(test);
			add += test.size()/2-1;
			add -= res>>1;
			i += test.size()/2-1;
			arr[res&1].push_back(test.back());
		}
		else if (arr[1].size() >= K){
			vector <int> test;
			for (int j=0;j<arr[1].size()&&i+j<N;j++){
				test.push_back(arr[1][j]);
				test.push_back(i+j);
			}
			int res = use_machine(test);
			add += res>>1;
			i += test.size()/2-1;
			arr[res&1^1].push_back(test.back());
		}
		else if (i+1 < N && arr[0].size() > 1){
			int res = use_machine({arr[0][0], i, arr[0][1], i+1});
			arr[res>>1&1].push_back(i);
			arr[res&1].push_back(++i);
		}else if (i+1 < N && arr[1].size() > 1){
			int res = use_machine({arr[1][0], i, arr[1][1], i+1});
			arr[res>>1&1^1].push_back(i);
			arr[res&1^1].push_back(++i);
		}
		else arr[use_machine({0, i})].push_back(i);
	} 
	return arr[0].size() + add;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:16:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |    for (int j=0;j<arr[0].size()&&i+j<N;j++){
      |                 ~^~~~~~~~~~~~~~
mushrooms.cpp:28:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |    for (int j=0;j<arr[1].size()&&i+j<N;j++){
      |                 ~^~~~~~~~~~~~~~
mushrooms.cpp:35:11: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   35 |    arr[res&1^1].push_back(test.back());
      |        ~~~^~
mushrooms.cpp:43:14: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   43 |    arr[res>>1&1^1].push_back(i);
      |        ~~~~~~^~
mushrooms.cpp:44:11: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   44 |    arr[res&1^1].push_back(++i);
      |        ~~~^~

Subtask #1
92.2449 / 100.0

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