oj.uz

답안 #1076519

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076519 2024-08-26T14:30:44 Z mindiyak 버섯 세기 (IOI20_mushrooms) C++14
80.427 / 100
 7 ms 600 KB 
#include "mushrooms.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>

using namespace std;

const int S = 100;

int brute(int n){
	//A = 0 | B = 1
	vector<int> type(n,-1);
	type[0] = 0;
 
	int pos = -1;
	for(int i = 1;i<n;i++){
		if(use_machine({0,i}) == 0){
			pos = i;
			type[i] = 0;
			break;
		}else{
			type[i] = 1;
		}
	}
 
	// cerr << pos << endl;
	int a=pos+1,b=pos+2;
 
	while(pos != -1){
		if(a >= n)break; 
		if(b >= n){
			if(use_machine({0,a}) == 0){
				type[a] = 0;
			}else{
				type[a] = 1;
			}
		}else{
			int val = use_machine({a,0,b,pos});
			if(val == 0){
				type[a] = 0;
				type[b] = 0;
			}else if(val == 1){
				type[a] = 1;
				type[b] = 0;
			}else if(val == 2){
				type[a] = 0;
				type[b] = 1;
			}else if(val == 3){
				type[a] = 1;
				type[b] = 1;
			}
		}
		a += 2;
		b += 2;
	}
 
	int ans = 0;
	// for(int i=0;i<n;i++)cerr << type[i] << " ";
	// cerr << endl;
	for(int i=0;i<n;i++)ans += (type[i]+1)%2;
	return ans;
}

int count_mushrooms(int n) {

	if(n < S+20)return brute(n);

	vector<int> A,B;
	deque<int> left;
	A.push_back(0);

	for(int i=1;i<n;i++)left.push_back(i);

	while(max(A.size(),B.size()) < S && left.size() > 0){
		int val = use_machine({0,left[0],left[1]});
		if(val == 0){
			A.push_back(left[0]);
			A.push_back(left[1]);
		}else if(val == 1){
			B.push_back(left[1]);
			left.push_back(left[0]);
		}else{
			B.push_back(left[0]);
			A.push_back(left[1]);
		}
		left.pop_front();
		left.pop_front();
	}

	int ans = A.size();

	while(left.size() > 0){
		if(A.size() > B.size()){
			vector<int> q;
			int m = 0,k = 0;
			while(m < A.size() && k < left.size()){
				q.push_back(left[k]);k++;
				q.push_back(A[m]);m++;
			}
			int val = use_machine(q);
			ans += k-(val+1)/2;
			if(val%2 == 1)B.push_back(left[0]);
			else A.push_back(left[0]);
			for(int i = 0;i<k;i++)left.pop_front();
		}else{
			vector<int> q;
			int m = 0,k = 0;
			while(m < B.size() && k < left.size()){
				q.push_back(left[k]);k++;
				q.push_back(B[m]);m++;
			}
			int val = use_machine(q);
			ans += (val+1)/2;
			if(val%2 == 1)A.push_back(left[0]);
			else B.push_back(left[0]);
			for(int i = 0;i<k;i++)left.pop_front();
		}
	}

	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:97:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |    while(m < A.size() && k < left.size()){
      |          ~~^~~~~~~~~~
mushrooms.cpp:97:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |    while(m < A.size() && k < left.size()){
      |                          ~~^~~~~~~~~~~~~
mushrooms.cpp:109:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |    while(m < B.size() && k < left.size()){
      |          ~~^~~~~~~~~~
mushrooms.cpp:109:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |    while(m < B.size() && k < left.size()){
      |                          ~~^~~~~~~~~~~~~

Subtask #1
80.427 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 528 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Partially correct 4 ms 344 KB Output is partially correct
11 Partially correct 4 ms 596 KB Output is partially correct
12 Partially correct 4 ms 344 KB Output is partially correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Partially correct 4 ms 344 KB Output is partially correct
16 Partially correct 4 ms 344 KB Output is partially correct
17 Correct 4 ms 344 KB Output is correct
18 Partially correct 4 ms 344 KB Output is partially correct
19 Partially correct 4 ms 344 KB Output is partially correct
20 Correct 6 ms 424 KB Output is correct
21 Partially correct 4 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 6 ms 344 KB Output is partially correct
26 Partially correct 6 ms 344 KB Output is partially correct
27 Partially correct 4 ms 344 KB Output is partially correct
28 Partially correct 4 ms 344 KB Output is partially correct
29 Partially correct 4 ms 344 KB Output is partially correct
30 Partially correct 6 ms 344 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 4 ms 344 KB Output is partially correct
33 Partially correct 4 ms 344 KB Output is partially correct
34 Partially correct 4 ms 344 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 4 ms 344 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 6 ms 344 KB Output is partially correct
39 Partially correct 5 ms 344 KB Output is partially correct
40 Partially correct 4 ms 344 KB Output is partially correct
41 Partially correct 3 ms 344 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 4 ms 344 KB Output is partially correct
45 Partially correct 4 ms 344 KB Output is partially correct
46 Partially correct 7 ms 344 KB Output is partially correct
47 Partially correct 4 ms 344 KB Output is partially correct
48 Partially correct 3 ms 348 KB Output is partially correct
49 Partially correct 4 ms 600 KB Output is partially correct
50 Partially correct 3 ms 344 KB Output is partially correct
51 Partially correct 3 ms 344 KB Output is partially correct
52 Partially correct 4 ms 344 KB Output is partially correct
53 Partially correct 4 ms 344 KB Output is partially correct
54 Partially correct 4 ms 344 KB Output is partially correct
55 Partially correct 3 ms 344 KB Output is partially correct
56 Partially correct 3 ms 524 KB Output is partially correct
57 Partially correct 6 ms 344 KB Output is partially correct
58 Partially correct 6 ms 344 KB Output is partially correct
59 Partially correct 3 ms 344 KB Output is partially correct
60 Partially correct 3 ms 344 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 1 ms 344 KB Output is correct
68 Correct 0 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 1 ms 344 KB Output is correct
75 Correct 0 ms 344 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 340 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 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 340 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