oj.uz

Submission #424334

# Submission time Handle Problem Language Result Execution time Memory
424334 2021-06-11T19:49:25 Z Apiram Counting Mushrooms (IOI20_mushrooms) C++14
80.7143 / 100
 10 ms 468 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;

int count_mushrooms(int n) {
	vector<int>a,b;
	a.push_back(0);
	int ans=0;
	vector<int>both;
	for (int i =1;i<n;++i){
		both.push_back(i);
		if (both.size()!=max(a.size(),b.size()))continue;
		if (a.size()>=b.size()){
			vector<int>cur;
			for (int i =0;i<both.size();++i){
				cur.push_back(both[i]);
				cur.push_back(a[i]);
			}
			int k = use_machine(cur);
			ans+=both.size() - (k)/2  -1 ;
			if (k%2==1){
				b.push_back(cur[0]);
			}
			else a.push_back(cur[0]);
		}
		else {
			vector<int>cur;
			for (int i =0;i<both.size();++i){
				cur.push_back(both[i]);
				cur.push_back(b[i]);
			}
			int k = use_machine(cur);
			ans+=(k)/2 ;
			if (k%2==1){
				a.push_back(cur[0]);
			}
			else b.push_back(cur[0]);
		}
		both.clear();
	}
	if (!both.empty()){
	
		if (a.size()>=b.size()){
			vector<int>cur;
			for (int i =0;i<both.size();++i){
				cur.push_back(both[i]);
				cur.push_back(a[i]);
			}
			int k = use_machine(cur);
			ans+=both.size() - (k)/2 -1  ;
			if (k%2==1){
				b.push_back(cur[0]);
			}
			else a.push_back(cur[0]);
		}
		else {
			vector<int>cur;
			for (int i =0;i<both.size();++i){
				cur.push_back(both[i]);
				cur.push_back(b[i]);
			}
			int k = use_machine(cur);
			ans+=(k)/2 ;
			if (k%2==1){
				a.push_back(cur[0]);
			}
			else b.push_back(cur[0]);
		}
	}
	return ans + a.size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:15:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |    for (int i =0;i<both.size();++i){
      |                  ~^~~~~~~~~~~~
mushrooms.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |    for (int i =0;i<both.size();++i){
      |                  ~^~~~~~~~~~~~
mushrooms.cpp:45:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |    for (int i =0;i<both.size();++i){
      |                  ~^~~~~~~~~~~~
mushrooms.cpp:58:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |    for (int i =0;i<both.size();++i){
      |                  ~^~~~~~~~~~~~

Subtask #1
80.7143 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 7 ms 328 KB Output is correct
8 Correct 8 ms 328 KB Output is correct
9 Correct 9 ms 320 KB Output is correct
10 Partially correct 9 ms 200 KB Output is partially correct
11 Partially correct 8 ms 328 KB Output is partially correct
12 Partially correct 8 ms 332 KB Output is partially correct
13 Correct 7 ms 328 KB Output is correct
14 Correct 5 ms 200 KB Output is correct
15 Partially correct 8 ms 320 KB Output is partially correct
16 Partially correct 6 ms 340 KB Output is partially correct
17 Correct 5 ms 328 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Partially correct 7 ms 336 KB Output is partially correct
20 Partially correct 10 ms 300 KB Output is partially correct
21 Partially correct 7 ms 328 KB Output is partially correct
22 Partially correct 8 ms 328 KB Output is partially correct
23 Correct 8 ms 328 KB Output is correct
24 Correct 5 ms 200 KB Output is correct
25 Partially correct 7 ms 308 KB Output is partially correct
26 Partially correct 8 ms 328 KB Output is partially correct
27 Partially correct 8 ms 328 KB Output is partially correct
28 Partially correct 9 ms 312 KB Output is partially correct
29 Partially correct 8 ms 320 KB Output is partially correct
30 Partially correct 8 ms 448 KB Output is partially correct
31 Partially correct 8 ms 324 KB Output is partially correct
32 Partially correct 8 ms 328 KB Output is partially correct
33 Partially correct 8 ms 324 KB Output is partially correct
34 Partially correct 8 ms 200 KB Output is partially correct
35 Partially correct 8 ms 304 KB Output is partially correct
36 Partially correct 10 ms 336 KB Output is partially correct
37 Partially correct 8 ms 320 KB Output is partially correct
38 Partially correct 8 ms 440 KB Output is partially correct
39 Partially correct 9 ms 320 KB Output is partially correct
40 Partially correct 8 ms 328 KB Output is partially correct
41 Partially correct 8 ms 324 KB Output is partially correct
42 Partially correct 9 ms 328 KB Output is partially correct
43 Partially correct 10 ms 328 KB Output is partially correct
44 Partially correct 7 ms 200 KB Output is partially correct
45 Partially correct 10 ms 304 KB Output is partially correct
46 Partially correct 8 ms 312 KB Output is partially correct
47 Partially correct 8 ms 440 KB Output is partially correct
48 Partially correct 7 ms 328 KB Output is partially correct
49 Partially correct 8 ms 328 KB Output is partially correct
50 Partially correct 8 ms 328 KB Output is partially correct
51 Partially correct 8 ms 328 KB Output is partially correct
52 Partially correct 8 ms 328 KB Output is partially correct
53 Partially correct 9 ms 328 KB Output is partially correct
54 Partially correct 8 ms 316 KB Output is partially correct
55 Partially correct 10 ms 328 KB Output is partially correct
56 Partially correct 8 ms 336 KB Output is partially correct
57 Partially correct 7 ms 328 KB Output is partially correct
58 Partially correct 8 ms 328 KB Output is partially correct
59 Partially correct 9 ms 316 KB Output is partially correct
60 Partially correct 7 ms 308 KB Output is partially correct
61 Partially correct 8 ms 328 KB Output is partially correct
62 Correct 0 ms 200 KB Output is correct
63 Correct 0 ms 200 KB Output is correct
64 Correct 1 ms 200 KB Output is correct
65 Correct 1 ms 200 KB Output is correct
66 Correct 0 ms 200 KB Output is correct
67 Correct 0 ms 200 KB Output is correct
68 Correct 0 ms 200 KB Output is correct
69 Correct 0 ms 200 KB Output is correct
70 Correct 0 ms 200 KB Output is correct
71 Correct 0 ms 200 KB Output is correct
72 Correct 1 ms 200 KB Output is correct
73 Correct 1 ms 200 KB Output is correct
74 Correct 1 ms 200 KB Output is correct
75 Correct 1 ms 200 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 0 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 0 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 0 ms 200 KB Output is correct
84 Correct 0 ms 200 KB Output is correct
85 Correct 0 ms 200 KB Output is correct
86 Correct 0 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 0 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct