Submission #753602

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
753602	2023-06-05T14:30:44 Z	tolbi	Counting Mushrooms (IOI20_mushrooms)	C++17	92.623 / 100	10 ms	640 KB

mushrooms

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "mushrooms.h"
int count_mushrooms(int n) {
	int sqv = 80;
	vector<int> zeros={0};
	vector<int> ones;
	vector<int> ar(n-1);
	iota(ar.begin(), ar.end(), 1);
	while (max(zeros.size(), ones.size())<sqv && ar.size()>0){
		if (ar.size()==1 || max(zeros.size(), ones.size())<=1){
			if (use_machine({0,ar.back()})){
				ones.push_back(ar.back());
			}
			else {
				zeros.push_back(ar.back());
			}
			ar.pop_back();
			continue;
		}
		int x = ar.back();
		ar.pop_back();
		int y = ar.back();
		ar.pop_back();
		if (zeros.size()>=2){
			int kk = use_machine({zeros[0],x,zeros.back(),y});
			if (kk&1) ones.push_back(y);
			else zeros.push_back(y);
			if (kk&2) ones.push_back(x);
			else zeros.push_back(x);
		}
		else {
			int kk = use_machine({ones[0],x,ones.back(),y});
			if (kk&1) zeros.push_back(y);
			else ones.push_back(y);
			if (kk&2) zeros.push_back(x);
			else ones.push_back(x);
		}
	}
	int ans = 0;
	while (ar.size()>0){
		if (zeros.size()>ones.size()){
			vector<int> ask;
			for (int i = 0; i < zeros.size(); i++){
				ask.push_back(zeros[i]);
				ask.push_back(ar.back());
				ar.pop_back();
				if (ar.size()==0) break;
			}
			int kk = use_machine(ask);
			ans+=ask.size()/2-(kk+1)/2;
			if (kk&1) ones.push_back(ask.back());
			else zeros.push_back(ask.back()),ans--;
		}
		else {
			vector<int> ask;
			for (int i = 0; i < ones.size(); i++){
				ask.push_back(ones[i]);
				ask.push_back(ar.back());
				ar.pop_back();
				if (ar.size()==0) break;
			}
			int kk = use_machine(ask);
			ans+=(kk+1)/2;
			if (kk&1) zeros.push_back(ask.back()),ans--;
			else ones.push_back(ask.back());
		}
	}
	return zeros.size()+ans;
}

Compilation message

mushrooms.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:42:39: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   42 |  while (max(zeros.size(), ones.size())<sqv && ar.size()>0){
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
mushrooms.cpp:76:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |    for (int i = 0; i < zeros.size(); i++){
      |                    ~~^~~~~~~~~~~~~~
mushrooms.cpp:89:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |    for (int i = 0; i < ones.size(); i++){
      |                    ~~^~~~~~~~~~~~~

Subtask #1

92.623 / 100.0

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