oj.uz

답안 #1014882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014882 2024-07-05T16:30:01 Z Unforgettablepl 버섯 세기 (IOI20_mushrooms) C++17
80.427 / 100
 7 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

int use_machine(vector<int> x);

const int SQRT = 139;

int strat1(int n){
	vector<bool> type(n);
	{
		int t = use_machine({0,1});
		if(t==0)type[1]=false;
		else type[1]=true;
	}
	if(n>2){
		int t = use_machine({0,2});
		if(t==0)type[2]=false;
		else type[2]=true;
	} else {
		return 1 + (int)(type[1]==false);
	}
	int a,b;bool ty;
	if(type[0]==type[1]){
		a = 0;
		b = 1;
		ty = false;
	} else if(type[0]==type[2]){
		a = 0;
		b = 2;
		ty = false;
	} else {
		a = 1;
		b = 2;
		ty = true;
	}
	type.emplace_back(false);
	for(int i=3;i<n;i+=2){
		int curr;
		if(i==n-1){
			curr = use_machine({a,i,b});
		} else {
			curr = use_machine({a,i,b,i+1});
		}
		if(curr&1){
			type[i+1] = !ty;
		} else type[i+1] = ty;
		if(curr&2){
			type[i] = !ty;
		} else type[i] = ty;
	}
	int ans = 0;
	for(int i=0;i<n;i++)if(type[i]==false)ans++;
	return ans;
}

int checked_until = -1;

vector<int> ask(){
	vector<bool> type(3*SQRT);
	int cnt_false = 1,cnt_true = 0;
	{
		int t = use_machine({0,1});
		if(t==0){type[1]=false;cnt_false++;}
		else {type[1]=true;cnt_true++;}
	}
	{
		int t = use_machine({0,2});
		if(t==0){type[2]=false;cnt_false++;}
		else {type[2]=true;cnt_true++;}
	}
	int a,b;bool ty;
	if(type[0]==type[1]){
		a = 0;
		b = 1;
		ty = false;
	} else if(type[0]==type[2]){
		a = 0;
		b = 2;
		ty = false;
	} else {
		a = 1;
		b = 2;
		ty = true;
	}
	type.emplace_back(false);
	vector<int> falses;
	vector<int> trues;
	for(int i=3;i<3*SQRT;i+=2){
		int curr = use_machine({a,i,b,i+1});
		if(curr&2){
			type[i] = !ty;
		} else type[i] = ty;
		checked_until = i+1;
		if(type[i]==false){
			if(++cnt_false==SQRT)break;
		} else {
			if(++cnt_true==SQRT)break;
		}
		if(curr&1){
			type[i+1] = !ty;
		} else type[i+1] = ty;
		checked_until = i+2;
		if(type[i+1]==false){
			if(++cnt_false==SQRT)break;
		} else {
			if(++cnt_true==SQRT)break;
		}
	}
	vector<int> ans;
	bool tar;
	if(cnt_false==SQRT)tar = false;
	else tar = true;
	for(int i=0;i<checked_until;i++)if(type[i]==tar)ans.emplace_back(i);
	assert(ans.size()==SQRT);
	return ans;
}

int count_mushrooms(int n) {
	if(n<=450)return strat1(n);
	auto idx = ask();
	bool ty = idx.front()!=0;
	int ans = 0;
	if(ty){
		ans = checked_until-SQRT;
		for(int i=checked_until;i<n;i+=SQRT){
			vector<int> buffer;
			for(int j=0;j<SQRT;j++)if(i+j<n)buffer.emplace_back(i+j);
			vector<int> query;
			query.emplace_back(buffer.front());
			auto iter = buffer.begin()+1;
			auto iterb = idx.begin();
			while(iter!=buffer.end()){
				query.emplace_back(*iterb++);
				query.emplace_back(*iter++);
			}
			query.emplace_back(idx.back());
			int t = use_machine(query);t++;t/=2;
			ans+=t;
		}
	} else {
		ans = SQRT;
		for(int i=checked_until;i<n;i+=SQRT){
			vector<int> buffer;
			for(int j=0;j<SQRT;j++)if(i+j<n)buffer.emplace_back(i+j);
			vector<int> query;
			query.emplace_back(buffer.front());
			auto iter = buffer.begin()+1;
			auto iterb = idx.begin();
			while(iter!=buffer.end()){
				query.emplace_back(*iterb++);
				query.emplace_back(*iter++);
			}
			query.emplace_back(idx.back());
			int t = use_machine(query);t++;t/=2;
			ans+=buffer.size()-t;
		}
	}
	return ans;
}

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 4 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Partially correct 3 ms 444 KB Output is partially correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Partially correct 3 ms 344 KB Output is partially correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 3 ms 444 KB Output is partially correct
16 Partially correct 6 ms 344 KB Output is partially correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Partially correct 3 ms 344 KB Output is partially correct
21 Partially correct 5 ms 344 KB Output is partially correct
22 Partially correct 4 ms 344 KB Output is partially correct
23 Partially correct 3 ms 344 KB Output is partially correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 3 ms 344 KB Output is partially correct
26 Partially correct 3 ms 344 KB Output is partially correct
27 Partially correct 4 ms 344 KB Output is partially correct
28 Partially correct 3 ms 344 KB Output is partially correct
29 Partially correct 3 ms 344 KB Output is partially correct
30 Partially correct 3 ms 344 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 3 ms 344 KB Output is partially correct
33 Partially correct 4 ms 344 KB Output is partially correct
34 Partially correct 6 ms 448 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 5 ms 344 KB Output is partially correct
37 Partially correct 4 ms 344 KB Output is partially correct
38 Partially correct 4 ms 344 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 4 ms 344 KB Output is partially correct
41 Partially correct 4 ms 344 KB Output is partially correct
42 Partially correct 4 ms 344 KB Output is partially correct
43 Partially correct 6 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 4 ms 344 KB Output is partially correct
47 Partially correct 6 ms 600 KB Output is partially correct
48 Partially correct 3 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 6 ms 344 KB Output is partially correct
51 Partially correct 3 ms 344 KB Output is partially correct
52 Partially correct 5 ms 344 KB Output is partially correct
53 Partially correct 3 ms 344 KB Output is partially correct
54 Partially correct 3 ms 344 KB Output is partially correct
55 Partially correct 7 ms 344 KB Output is partially correct
56 Partially correct 4 ms 344 KB Output is partially correct
57 Partially correct 6 ms 344 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 3 ms 344 KB Output is partially correct
60 Partially correct 4 ms 344 KB Output is partially correct
61 Partially correct 4 ms 344 KB Output is partially correct
62 Correct 1 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 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 1 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 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 344 KB Output is correct
80 Correct 0 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 1 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