oj.uz

Submission #306727

# Submission time Handle Problem Language Result Execution time Memory
306727 2020-09-26T07:59:19 Z daniel920712 Counting Mushrooms (IOI20_mushrooms) C++14
78.2007 / 100
 10 ms 388 KB 
#include "mushrooms.h"
#include <vector>
#include <math.h>
using namespace std;
vector < int > A,B;
vector < int > temp;
vector < int > fin;
int count_mushrooms(int N)
{
    int k=ceil(sqrt(N)),ans=0,x=0,y=0,i,now,tt;
    for(i=1;i<=min(N-1,2*k);i+=2)
    {
        temp.clear();
        temp.push_back(0);
        temp.push_back(i);
        if(i+1<=min(N-1,2*k))
        {
            temp.push_back(i+1);
            tt=use_machine(temp);
            if(tt==0)
            {
                A.push_back(i);
                A.push_back(i+1);
                y+=2;
                ans+=2;
            }
            else if(tt==2)
            {
                A.push_back(i+1);
                B.push_back(i);
                x++;
                y++;
                ans++;
            }
            else
            {
                B.push_back(i+1);
                x++;
                fin.push_back(i);
                fin.push_back(i+1);
            }
        }
        else
        {
            if(use_machine(temp))
            {
                x++;
                B.push_back(i);
            }
            else
            {
                y++;
                ans++;
                A.push_back(i);
            }
        }

    }
    if(!fin.empty()) ans+=(use_machine(fin)+1)/2;
    if(x>=y)
    {
        now=2*k+1;
        while(now<N)
        {
            temp.clear();
            for(auto i:B)
            {
                temp.push_back(i);
                if(now<N)
                {
                    temp.push_back(now);
                    now++;
                }
            }

            if(temp.size()>=2)
            {
                tt=use_machine(temp);
                ans+=(tt+1)/2;
                if(tt%2==0) 
                {
                    B.push_back(*prev(temp.end()));
                    x++;
                }
            }

        }

    }
    else
    {
        now=2*k+1;
        while(now<N)
        {
            temp.clear();
            for(auto i:A)
            {
                temp.push_back(i);
                if(now<N)
                {
                    temp.push_back(now);
                    now++;
                }
            }
            if(temp.size()>=2)
            {
                tt=use_machine(temp);
                ans+=(temp.size()-y-(tt+1)/2);
                if(tt%2==0)
                {
                    A.push_back(*prev(temp.end()));
                    y++;
                }
            }
        }
    }
    //ans+=y;*/
	return ans+1;
}

Subtask #1
78.2007 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 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 256 KB Output is correct
7 Correct 6 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 Partially correct 8 ms 256 KB Output is partially correct
11 Partially correct 10 ms 256 KB Output is partially correct
12 Partially correct 8 ms 256 KB Output is partially correct
13 Partially correct 7 ms 256 KB Output is partially correct
14 Correct 5 ms 256 KB Output is correct
15 Partially correct 8 ms 256 KB Output is partially correct
16 Partially correct 8 ms 256 KB Output is partially correct
17 Correct 5 ms 256 KB Output is correct
18 Partially correct 9 ms 256 KB Output is partially correct
19 Partially correct 7 ms 256 KB Output is partially correct
20 Partially correct 9 ms 256 KB Output is partially correct
21 Partially correct 8 ms 256 KB Output is partially correct
22 Partially correct 8 ms 256 KB Output is partially correct
23 Partially correct 7 ms 256 KB Output is partially correct
24 Correct 4 ms 256 KB Output is correct
25 Partially correct 8 ms 256 KB Output is partially correct
26 Partially correct 10 ms 256 KB Output is partially correct
27 Partially correct 7 ms 256 KB Output is partially correct
28 Partially correct 7 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 6 ms 364 KB Output is partially correct
32 Partially correct 8 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 7 ms 256 KB Output is partially correct
36 Partially correct 8 ms 256 KB Output is partially correct
37 Partially correct 7 ms 256 KB Output is partially correct
38 Partially correct 7 ms 256 KB Output is partially correct
39 Partially correct 6 ms 256 KB Output is partially correct
40 Partially correct 7 ms 256 KB Output is partially correct
41 Partially correct 8 ms 384 KB Output is partially correct
42 Partially correct 7 ms 256 KB Output is partially correct
43 Partially correct 6 ms 388 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 8 ms 256 KB Output is partially correct
48 Partially correct 9 ms 256 KB Output is partially correct
49 Partially correct 7 ms 256 KB Output is partially correct
50 Partially correct 7 ms 256 KB Output is partially correct
51 Partially correct 7 ms 256 KB Output is partially correct
52 Partially correct 7 ms 256 KB Output is partially correct
53 Partially correct 8 ms 256 KB Output is partially correct
54 Partially correct 7 ms 256 KB Output is partially correct
55 Partially correct 6 ms 368 KB Output is partially correct
56 Partially correct 7 ms 256 KB Output is partially correct
57 Partially correct 8 ms 256 KB Output is partially correct
58 Partially correct 7 ms 256 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 8 ms 256 KB Output is partially correct
62 Correct 0 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 0 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 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 1 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