답안 #957379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957379	2024-04-03T15:15:38 Z	12345678	버섯 세기 (IOI20_mushrooms)	C++17	80.427 / 100	6 ms	956 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

int res, a, b, m, sz;
vector<int> x, y;

namespace SUB2
{
int count_mushrooms(int n) {
    int res=1;
    vector<int> qrs;
    for (int i=1; i<n; i+=2)
    {
        if (i==n-1) 
        {
            if (use_machine(vector<int> {0, i})==0) res++;
        }
        else
        {
            auto tmp=use_machine(vector<int> {0, i, i+1});
            if (tmp==2) res++;
            else if (tmp==0) res+=2;
            else
            {
                qrs.push_back(i+1);
                qrs.push_back(i);
            }
        }
    }
	if (qrs.size()>0)
    {
        res+=(use_machine(qrs)+1)/2;
    }
	return res;
}
}

int count_mushrooms(int n) {
    if (n<=282)
    {
        return SUB2::count_mushrooms(n);
    }
    x.push_back(0);
    if (use_machine(vector<int> {0, 1})==0) 
    {
        a=0, b=1, m=0;
        x.push_back(1);
        if (use_machine(vector<int> {1, 2})==0) x.push_back(2);
        else y.push_back(2);
    }
    else if (use_machine(vector<int> {1, 2})==0) a=1, b=2, m=1, y.push_back(1), y.push_back(2);
    else a=0, b=2, m=0, y.push_back(1), x.push_back(2);
    for (int i=3; i<282; i+=2)
    {
        int tmp=use_machine(vector<int> {a, i, b, i+1});
        if (m)
        {
            if (tmp==3) x.push_back(i), x.push_back(i+1);
            else if (tmp==2) x.push_back(i), y.push_back(i+1);
            else if (tmp==1) x.push_back(i+1), y.push_back(i);
            else y.push_back(i), y.push_back(i+1);
        }
        else
        {
            if (tmp==3) y.push_back(i), y.push_back(i+1);
            else if (tmp==2) y.push_back(i), x.push_back(i+1);
            else if (tmp==1) y.push_back(i+1), x.push_back(i);
            else x.push_back(i), x.push_back(i+1);
        }
    }
    res=x.size();
    if (x.size()>=y.size()) m=0, sz=x.size();
    else m=1, sz=y.size();
    /*
    cout<<"debug x : ";
    for (auto z:x) cout<<z<<' ';
    cout<<'\n';
    cout<<"debug y : ";
    for (auto z:y) cout<<z<<' ';
    cout<<'\n';
    */
    for (int i=283; i<n; i+=sz)
    {
        vector<int> qrs;
        int cnt=0;
        for (int j=0; j<sz; j++)
        {
            if (m) qrs.push_back(y[j]);
            else qrs.push_back(x[j]);
            if (i+j<n) qrs.push_back(i+j), cnt++;
        }
        int tmp=(use_machine(qrs)+1)/2;
        if (m) res+=tmp;
        else res+=cnt-tmp;
    }
	return res;
}

Subtask #1

80.427 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	444 KB	Output is correct
7	Correct	4 ms	448 KB	Output is correct
8	Correct	4 ms	452 KB	Output is correct
9	Correct	4 ms	444 KB	Output is correct
10	Partially correct	4 ms	444 KB	Output is partially correct
11	Partially correct	5 ms	448 KB	Output is partially correct
12	Partially correct	6 ms	444 KB	Output is partially correct
13	Correct	4 ms	448 KB	Output is correct
14	Correct	3 ms	444 KB	Output is correct
15	Partially correct	4 ms	452 KB	Output is partially correct
16	Partially correct	5 ms	440 KB	Output is partially correct
17	Correct	3 ms	448 KB	Output is correct
18	Correct	4 ms	444 KB	Output is correct
19	Partially correct	5 ms	448 KB	Output is partially correct
20	Partially correct	5 ms	448 KB	Output is partially correct
21	Partially correct	5 ms	452 KB	Output is partially correct
22	Partially correct	4 ms	448 KB	Output is partially correct
23	Partially correct	4 ms	448 KB	Output is partially correct
24	Correct	3 ms	448 KB	Output is correct
25	Partially correct	4 ms	448 KB	Output is partially correct
26	Partially correct	4 ms	448 KB	Output is partially correct
27	Partially correct	4 ms	452 KB	Output is partially correct
28	Partially correct	4 ms	448 KB	Output is partially correct
29	Partially correct	5 ms	440 KB	Output is partially correct
30	Partially correct	5 ms	444 KB	Output is partially correct
31	Partially correct	5 ms	600 KB	Output is partially correct
32	Partially correct	5 ms	448 KB	Output is partially correct
33	Partially correct	4 ms	448 KB	Output is partially correct
34	Partially correct	4 ms	452 KB	Output is partially correct
35	Partially correct	4 ms	452 KB	Output is partially correct
36	Partially correct	4 ms	444 KB	Output is partially correct
37	Partially correct	5 ms	444 KB	Output is partially correct
38	Partially correct	5 ms	452 KB	Output is partially correct
39	Partially correct	5 ms	520 KB	Output is partially correct
40	Partially correct	4 ms	444 KB	Output is partially correct
41	Partially correct	4 ms	444 KB	Output is partially correct
42	Partially correct	4 ms	448 KB	Output is partially correct
43	Partially correct	4 ms	696 KB	Output is partially correct
44	Partially correct	6 ms	444 KB	Output is partially correct
45	Partially correct	4 ms	448 KB	Output is partially correct
46	Partially correct	4 ms	444 KB	Output is partially correct
47	Partially correct	4 ms	448 KB	Output is partially correct
48	Partially correct	5 ms	444 KB	Output is partially correct
49	Partially correct	4 ms	452 KB	Output is partially correct
50	Partially correct	5 ms	956 KB	Output is partially correct
51	Partially correct	4 ms	452 KB	Output is partially correct
52	Partially correct	5 ms	856 KB	Output is partially correct
53	Partially correct	4 ms	452 KB	Output is partially correct
54	Partially correct	4 ms	604 KB	Output is partially correct
55	Partially correct	5 ms	444 KB	Output is partially correct
56	Partially correct	6 ms	444 KB	Output is partially correct
57	Partially correct	5 ms	444 KB	Output is partially correct
58	Partially correct	4 ms	448 KB	Output is partially correct
59	Partially correct	5 ms	452 KB	Output is partially correct
60	Partially correct	4 ms	444 KB	Output is partially correct
61	Partially correct	5 ms	452 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	0 ms	344 KB	Output is correct
72	Correct	0 ms	344 KB	Output is correct
73	Correct	1 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	1 ms	344 KB	Output is correct
79	Correct	0 ms	344 KB	Output is correct
80	Correct	1 ms	504 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	1 ms	356 KB	Output is correct
88	Correct	0 ms	352 KB	Output is correct
89	Correct	1 ms	344 KB	Output is correct
90	Correct	0 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct