Submission #1060488

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1060488	2024-08-15T16:07:36 Z	Mihailo	Counting Mushrooms (IOI20_mushrooms)	C++17	80.1418 / 100	6 ms	600 KB

mushrooms

#include <cstdio>
#include <cstdlib>
#include <cstdarg>
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define xx first
#define yy second
#define pll pair<long long, long long>
#define MOD 1000000007
typedef long long ll;
using namespace std;
mt19937 mt(time(nullptr));
 
int use_machine(vector<int> x);
ll N, reached, sol;
vector<ll> A, B;

ll next() {
	return reached++;
}

void identifyA() {
	vector<int> v;
	ll rez;
	while(A.size()<140&&B.size()<140) {
		v.clear();
		v.pb(A[0]);
		v.pb(next());
		v.pb(A[1]);
		v.pb(next());
		rez=use_machine(v);
		if(rez&1) {
			B.pb(reached-1);
		}
		else {
			A.pb(reached-1);
		}
		if(rez&2) {
			B.pb(reached-2);
		}
		else {
			A.pb(reached-2);
		}
	}
}

void identifyB() {
	vector<int> v;
	ll rez;
	while(A.size()<140&&B.size()<140) {
		v.clear();
		v.pb(B[0]);
		v.pb(next());
		v.pb(B[1]);
		v.pb(next());
		rez=use_machine(v);
		if(rez&1) {
			A.pb(reached-1);
		}
		else {
			B.pb(reached-1);
		}
		if(rez&2) {
			A.pb(reached-2);
		}
		else {
			B.pb(reached-2);
		}
	}
}

void testA() {
	vector<int> v;
	sol=A.size();
	while(reached<N) {
		v.clear();
		v.pb(A[0]);
		for(int i=1; i<A.size()&&reached<N; i++) {
			v.pb(next());
			v.pb(A[i]);
		}
		sol+=(v.size()-use_machine(v))/2;
	}
}

void testB() {
	vector<int> v;
	sol=B.size();
	while(reached<N) {
		v.clear();
		v.pb(B[0]);
		for(int i=1; i<B.size()&&reached<N; i++) {
			v.pb(next());
			v.pb(B[i]);
		}
		sol+=(v.size()-use_machine(v))/2;
	}
}

int count_mushrooms(int _N) {
	N=_N;
	vector<int> v;
	if(N<280) {
		sol=1;
		for(int i=1; i<N; i++) {
			v.clear();
			v.pb(0);
			v.pb(i);
			if(!use_machine(v)) sol++;
		}
		return sol;
	}
	A.pb(0);
	v.pb(0);
	v.pb(1);
	if(use_machine(v)) {
		B.pb(1);
		v.pb(2);
		reached=3;
		if(use_machine(v)==1) {
			B.pb(2);
			identifyB();
		}
		else {
			A.pb(2);
			identifyA();
		}
	}
	else {
		reached=2;
		A.pb(1);
		identifyA();
	}
	if(A.size()>B.size()) {
		testA();
	}
	else {
		testB();
		sol=N-sol;
	}
	return sol;
}

Compilation message

mushrooms.cpp: In function 'void testA()':
mushrooms.cpp:79:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |   for(int i=1; i<A.size()&&reached<N; i++) {
      |                ~^~~~~~~~~
mushrooms.cpp: In function 'void testB()':
mushrooms.cpp:93:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   for(int i=1; i<B.size()&&reached<N; i++) {
      |                ~^~~~~~~~~

Subtask #1

80.1418 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	3 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	344 KB	Output is partially correct
11	Partially correct	3 ms	344 KB	Output is partially correct
12	Partially correct	6 ms	344 KB	Output is partially correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Partially correct	4 ms	344 KB	Output is partially correct
16	Partially correct	3 ms	444 KB	Output is partially correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Partially correct	3 ms	344 KB	Output is partially correct
20	Partially correct	6 ms	344 KB	Output is partially correct
21	Partially correct	3 ms	344 KB	Output is partially correct
22	Partially correct	3 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	6 ms	344 KB	Output is partially correct
27	Partially correct	6 ms	344 KB	Output is partially correct
28	Partially correct	4 ms	344 KB	Output is partially correct
29	Partially correct	5 ms	344 KB	Output is partially correct
30	Partially correct	3 ms	344 KB	Output is partially correct
31	Partially correct	3 ms	448 KB	Output is partially correct
32	Partially correct	3 ms	344 KB	Output is partially correct
33	Partially correct	3 ms	344 KB	Output is partially correct
34	Partially correct	4 ms	344 KB	Output is partially correct
35	Partially correct	3 ms	344 KB	Output is partially correct
36	Partially correct	6 ms	344 KB	Output is partially correct
37	Partially correct	3 ms	344 KB	Output is partially correct
38	Partially correct	5 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	4 ms	344 KB	Output is partially correct
42	Partially correct	4 ms	344 KB	Output is partially correct
43	Partially correct	3 ms	344 KB	Output is partially correct
44	Partially correct	3 ms	344 KB	Output is partially correct
45	Partially correct	3 ms	344 KB	Output is partially correct
46	Partially correct	3 ms	344 KB	Output is partially correct
47	Partially correct	4 ms	344 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	3 ms	344 KB	Output is partially correct
51	Partially correct	4 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	6 ms	600 KB	Output is partially correct
55	Partially correct	6 ms	344 KB	Output is partially correct
56	Partially correct	3 ms	344 KB	Output is partially correct
57	Partially correct	6 ms	344 KB	Output is partially correct
58	Partially correct	3 ms	448 KB	Output is partially correct
59	Partially correct	4 ms	344 KB	Output is partially correct
60	Partially correct	3 ms	452 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	1 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	1 ms	344 KB	Output is correct
80	Correct	0 ms	344 KB	Output is correct
81	Correct	0 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	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