Submission #780856

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
780856	2023-07-12T14:01:32 Z	teamariaa	Counting Mushrooms (IOI20_mushrooms)	C++17	56.927 / 100	8 ms	312 KB

mushrooms

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

using namespace std;

#define pb push_back

int count_mushrooms(int n)
{
    vector <int> m, aPos, bPos;
    int ans, cnt = 0, flag = 0;
    int capat = min(200, n);
    aPos.pb(0);
//    cout << capat << "\n";
    for(int i = 1; i < capat; i ++)
    {
//        cout << "a\n";
        m = {0, i};
        ans = use_machine(m);
        if(ans)
            bPos.pb(i);
        else
            aPos.pb(i);
    }

//    cout << "fsfsd " << bPos.size() << "\n";
    if(n < 200)
        return aPos.size();

    int len;

    if(aPos.size() > bPos.size())
    {
        m.resize(2 * aPos.size());
        for(int i = 0; i < aPos.size(); i ++)
            m[2 * i] = aPos[i];
        len = aPos.size();
    }
    else
    {
        m.resize(2 * bPos.size());
        flag = 1;
        for(int i = 0; i < bPos.size(); i ++)
            m[2 * i] = bPos[i];
        len = bPos.size();
    }

    cnt += aPos.size();
//    cout << cnt << "aa\n";

    int i = 200;
    while(i < n)
    {
        int k = 0;
        while(i < n  &&  k < len)
        {
            m[2 * k + 1] = i;
            i ++;
            k ++;
        }
        if(i == n  &&  k < len)
        {
            m.resize(2 * k);
            ans = use_machine(m);
            if(flag)
            {
                cnt += (ans + 1) / 2;
//                cout << cnt << "b1\n";
            }
            else
            {
                int bNo = (ans + 1) / 2;
                cnt += k - bNo;
//                cout << cnt << "b2\n";
            }
            break;
        }

        ans = use_machine(m);
        if(flag)
        {
            cnt += (ans + 1) / 2;
//            cout << cnt << "b3\n";

        }
        else
        {
            int bNo = (ans + 1) / 2;
            cnt += len - bNo;
//            cout << cnt << "b4\n";

        }
    }
    return cnt;

//    for(int i = 0; i < (n - 200) / len; i ++)
//    {
//        for(int j = 200 + i * len; j < 200 + (i + 1) * len; j ++)
//        {
//            m[2 * j + 1] = j;
//        }
//
//        ans = use_machine(m);
//        if(flag)
//        {
//            cnt += (ans + 1) / 2;
//        }
//        else
//        {
//            int bNo = (ans + 1) / 2;
//            cnt += len - bNo;
//        }
//    }

}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:35:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int i = 0; i < aPos.size(); i ++)
      |                        ~~^~~~~~~~~~~~~
mushrooms.cpp:43:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int i = 0; i < bPos.size(); i ++)
      |                        ~~^~~~~~~~~~~~~

Subtask #1

56.927 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	3 ms	308 KB	Output is correct
7	Partially correct	6 ms	208 KB	Output is partially correct
8	Partially correct	5 ms	208 KB	Output is partially correct
9	Partially correct	5 ms	304 KB	Output is partially correct
10	Partially correct	5 ms	208 KB	Output is partially correct
11	Partially correct	6 ms	208 KB	Output is partially correct
12	Partially correct	6 ms	208 KB	Output is partially correct
13	Partially correct	6 ms	208 KB	Output is partially correct
14	Partially correct	4 ms	208 KB	Output is partially correct
15	Partially correct	6 ms	308 KB	Output is partially correct
16	Partially correct	8 ms	208 KB	Output is partially correct
17	Partially correct	3 ms	208 KB	Output is partially correct
18	Partially correct	5 ms	208 KB	Output is partially correct
19	Partially correct	7 ms	304 KB	Output is partially correct
20	Partially correct	6 ms	208 KB	Output is partially correct
21	Partially correct	6 ms	208 KB	Output is partially correct
22	Partially correct	7 ms	208 KB	Output is partially correct
23	Partially correct	8 ms	208 KB	Output is partially correct
24	Partially correct	5 ms	208 KB	Output is partially correct
25	Partially correct	7 ms	208 KB	Output is partially correct
26	Partially correct	7 ms	208 KB	Output is partially correct
27	Partially correct	6 ms	208 KB	Output is partially correct
28	Partially correct	6 ms	208 KB	Output is partially correct
29	Partially correct	7 ms	208 KB	Output is partially correct
30	Partially correct	6 ms	280 KB	Output is partially correct
31	Partially correct	8 ms	208 KB	Output is partially correct
32	Partially correct	5 ms	208 KB	Output is partially correct
33	Partially correct	8 ms	208 KB	Output is partially correct
34	Partially correct	6 ms	208 KB	Output is partially correct
35	Partially correct	7 ms	308 KB	Output is partially correct
36	Partially correct	7 ms	208 KB	Output is partially correct
37	Partially correct	6 ms	208 KB	Output is partially correct
38	Partially correct	4 ms	308 KB	Output is partially correct
39	Partially correct	6 ms	208 KB	Output is partially correct
40	Partially correct	7 ms	304 KB	Output is partially correct
41	Partially correct	6 ms	300 KB	Output is partially correct
42	Partially correct	7 ms	208 KB	Output is partially correct
43	Partially correct	7 ms	208 KB	Output is partially correct
44	Partially correct	7 ms	312 KB	Output is partially correct
45	Partially correct	5 ms	208 KB	Output is partially correct
46	Partially correct	6 ms	308 KB	Output is partially correct
47	Partially correct	6 ms	208 KB	Output is partially correct
48	Partially correct	6 ms	208 KB	Output is partially correct
49	Partially correct	6 ms	208 KB	Output is partially correct
50	Partially correct	6 ms	208 KB	Output is partially correct
51	Partially correct	6 ms	208 KB	Output is partially correct
52	Partially correct	8 ms	208 KB	Output is partially correct
53	Partially correct	7 ms	208 KB	Output is partially correct
54	Partially correct	8 ms	208 KB	Output is partially correct
55	Partially correct	6 ms	208 KB	Output is partially correct
56	Partially correct	7 ms	312 KB	Output is partially correct
57	Partially correct	7 ms	208 KB	Output is partially correct
58	Partially correct	7 ms	304 KB	Output is partially correct
59	Partially correct	7 ms	308 KB	Output is partially correct
60	Partially correct	7 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	0 ms	208 KB	Output is correct
69	Correct	0 ms	208 KB	Output is correct
70	Correct	0 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	212 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	0 ms	208 KB	Output is correct
81	Correct	1 ms	208 KB	Output is correct
82	Correct	0 ms	208 KB	Output is correct
83	Correct	1 ms	208 KB	Output is correct
84	Correct	1 ms	292 KB	Output is correct
85	Correct	1 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