oj.uz

Submission #1079003

# Submission time Handle Problem Language Result Execution time Memory
1079003 2024-08-28T09:17:29 Z Trumling Counting Mushrooms (IOI20_mushrooms) C++14
75.5853 / 100
 6 ms 600 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

int count_mushrooms(int n) {

	if(n<220)
	{
	vector<int> m(3,0);
	ll c2=1;
	for(int i=1;i<n-1;i+=2)
	{
		m[0]=i;
		m[2]=i+1;
		int c1 = use_machine(m);
		c2+=2-c1;
	}
	if(n%2==0)
	{
		m.clear();
		m.assign(2,0);
		m[1]=n-1;
		int c1 = use_machine(m);
		if(!c1)
		c2++;
	}
	return c2;
	}
	
	vector<int>A,B;
	A.pb(0);
	int i;
	ll tf=1;
	ll a=use_machine({0,1});
	if(a==0)
	{
		A.pb(-1);
		A.pb(1);
	}
	else
	{
		tf=2;
		B.pb(1);
		a=use_machine({0,2});
		if(a==0)
		{
			A.pb(-1);
			A.pb(2);
		}
		else
		{
			B.pb(-1);
			B.pb(2);
			tf=3;
		}
	}

	for(i=((tf==1)?2:3);i<202;i+=2)
	{
		if(tf<=2)
			{
			ll ans=use_machine({0,i,A[2],i+1});

			if(ans<2)
			{
			A.pb(-1);
			A.pb(i);
			}
			else
			{
			if(B.size()!=0)
				B.pb(-1);
			B.pb(i);

			}

			if(A.size()==201 || B.size()==201)
				break;

			if(ans%2==0)
			{
			A.pb(-1);
			A.pb(i+1);
			}
			else
			{
			if(B.size()!=0)
				B.pb(-1);
			B.pb(i+1);
			}

			if(A.size()==201 || B.size()==201)
			{
				i++;
				break;
			}
			}
		else
			{
			ll ans=use_machine({1,i,2,i+1});

			if(ans>=2)
			{
			A.pb(-1);
			A.pb(i);
			}
			else
			{
			if(B.size()!=0)
				B.pb(-1);
			B.pb(i);

			}

			if(A.size()==201 || B.size()==201)
				break;

			if(ans%2)
			{
			A.pb(-1);
			A.pb(i+1);
			}
			else
			{
			if(B.size()!=0)
				B.pb(-1);
			B.pb(i+1);
			}

			if(A.size()==201 || B.size()==201)
			{
				i++;
				break;
			}

			}
	}
	ll counta=A.size()/2 + 1;
	i++;
	
	for(i=i;i<n;i+=100)
	{
	if(A.size()==201)
	{
		if(i+100<=n)
		{
		for(int j=0;j<100;j++)
			A[j*2+1]=i+j;
		
		ll ans=use_machine(A);
		counta+=100-ans/2;

		continue;

		}
		vector<int>p;
		int j;
		for(j=0;j<n-i;j++)
			{
				p.pb(A[j*2]);
				p.pb(i+j);
			}

		p.pb(A[j*2]);
		ll ans=use_machine(p);
		counta+=(n-i)-ans/2;

	}
	else
	{
		if(i+100<=n)
		{
		for(int j=0;j<100;j++)
			B[j*2+1]=i+j;
		
		ll ans=use_machine(B);
		counta+=ans/2;

		continue;
		}

		vector<int>p;
		int j;
		for(j=0;j<n-i;j++)
			{
				p.pb(B[j*2]);
				p.pb(i+j);
			}

		p.pb(B[j*2]);
		ll ans=use_machine(p);
		counta+=ans/2;
	}

	}
	return counta;

}

Subtask #1
75.5853 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 Partially correct 3 ms 344 KB Output is partially correct
8 Partially correct 3 ms 344 KB Output is partially correct
9 Partially correct 4 ms 344 KB Output is partially correct
10 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Partially correct 5 ms 344 KB Output is partially correct
13 Partially correct 6 ms 344 KB Output is partially correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 3 ms 344 KB Output is partially correct
16 Partially correct 3 ms 344 KB Output is partially correct
17 Correct 2 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 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 5 ms 344 KB Output is partially correct
24 Correct 3 ms 596 KB Output is correct
25 Partially correct 3 ms 344 KB Output is partially correct
26 Partially correct 5 ms 344 KB Output is partially correct
27 Partially correct 5 ms 344 KB Output is partially correct
28 Partially correct 4 ms 344 KB Output is partially correct
29 Partially correct 3 ms 452 KB Output is partially correct
30 Partially correct 4 ms 448 KB Output is partially correct
31 Partially correct 3 ms 344 KB Output is partially correct
32 Partially correct 4 ms 344 KB Output is partially correct
33 Partially correct 4 ms 448 KB Output is partially correct
34 Partially correct 5 ms 344 KB Output is partially correct
35 Partially correct 6 ms 444 KB Output is partially correct
36 Partially correct 6 ms 600 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 3 ms 344 KB Output is partially correct
39 Partially correct 4 ms 600 KB Output is partially correct
40 Partially correct 4 ms 448 KB Output is partially correct
41 Partially correct 4 ms 600 KB Output is partially correct
42 Partially correct 6 ms 344 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 3 ms 448 KB Output is partially correct
45 Partially correct 5 ms 600 KB Output is partially correct
46 Partially correct 3 ms 344 KB Output is partially correct
47 Partially correct 3 ms 344 KB Output is partially correct
48 Partially correct 4 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 3 ms 444 KB Output is partially correct
51 Partially correct 3 ms 344 KB Output is partially correct
52 Partially correct 4 ms 444 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 6 ms 344 KB Output is partially correct
56 Partially correct 4 ms 344 KB Output is partially correct
57 Partially correct 3 ms 344 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 6 ms 448 KB Output is partially correct
60 Partially correct 4 ms 344 KB Output is partially correct
61 Partially correct 5 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 1 ms 340 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 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 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 1 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 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