답안 #730113

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
730113	2023-04-25T09:43:49 Z	danikoynov	버섯 세기 (IOI20_mushrooms)	C++14	84.3284 / 100	10 ms	448 KB

mushrooms

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

const int maxn = 2e4 + 10;
const int block = 220;

int type[maxn];
int count_mushrooms(int n)
{
    vector < int > A, B;
    A.push_back(0);
    for (int i = 1; i < min(n, 4); i ++)
    {
        vector < int > tmp;
        tmp.push_back(0);
        tmp.push_back(i);
        if (use_machine(tmp) == 0)
            A.push_back(i);
        else
            B.push_back(i);
    }

    if (n <= block)
    {
        for (int i = 4; i < n; i ++)
        {
            vector < int > tmp;
            tmp.push_back(0);
            tmp.push_back(i);
            if (use_machine(tmp) == 0)
                A.push_back(i);
        }
        return A.size();
    }
    if (A.size() > 1)
    {
        for (int i = 4; i < min(n - 1, block); i += 2)
        {
            vector < int > tmp;
            tmp.push_back(A[0]);
            tmp.push_back(i);
            tmp.push_back(A[1]);
            tmp.push_back(i + 1);
            int val = use_machine(tmp);
            if (val % 2 == 1)
                B.push_back(i + 1);
            else
                A.push_back(i + 1);
            if (val > 1)
                B.push_back(i);
            else
                A.push_back(i);
        }
    }
    else
    {
                for (int i = 4; i < block; i += 2)
        {
            vector < int > tmp;
            tmp.push_back(B[0]);
            tmp.push_back(i);
            tmp.push_back(B[1]);
            tmp.push_back(i + 1);
            int val = use_machine(tmp);
            if (val % 2 == 1)
                A.push_back(i + 1);
            else
                B.push_back(i + 1);
            if (val > 1)
                A.push_back(i);
            else
                B.push_back(i);
        }
    }


    int cntA = 0, cntB = 0;
    int i = block;
    while(i < n)
    {

        int j = min(n, (int)i + (int)max(A.size(), B.size())), len = j - i;

        if (A.size() > B.size())
        {

            vector < int > tmp;
            for (int f = 0; f < len; f ++)
            {
                tmp.push_back(A[f]);
                tmp.push_back(i + f);
            }
            int val = use_machine(tmp);
            if (val % 2 == 1)
            {
                B.push_back(j - 1);
                val --;

            }
            else
                cntA ++;
                ///cout << len << " : " << val << endl;
            cntB = cntB + val / 2;
            cntA = cntA + (len - 1) - val / 2;
        }
        else
        {
                        vector < int > tmp;
            for (int f = 0; f < len; f ++)
            {
                tmp.push_back(B[f]);
                tmp.push_back(i + f);
            }
            int val = use_machine(tmp);
            if (val % 2 == 1)
            {
                A.push_back(j - 1);
                val --;
            }
            else
                cntB ++;

            cntA = cntA + val / 2;
            cntB = cntB + (len - 1) - val / 2;
        }
        i = j;
    }

    return cntA + A.size();
}

Subtask #1

84.3284 / 100.0

#	결과	실행 시간	메모리	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	3 ms	208 KB	Output is correct
6	Correct	2 ms	208 KB	Output is correct
7	Correct	6 ms	208 KB	Output is correct
8	Correct	7 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Partially correct	9 ms	208 KB	Output is partially correct
11	Partially correct	8 ms	316 KB	Output is partially correct
12	Partially correct	6 ms	208 KB	Output is partially correct
13	Correct	7 ms	208 KB	Output is correct
14	Correct	3 ms	208 KB	Output is correct
15	Partially correct	5 ms	320 KB	Output is partially correct
16	Partially correct	6 ms	208 KB	Output is partially correct
17	Correct	3 ms	208 KB	Output is correct
18	Correct	5 ms	208 KB	Output is correct
19	Partially correct	6 ms	208 KB	Output is partially correct
20	Partially correct	7 ms	208 KB	Output is partially correct
21	Partially correct	6 ms	208 KB	Output is partially correct
22	Partially correct	7 ms	316 KB	Output is partially correct
23	Partially correct	6 ms	208 KB	Output is partially correct
24	Correct	4 ms	316 KB	Output is correct
25	Partially correct	8 ms	208 KB	Output is partially correct
26	Partially correct	7 ms	208 KB	Output is partially correct
27	Partially correct	7 ms	312 KB	Output is partially correct
28	Partially correct	6 ms	316 KB	Output is partially correct
29	Partially correct	8 ms	320 KB	Output is partially correct
30	Partially correct	7 ms	448 KB	Output is partially correct
31	Partially correct	6 ms	312 KB	Output is partially correct
32	Partially correct	7 ms	328 KB	Output is partially correct
33	Partially correct	6 ms	328 KB	Output is partially correct
34	Partially correct	7 ms	312 KB	Output is partially correct
35	Partially correct	6 ms	208 KB	Output is partially correct
36	Partially correct	6 ms	236 KB	Output is partially correct
37	Partially correct	8 ms	324 KB	Output is partially correct
38	Partially correct	7 ms	208 KB	Output is partially correct
39	Partially correct	6 ms	208 KB	Output is partially correct
40	Partially correct	5 ms	208 KB	Output is partially correct
41	Partially correct	7 ms	320 KB	Output is partially correct
42	Partially correct	6 ms	208 KB	Output is partially correct
43	Partially correct	7 ms	312 KB	Output is partially correct
44	Partially correct	6 ms	208 KB	Output is partially correct
45	Partially correct	8 ms	328 KB	Output is partially correct
46	Partially correct	6 ms	324 KB	Output is partially correct
47	Partially correct	8 ms	324 KB	Output is partially correct
48	Partially correct	7 ms	336 KB	Output is partially correct
49	Partially correct	9 ms	208 KB	Output is partially correct
50	Partially correct	10 ms	344 KB	Output is partially correct
51	Partially correct	7 ms	312 KB	Output is partially correct
52	Partially correct	5 ms	328 KB	Output is partially correct
53	Partially correct	6 ms	336 KB	Output is partially correct
54	Partially correct	9 ms	320 KB	Output is partially correct
55	Partially correct	8 ms	208 KB	Output is partially correct
56	Partially correct	8 ms	208 KB	Output is partially correct
57	Partially correct	6 ms	208 KB	Output is partially correct
58	Partially correct	6 ms	320 KB	Output is partially correct
59	Partially correct	7 ms	332 KB	Output is partially correct
60	Partially correct	6 ms	208 KB	Output is partially correct
61	Partially correct	6 ms	208 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	0 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	0 ms	208 KB	Output is correct
73	Correct	0 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	0 ms	208 KB	Output is correct
77	Correct	0 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	0 ms	208 KB	Output is correct
82	Correct	1 ms	208 KB	Output is correct
83	Correct	0 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	0 ms	208 KB	Output is correct
90	Correct	0 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct