답안 #304497

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304497	2020-09-21T12:26:01 Z	arnold518	버섯 세기 (IOI20_mushrooms)	C++14	92.623 / 100	10 ms	388 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e4;
const int SQ = 85;

int N;
vector<int> PERM;

int query(vector<int> V)
{
	return use_machine(V);
}

int naive()
{
	int ans=1;
	for(int i=1; i+1<N; i+=2)
	{
		ans+=2-query({i, 0, i+1});
	}
	if(N%2==0) ans+=1-query({0, N-1});
	return ans;
}

int count_mushrooms(int _N)
{
	N=_N;

	if(N<=2*SQ) return naive();

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

	int p, ans=0;

	for(p=1; p<=2; p++)
	{
		if(query({0, p})) B.push_back(p);
		else A.push_back(p);
	}

	if(A.size()>=2)
	{
		for(; p+1<N && A.size()<SQ && B.size()<SQ; p+=2)
		{
			int t=query({A[0], p, A[1], p+1});
			if(t==0) A.push_back(p), A.push_back(p+1);
			else if(t==1) A.push_back(p), B.push_back(p+1);
			else if(t==2) B.push_back(p), A.push_back(p+1);
			else B.push_back(p), B.push_back(p+1);
		}
	}
	else
	{
		for(; p+1<N && A.size()<SQ && B.size()<SQ; p+=2)
		{
			int t=query({B[0], p, B[1], p+1});
			if(t==0) B.push_back(p), B.push_back(p+1);
			else if(t==1) B.push_back(p), A.push_back(p+1);
			else if(t==2) A.push_back(p), B.push_back(p+1);
			else A.push_back(p), A.push_back(p+1);
		}
	}

	ans=0;

	while(p<N)
	{
		if(A.size()>B.size())
		{
			int i, j;
			vector<int> V;
			for(j=0; p<N && j<A.size(); p++, j++)
			{
				V.push_back(A[j]);
				V.push_back(p);
			}
			int t=query(V);
			if(t%2) B.push_back(V.back());
			else A.push_back(V.back());
			ans+=j-t/2-1;
		}
		else
		{
			int i, j;
			vector<int> V;
			for(j=0; p<N && j<B.size(); p++, j++)
			{
				V.push_back(B[j]);
				V.push_back(p);
			}
			int t=query(V);
			if(t%2) A.push_back(V.back());
			else B.push_back(V.back());
			ans+=t/2;
		}
	}

	return ans+A.size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:79:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    for(j=0; p<N && j<A.size(); p++, j++)
      |                    ~^~~~~~~~~
mushrooms.cpp:77:8: warning: unused variable 'i' [-Wunused-variable]
   77 |    int i, j;
      |        ^
mushrooms.cpp:93:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |    for(j=0; p<N && j<B.size(); p++, j++)
      |                    ~^~~~~~~~~
mushrooms.cpp:91:8: warning: unused variable 'i' [-Wunused-variable]
   91 |    int i, j;
      |        ^

Subtask #1

92.623 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	6 ms	380 KB	Output is correct
8	Correct	7 ms	256 KB	Output is correct
9	Correct	9 ms	256 KB	Output is correct
10	Correct	7 ms	384 KB	Output is correct
11	Partially correct	8 ms	256 KB	Output is partially correct
12	Correct	9 ms	256 KB	Output is correct
13	Correct	8 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Partially correct	7 ms	388 KB	Output is partially correct
16	Partially correct	7 ms	256 KB	Output is partially correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	7 ms	256 KB	Output is correct
19	Partially correct	7 ms	256 KB	Output is partially correct
20	Correct	7 ms	256 KB	Output is correct
21	Correct	7 ms	256 KB	Output is correct
22	Partially correct	7 ms	256 KB	Output is partially correct
23	Correct	8 ms	256 KB	Output is correct
24	Correct	6 ms	256 KB	Output is correct
25	Partially correct	9 ms	256 KB	Output is partially correct
26	Partially correct	9 ms	376 KB	Output is partially correct
27	Partially correct	9 ms	256 KB	Output is partially correct
28	Partially correct	7 ms	256 KB	Output is partially correct
29	Partially correct	7 ms	384 KB	Output is partially correct
30	Partially correct	9 ms	256 KB	Output is partially correct
31	Partially correct	9 ms	256 KB	Output is partially correct
32	Partially correct	7 ms	256 KB	Output is partially correct
33	Partially correct	7 ms	256 KB	Output is partially correct
34	Partially correct	7 ms	256 KB	Output is partially correct
35	Partially correct	6 ms	376 KB	Output is partially correct
36	Partially correct	9 ms	256 KB	Output is partially correct
37	Partially correct	6 ms	376 KB	Output is partially correct
38	Partially correct	9 ms	256 KB	Output is partially correct
39	Partially correct	8 ms	384 KB	Output is partially correct
40	Partially correct	8 ms	384 KB	Output is partially correct
41	Partially correct	8 ms	256 KB	Output is partially correct
42	Partially correct	8 ms	256 KB	Output is partially correct
43	Partially correct	8 ms	256 KB	Output is partially correct
44	Partially correct	7 ms	256 KB	Output is partially correct
45	Partially correct	7 ms	256 KB	Output is partially correct
46	Partially correct	7 ms	256 KB	Output is partially correct
47	Partially correct	10 ms	256 KB	Output is partially correct
48	Partially correct	8 ms	256 KB	Output is partially correct
49	Partially correct	8 ms	256 KB	Output is partially correct
50	Partially correct	8 ms	384 KB	Output is partially correct
51	Partially correct	7 ms	256 KB	Output is partially correct
52	Partially correct	8 ms	256 KB	Output is partially correct
53	Partially correct	7 ms	256 KB	Output is partially correct
54	Partially correct	8 ms	256 KB	Output is partially correct
55	Partially correct	8 ms	256 KB	Output is partially correct
56	Partially correct	8 ms	256 KB	Output is partially correct
57	Partially correct	8 ms	256 KB	Output is partially correct
58	Partially correct	8 ms	256 KB	Output is partially correct
59	Partially correct	8 ms	372 KB	Output is partially correct
60	Partially correct	7 ms	256 KB	Output is partially correct
61	Partially correct	7 ms	256 KB	Output is partially correct
62	Correct	1 ms	256 KB	Output is correct
63	Correct	0 ms	256 KB	Output is correct
64	Correct	1 ms	384 KB	Output is correct
65	Correct	0 ms	256 KB	Output is correct
66	Correct	0 ms	256 KB	Output is correct
67	Correct	0 ms	256 KB	Output is correct
68	Correct	1 ms	256 KB	Output is correct
69	Correct	0 ms	256 KB	Output is correct
70	Correct	1 ms	256 KB	Output is correct
71	Correct	0 ms	256 KB	Output is correct
72	Correct	0 ms	256 KB	Output is correct
73	Correct	1 ms	256 KB	Output is correct
74	Correct	0 ms	256 KB	Output is correct
75	Correct	1 ms	256 KB	Output is correct
76	Correct	1 ms	256 KB	Output is correct
77	Correct	0 ms	256 KB	Output is correct
78	Correct	0 ms	256 KB	Output is correct
79	Correct	0 ms	256 KB	Output is correct
80	Correct	0 ms	256 KB	Output is correct
81	Correct	0 ms	256 KB	Output is correct
82	Correct	0 ms	256 KB	Output is correct
83	Correct	0 ms	256 KB	Output is correct
84	Correct	0 ms	256 KB	Output is correct
85	Correct	0 ms	256 KB	Output is correct
86	Correct	0 ms	256 KB	Output is correct
87	Correct	0 ms	256 KB	Output is correct
88	Correct	0 ms	256 KB	Output is correct
89	Correct	0 ms	256 KB	Output is correct
90	Correct	0 ms	256 KB	Output is correct
91	Correct	0 ms	256 KB	Output is correct