oj.uz

답안 #1021636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021636 2024-07-12T22:59:34 Z HappyCapybara 버섯 세기 (IOI20_mushrooms) C++17
80.7143 / 100
 6 ms 1124 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;

int count_mushrooms(int n) {
	vector<int> as = {0}, bs;
	int i = 1, res = 1;
	while (i < n){
		vector<int> m;
		if (as.size() >= bs.size()){
			int j = 0;
			while (i < n && j < as.size()){
				m.push_back(as[j]);
				m.push_back(i);
				i++;
				j++;
			}
			int x = use_machine(m);
			if (x % 2) bs.push_back(m.back());
			else {
				as.push_back(m.back());
				res++;
			}
			res += (m.size()/2 - x/2 - 1);
			if (x/2 == 0){
				for (int k=1; k<m.size()-1; k+=2) as.push_back(m[k]);
			}
			if ((x/2)*2 == m.size()-2){
				for (int k=1; k<m.size()-1; k+=2) bs.push_back(m[k]);
			}
		}
		else {
			int j = 0;
			while (i < n && j < bs.size()){
				m.push_back(bs[j]);
				m.push_back(i);
				i++;
				j++;
			}
			int x = use_machine(m);
			if (x % 2){
				as.push_back(m.back());
				res++;
			}
			else bs.push_back(m.back());
			res += (x/2);
			if (x/2 == 0){
				for (int k=1; k<m.size()-1; k+=2) bs.push_back(m[k]);
			}
			if ((x/2)*2 == m.size()-2){
				for (int k=1; k<m.size()-1; k+=2) as.push_back(m[k]);
			}
		}
	}
	return res;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |    while (i < n && j < as.size()){
      |                    ~~^~~~~~~~~~~
mushrooms.cpp:26:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for (int k=1; k<m.size()-1; k+=2) as.push_back(m[k]);
      |                   ~^~~~~~~~~~~
mushrooms.cpp:28:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |    if ((x/2)*2 == m.size()-2){
      |        ~~~~~~~~^~~~~~~~~~~~~
mushrooms.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int k=1; k<m.size()-1; k+=2) bs.push_back(m[k]);
      |                   ~^~~~~~~~~~~
mushrooms.cpp:34:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |    while (i < n && j < bs.size()){
      |                    ~~^~~~~~~~~~~
mushrooms.cpp:48:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int k=1; k<m.size()-1; k+=2) bs.push_back(m[k]);
      |                   ~^~~~~~~~~~~
mushrooms.cpp:50:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |    if ((x/2)*2 == m.size()-2){
      |        ~~~~~~~~^~~~~~~~~~~~~
mushrooms.cpp:51:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int k=1; k<m.size()-1; k+=2) as.push_back(m[k]);
      |                   ~^~~~~~~~~~~

Subtask #1
80.7143 / 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 452 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 6 ms 600 KB Output is partially correct
12 Partially correct 3 ms 600 KB Output is partially correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Partially correct 4 ms 344 KB Output is partially correct
16 Partially correct 6 ms 1124 KB Output is partially correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 4 ms 448 KB Output is partially correct
20 Partially correct 3 ms 460 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 4 ms 344 KB Output is partially correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 3 ms 600 KB Output is partially correct
26 Partially correct 6 ms 344 KB Output is partially correct
27 Partially correct 4 ms 600 KB Output is partially correct
28 Partially correct 3 ms 448 KB Output is partially correct
29 Partially correct 4 ms 600 KB Output is partially correct
30 Partially correct 4 ms 444 KB Output is partially correct
31 Partially correct 3 ms 344 KB Output is partially correct
32 Partially correct 4 ms 344 KB Output is partially correct
33 Partially correct 3 ms 464 KB Output is partially correct
34 Partially correct 3 ms 344 KB Output is partially correct
35 Partially correct 3 ms 344 KB Output is partially correct
36 Partially correct 4 ms 344 KB Output is partially correct
37 Partially correct 6 ms 344 KB Output is partially correct
38 Partially correct 4 ms 344 KB Output is partially correct
39 Partially correct 5 ms 864 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 4 ms 600 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 3 ms 344 KB Output is partially correct
45 Partially correct 4 ms 476 KB Output is partially correct
46 Partially correct 4 ms 440 KB Output is partially correct
47 Partially correct 3 ms 344 KB Output is partially correct
48 Partially correct 3 ms 344 KB Output is partially correct
49 Partially correct 4 ms 600 KB Output is partially correct
50 Partially correct 5 ms 600 KB Output is partially correct
51 Partially correct 4 ms 344 KB Output is partially correct
52 Partially correct 4 ms 344 KB Output is partially correct
53 Partially correct 5 ms 720 KB Output is partially correct
54 Partially correct 4 ms 600 KB Output is partially correct
55 Partially correct 3 ms 344 KB Output is partially correct
56 Partially correct 5 ms 344 KB Output is partially correct
57 Partially correct 4 ms 600 KB Output is partially correct
58 Partially correct 6 ms 344 KB Output is partially correct
59 Partially correct 6 ms 340 KB Output is partially correct
60 Partially correct 6 ms 600 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 1 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 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 348 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 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 0 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