oj.uz

Submission #367541

# Submission time Handle Problem Language Result Execution time Memory
367541 2021-02-17T15:47:07 Z rumen_m Counting Mushrooms (IOI20_mushrooms) C++17
92.2449 / 100
 13 ms 624 KB 
#include "mushrooms.h"
# include <bits/stdc++.h>
using namespace std;
vector <int> l[2];
const int K = 93;
int ans  = 1;
int count_mushrooms(int n) {
	int i,j;

	l[0].push_back(0);
	int x,y,type;
	vector <int> m;
	if(n==2)
    {
        m.push_back(0);
        m.push_back(1);
        int z = use_machine(m);
        return (z==0) ? 2 : 1;
    }
	for(i=1;i<=2;i++)
    {
        m.clear();
        m.push_back(0);
        m.push_back(i);
        int z = use_machine(m);
        l[z].push_back(i);
    }
	if(l[0].size()>=2)
    {
        type = 0;
        x = l[0][0];
        y = l[0][1];
    }
    else
    {
        type = 1;
        x = l[1][0];
        y = l[1][1];
    }
     i = 3;
    // l[0].push_back(0);
    while(i+1<n&&l[0].size()<K&&l[1].size()<K)
    {
        m.clear();
        m.push_back(i);
        i++;
        m.push_back(x);
        m.push_back(i);
        i++;
        m.push_back(y);
        int z = use_machine(m);
        l[(z&1)^type].push_back(i-2);
        l[((z&10)>>1)^type].push_back(i-1);

    }
    //cout<<"Here"<<endl;
    ans = l[0].size();
    while(i<n)
    {
        m.clear();
        type = l[0].size()<l[1].size();
        for(j=0;j<l[type].size()&&i<n;j++)
        {
            m.push_back(i);
            i++;
            m.push_back(l[type][j]);
        }
        int z = use_machine(m);
        l[(z&1)^type].push_back(m[0]);
        z = z/2+z%2;
        if(type==1)ans+=z;
        else
            ans+=(i-m[0]-z);
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:62:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for(j=0;j<l[type].size()&&i<n;j++)
      |                 ~^~~~~~~~~~~~~~~

Subtask #1
92.2449 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 6 ms 364 KB Output is correct
9 Correct 8 ms 404 KB Output is correct
10 Correct 8 ms 364 KB Output is correct
11 Partially correct 9 ms 364 KB Output is partially correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 7 ms 364 KB Output is correct
14 Correct 4 ms 364 KB Output is correct
15 Partially correct 8 ms 364 KB Output is partially correct
16 Partially correct 7 ms 364 KB Output is partially correct
17 Correct 5 ms 364 KB Output is correct
18 Correct 6 ms 364 KB Output is correct
19 Partially correct 10 ms 624 KB Output is partially correct
20 Correct 7 ms 364 KB Output is correct
21 Correct 6 ms 404 KB Output is correct
22 Partially correct 8 ms 492 KB Output is partially correct
23 Correct 11 ms 364 KB Output is correct
24 Correct 5 ms 492 KB Output is correct
25 Partially correct 11 ms 364 KB Output is partially correct
26 Partially correct 8 ms 364 KB Output is partially correct
27 Partially correct 8 ms 364 KB Output is partially correct
28 Partially correct 8 ms 364 KB Output is partially correct
29 Partially correct 9 ms 364 KB Output is partially correct
30 Partially correct 9 ms 364 KB Output is partially correct
31 Partially correct 12 ms 364 KB Output is partially correct
32 Partially correct 8 ms 364 KB Output is partially correct
33 Partially correct 9 ms 364 KB Output is partially correct
34 Partially correct 9 ms 364 KB Output is partially correct
35 Partially correct 9 ms 364 KB Output is partially correct
36 Partially correct 9 ms 364 KB Output is partially correct
37 Partially correct 6 ms 404 KB Output is partially correct
38 Partially correct 9 ms 364 KB Output is partially correct
39 Partially correct 6 ms 404 KB Output is partially correct
40 Partially correct 13 ms 364 KB Output is partially correct
41 Partially correct 8 ms 364 KB Output is partially correct
42 Partially correct 12 ms 364 KB Output is partially correct
43 Partially correct 8 ms 364 KB Output is partially correct
44 Partially correct 8 ms 364 KB Output is partially correct
45 Partially correct 9 ms 364 KB Output is partially correct
46 Partially correct 7 ms 364 KB Output is partially correct
47 Partially correct 9 ms 392 KB Output is partially correct
48 Partially correct 7 ms 364 KB Output is partially correct
49 Partially correct 11 ms 364 KB Output is partially correct
50 Partially correct 9 ms 364 KB Output is partially correct
51 Partially correct 9 ms 364 KB Output is partially correct
52 Partially correct 8 ms 364 KB Output is partially correct
53 Partially correct 7 ms 364 KB Output is partially correct
54 Partially correct 8 ms 364 KB Output is partially correct
55 Partially correct 8 ms 364 KB Output is partially correct
56 Partially correct 7 ms 364 KB Output is partially correct
57 Partially correct 8 ms 364 KB Output is partially correct
58 Partially correct 8 ms 364 KB Output is partially correct
59 Partially correct 8 ms 364 KB Output is partially correct
60 Partially correct 7 ms 364 KB Output is partially correct
61 Partially correct 6 ms 404 KB Output is partially correct
62 Correct 0 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 0 ms 364 KB Output is correct
68 Correct 0 ms 364 KB Output is correct
69 Correct 0 ms 364 KB Output is correct
70 Correct 0 ms 364 KB Output is correct
71 Correct 0 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 0 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 0 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 0 ms 364 KB Output is correct
80 Correct 1 ms 364 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 0 ms 364 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 0 ms 364 KB Output is correct