oj.uz

답안 #388066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388066 2021-04-09T20:32:42 Z Supersonic 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 9 ms 352 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
int count_mushrooms(int n) {
	int k=84;
	vector<int> a;vector<int> b;a.push_back(0);
	int r1=use_machine({0,1});if(r1)b.push_back(1);else a.push_back(1);
	if(n==2)return a.size();
	int r2=use_machine({0,2});if(r2)b.push_back(2);else a.push_back(2);
	if(n==3)return a.size();
	int c=3;
	if(a.size()>=2){
		while(c<n-1&&max(a.size(),b.size())<k){
			r1=use_machine({a[0],c,a[1],c+1});
			if(r1==0){a.push_back(c);a.push_back(c+1);}
			if(r1==1){a.push_back(c);b.push_back(c+1);}
			if(r1==2){b.push_back(c);a.push_back(c+1);}
			if(r1==3){b.push_back(c);b.push_back(c+1);}
			c+=2;
		}
	}
	else{
		while(c<n-1&&max(a.size(),b.size())<k){
			r1=use_machine({b[0],c,b[1],c+1});
			if(r1==0){b.push_back(c);b.push_back(c+1);}
			if(r1==1){b.push_back(c);a.push_back(c+1);}
			if(r1==2){a.push_back(c);b.push_back(c+1);}
			if(r1==3){a.push_back(c);a.push_back(c+1);}
			c+=2;
		}
	}
	if(c==n-1){
		if(use_machine({0,n-1})==1)b.push_back(n-1);
		else a.push_back(n-1);
		c++;
	}
	if(c==n)return a.size();
	int as=a.size();
	while(c<n){
		if(a.size()>b.size()){
			vector<int> q;int t=0;
			for(auto i:a){q.push_back(i);t++;q.push_back(c);c++;if(c==n)break;}
			r1=use_machine(q);
			if(r1%2==1)b.push_back(q[q.size()-1]);
			else a.push_back(q[q.size()-1]);
			r1++;r1/=2;as+=(t-r1);
		}
		else {
			vector<int> q;
			for(auto i:b){q.push_back(i);q.push_back(c);c++;if(c==n)break;}
			r1=use_machine(q);
			if(r1%2==1)a.push_back(q[q.size()-1]);
			else b.push_back(q[q.size()-1]);
			r1++;r1/=2;as+=r1;
		}
	}
	return as;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:13:38: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   13 |   while(c<n-1&&max(a.size(),b.size())<k){
      |                ~~~~~~~~~~~~~~~~~~~~~~^~
mushrooms.cpp:23:38: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   23 |   while(c<n-1&&max(a.size(),b.size())<k){
      |                ~~~~~~~~~~~~~~~~~~~~~~^~

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 9 ms 316 KB Output is correct
8 Correct 6 ms 200 KB Output is correct
9 Correct 6 ms 200 KB Output is correct
10 Correct 9 ms 304 KB Output is correct
11 Partially correct 7 ms 328 KB Output is partially correct
12 Correct 7 ms 320 KB Output is correct
13 Correct 6 ms 200 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Partially correct 8 ms 308 KB Output is partially correct
16 Partially correct 9 ms 316 KB Output is partially correct
17 Correct 4 ms 328 KB Output is correct
18 Correct 7 ms 200 KB Output is correct
19 Partially correct 7 ms 340 KB Output is partially correct
20 Correct 7 ms 200 KB Output is correct
21 Correct 7 ms 200 KB Output is correct
22 Partially correct 7 ms 200 KB Output is partially correct
23 Correct 6 ms 328 KB Output is correct
24 Correct 4 ms 200 KB Output is correct
25 Partially correct 7 ms 200 KB Output is partially correct
26 Partially correct 7 ms 312 KB Output is partially correct
27 Partially correct 7 ms 328 KB Output is partially correct
28 Partially correct 7 ms 200 KB Output is partially correct
29 Partially correct 7 ms 328 KB Output is partially correct
30 Partially correct 7 ms 320 KB Output is partially correct
31 Partially correct 7 ms 352 KB Output is partially correct
32 Partially correct 7 ms 332 KB Output is partially correct
33 Partially correct 7 ms 200 KB Output is partially correct
34 Partially correct 7 ms 200 KB Output is partially correct
35 Partially correct 7 ms 200 KB Output is partially correct
36 Partially correct 7 ms 316 KB Output is partially correct
37 Partially correct 7 ms 308 KB Output is partially correct
38 Partially correct 7 ms 200 KB Output is partially correct
39 Partially correct 7 ms 200 KB Output is partially correct
40 Partially correct 7 ms 300 KB Output is partially correct
41 Partially correct 7 ms 328 KB Output is partially correct
42 Partially correct 7 ms 320 KB Output is partially correct
43 Partially correct 7 ms 328 KB Output is partially correct
44 Partially correct 9 ms 200 KB Output is partially correct
45 Partially correct 9 ms 304 KB Output is partially correct
46 Partially correct 9 ms 328 KB Output is partially correct
47 Partially correct 7 ms 300 KB Output is partially correct
48 Partially correct 9 ms 316 KB Output is partially correct
49 Partially correct 7 ms 200 KB Output is partially correct
50 Partially correct 7 ms 328 KB Output is partially correct
51 Partially correct 7 ms 312 KB Output is partially correct
52 Partially correct 7 ms 320 KB Output is partially correct
53 Partially correct 9 ms 316 KB Output is partially correct
54 Partially correct 7 ms 200 KB Output is partially correct
55 Partially correct 7 ms 328 KB Output is partially correct
56 Partially correct 7 ms 200 KB Output is partially correct
57 Partially correct 7 ms 200 KB Output is partially correct
58 Partially correct 9 ms 328 KB Output is partially correct
59 Partially correct 8 ms 324 KB Output is partially correct
60 Partially correct 7 ms 304 KB Output is partially correct
61 Partially correct 7 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 0 ms 200 KB Output is correct
66 Correct 1 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 1 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 0 ms 200 KB Output is correct
74 Correct 0 ms 200 KB Output is correct
75 Correct 1 ms 256 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 0 ms 200 KB Output is correct
78 Correct 0 ms 200 KB Output is correct
79 Correct 0 ms 204 KB Output is correct
80 Correct 0 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 0 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 0 ms 200 KB Output is correct
88 Correct 0 ms 200 KB Output is correct
89 Correct 0 ms 200 KB Output is correct
90 Correct 0 ms 200 KB Output is correct
91 Correct 0 ms 200 KB Output is correct