oj.uz

Submission #409349

# Submission time Handle Problem Language Result Execution time Memory
409349 2021-05-20T15:29:52 Z Carmel_Ab1 Counting Mushrooms (IOI20_mushrooms) C++17
56.927 / 100
 12 ms 640 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"

//#include "stub.cpp"

using namespace std;

#define pb push_back
typedef vector<int> vi;
typedef long long ll;
int ceil(int a,int b){
    int ans=a/b;
    if(a%b)
        ans++;
    return ans;
}
int count_mushrooms(int n) {
    int ans=1;

    vi o,z,a(n,-1);
    a[0]=0;
    z.pb(0);

    if(n<=226){
        for(int i=1; i<n; i++)
            ans+=1- use_machine({0,i});
        return ans;
    }

    const int k=100;
    int first=1;
    for(int i=1; o.size()<k && z.size()<k;first++, i++){
        if(use_machine({0,i}))
            o.pb(i),a[i]=1;
        else
            ans++,z.pb(i),a[i]=0;
    }
    vi left;
    for(int i=first; i<n;i++)
        left.pb(i);

    if(o.size()>z.size()){
        for(int i=first,j=0; i<n;j=0, i++){
            vi cur;
            while(left.size() && cur.size()+2<=n && j<o.size()){
                cur.pb(o[j]);
                cur.pb(left.back());
                left.pop_back();
                j++;
            }
            if(cur.size()>=2)
                ans+= ceil(use_machine(cur),2);
        }
    }
    else{
        for(int i=first,j=0; i<n;j=0, i++){
            int in=0;
            vi cur;
            while(left.size() && cur.size()+2<=n && j<z.size()){
                cur.pb(z[j]);
                cur.pb(left.back());
                left.pop_back();
                j++;
                in++;
            }
            if(cur.size()>=2)
                ans+= in-ceil(use_machine(cur),2);
        }
    }

    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:45:46: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |             while(left.size() && cur.size()+2<=n && j<o.size()){
      |                                  ~~~~~~~~~~~~^~~
mushrooms.cpp:45:54: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             while(left.size() && cur.size()+2<=n && j<o.size()){
      |                                                     ~^~~~~~~~~
mushrooms.cpp:59:46: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |             while(left.size() && cur.size()+2<=n && j<z.size()){
      |                                  ~~~~~~~~~~~~^~~
mushrooms.cpp:59:54: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |             while(left.size() && cur.size()+2<=n && j<z.size()){
      |                                                     ~^~~~~~~~~

Subtask #1
56.927 / 100.0

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