답안 #308523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308523	2020-10-01T13:14:26 Z	Peti	버섯 세기 (IOI20_mushrooms)	C++14	87.5969 / 100	10 ms	384 KB

mushrooms

#include "mushrooms.h"
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

const int find_first = 130;

pair<int, int> ask_querry(vector<int> &inds, int &x, int &n){
    int m = min((int)inds.size()*2, (n-x)*2);
    m = min(m, n - n%2);
    vector<int> querry(m);

    for(int i = 0; i < m; i += 2)
        querry[i] = inds[i/2];
    for(int i = 1; i < m; i += 2)
        querry[i] = x++;

    return make_pair(use_machine(querry), m);
}

int count_mushrooms(int n) {
    int ret = 1, x = 1;
    vector<int> indsA, indsB;
    indsA.push_back(0);

    while((int)indsA.size() < 2 && (int)indsB.size() < 2)
    {
        if(x == n)
            return ret;
        vector<int> querry = {0, x};
        int ans = use_machine(querry);
        if(ans == 0)
        {
            indsA.push_back(x);
            ret++;
        }
        else
            indsB.push_back(x);
        x++;
    }

    while((int)indsA.size() < find_first && (int)indsB.size() < find_first)
    {
        if(x == n)
            return ret;
        if(x == n-1)
        {
            vector<int> querry = {0, x};
            int ans = use_machine(querry);
            if(ans == 0)
                return ret + 1;
            return ret;
        }

        vector<int> querry(4);
        if((int)indsA.size() > 1)
        {
            querry[0] = indsA[0];
            querry[2] = indsA[1];
            querry[1] = x;
            querry[3] = x+1;

            int ans = use_machine(querry);
            ret += 2 - (ans+1)/2;
            if(ans < 2)
                indsA.push_back(x);
            else
                indsB.push_back(x);
            if(ans%2 == 0)
                indsA.push_back(x+1);
            else
                indsB.push_back(x+1);
            x += 2;
        }
        else
        {
            querry[0] = indsB[0];
            querry[2] = indsB[1];
            querry[1] = x;
            querry[3] = x+1;

            int ans = use_machine(querry);
            ret += (ans+1)/2;
            if(ans >= 2)
                indsA.push_back(x);
            else
                indsB.push_back(x);
            if(ans%2 == 1)
                indsA.push_back(x+1);
            else
                indsB.push_back(x+1);
            x += 2;
        }
    }

    while(x < n)
    {
        if(indsA.size() > indsB.size())
        {
            pair<int, int> ans = ask_querry(indsA, x, n);

            if(ans.first%2 == 0)
                indsA.push_back(x-1);
            ret += ans.second/2 - (ans.first+1)/2;
        }
        else
        {
            pair<int, int> ans = ask_querry(indsB, x, n);

            if(ans.first%2 == 1)
                indsA.push_back(x-1);
            ret += (ans.first+1)/2;
        }
    }

	return ret;
}

Subtask #1

87.5969 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	7 ms	256 KB	Output is correct
8	Correct	7 ms	256 KB	Output is correct
9	Correct	7 ms	256 KB	Output is correct
10	Correct	8 ms	256 KB	Output is correct
11	Partially correct	7 ms	256 KB	Output is partially correct
12	Partially correct	7 ms	256 KB	Output is partially correct
13	Correct	8 ms	256 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Partially correct	7 ms	256 KB	Output is partially correct
16	Partially correct	9 ms	256 KB	Output is partially correct
17	Correct	4 ms	256 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	9 ms	256 KB	Output is correct
21	Partially correct	9 ms	256 KB	Output is partially correct
22	Partially correct	8 ms	256 KB	Output is partially correct
23	Correct	7 ms	256 KB	Output is correct
24	Correct	5 ms	256 KB	Output is correct
25	Partially correct	10 ms	256 KB	Output is partially correct
26	Partially correct	8 ms	256 KB	Output is partially correct
27	Partially correct	9 ms	256 KB	Output is partially correct
28	Partially correct	8 ms	256 KB	Output is partially correct
29	Partially correct	7 ms	256 KB	Output is partially correct
30	Partially correct	9 ms	256 KB	Output is partially correct
31	Partially correct	7 ms	256 KB	Output is partially correct
32	Partially correct	9 ms	256 KB	Output is partially correct
33	Partially correct	8 ms	256 KB	Output is partially correct
34	Partially correct	8 ms	256 KB	Output is partially correct
35	Partially correct	9 ms	256 KB	Output is partially correct
36	Partially correct	9 ms	256 KB	Output is partially correct
37	Partially correct	8 ms	256 KB	Output is partially correct
38	Partially correct	9 ms	256 KB	Output is partially correct
39	Partially correct	8 ms	256 KB	Output is partially correct
40	Partially correct	9 ms	256 KB	Output is partially correct
41	Partially correct	7 ms	256 KB	Output is partially correct
42	Partially correct	7 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	8 ms	256 KB	Output is partially correct
46	Partially correct	8 ms	256 KB	Output is partially correct
47	Partially correct	6 ms	372 KB	Output is partially correct
48	Partially correct	7 ms	256 KB	Output is partially correct
49	Partially correct	7 ms	256 KB	Output is partially correct
50	Partially correct	9 ms	256 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	10 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	7 ms	256 KB	Output is partially correct
58	Partially correct	8 ms	384 KB	Output is partially correct
59	Partially correct	7 ms	256 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	0 ms	256 KB	Output is correct
65	Correct	0 ms	256 KB	Output is correct
66	Correct	1 ms	256 KB	Output is correct
67	Correct	0 ms	256 KB	Output is correct
68	Correct	0 ms	256 KB	Output is correct
69	Correct	0 ms	256 KB	Output is correct
70	Correct	0 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	0 ms	256 KB	Output is correct
74	Correct	0 ms	256 KB	Output is correct
75	Correct	0 ms	256 KB	Output is correct
76	Correct	0 ms	256 KB	Output is correct
77	Correct	1 ms	256 KB	Output is correct
78	Correct	0 ms	256 KB	Output is correct
79	Correct	1 ms	256 KB	Output is correct
80	Correct	1 ms	256 KB	Output is correct
81	Correct	1 ms	256 KB	Output is correct
82	Correct	1 ms	256 KB	Output is correct
83	Correct	1 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	1 ms	256 KB	Output is correct
87	Correct	0 ms	256 KB	Output is correct
88	Correct	1 ms	256 KB	Output is correct
89	Correct	1 ms	256 KB	Output is correct
90	Correct	1 ms	256 KB	Output is correct
91	Correct	0 ms	256 KB	Output is correct