Submission #1066117

# Submission time Handle Problem Language Result Execution time Memory
1066117 2024-08-19T15:10:21 Z Ahmed57 Counting Mushrooms (IOI20_mushrooms) C++17
25.7697 / 100
13 ms 1144 KB
#include "bits/stdc++.h"
using namespace std;
#include "mushrooms.h"
int count_mushrooms(int n){
    int B = 417;
    vector<int> BS;
    int cnt = 0;
    vector<int> pending;
    for(int i = 0;i<n;i+=B){
        vector<int> v;
        if(i!=0)v.push_back(0);
        for(int j = i;j<min(n,i+B);j++)v.push_back(j);
        if(use_machine(v)==0){
            cnt+=(min(i+B,n)-i);
            continue;
        }
        int l = max(1,i) , r =min(n-1,i+B-1) , ans = -1;
        while(l<=r){
            vector<int> v;
            int mid = (l+r)/2;
            if(i!=0)v.push_back(0);
            for(int j = i;j<=mid;j++){
                v.push_back(j);
            }
            if(use_machine(v)!=0){
                ans = mid;
                r = mid-1;
            }else l = mid+1;
        } 
        BS.push_back(ans);
        for(int j = ans+1;j<min(n,i+B);j++){
            pending.push_back(j);
        }
        cnt+=ans-i;
    }
    int sz = BS.size();
    int sz2 = pending.size();
    for(int i = 0;i<pending.size();i+=sz){
        int xd = i;
        vector<int> lol;
        for(int j = i;j<min(sz2,i+sz);j++){
            lol.push_back(BS[j-i]);
            lol.push_back(pending[j]);
        }
        int ans = use_machine(lol);
        if(ans%2){
            cnt++;
            ans--;
        }
        ans/=2;
        cnt+=ans;
    }
    return cnt;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i = 0;i<pending.size();i+=sz){
      |                   ~^~~~~~~~~~~~~~~
mushrooms.cpp:39:13: warning: unused variable 'xd' [-Wunused-variable]
   39 |         int xd = i;
      |             ^~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Partially correct 4 ms 344 KB Output is partially correct
7 Partially correct 5 ms 716 KB Output is partially correct
8 Partially correct 9 ms 464 KB Output is partially correct
9 Partially correct 8 ms 600 KB Output is partially correct
10 Partially correct 8 ms 600 KB Output is partially correct
11 Partially correct 11 ms 600 KB Output is partially correct
12 Partially correct 9 ms 600 KB Output is partially correct
13 Partially correct 9 ms 856 KB Output is partially correct
14 Partially correct 5 ms 600 KB Output is partially correct
15 Partially correct 8 ms 576 KB Output is partially correct
16 Partially correct 10 ms 600 KB Output is partially correct
17 Partially correct 8 ms 544 KB Output is partially correct
18 Partially correct 8 ms 600 KB Output is partially correct
19 Partially correct 9 ms 680 KB Output is partially correct
20 Partially correct 8 ms 600 KB Output is partially correct
21 Partially correct 8 ms 600 KB Output is partially correct
22 Partially correct 9 ms 600 KB Output is partially correct
23 Partially correct 11 ms 600 KB Output is partially correct
24 Partially correct 6 ms 556 KB Output is partially correct
25 Partially correct 8 ms 600 KB Output is partially correct
26 Partially correct 8 ms 600 KB Output is partially correct
27 Partially correct 8 ms 600 KB Output is partially correct
28 Partially correct 9 ms 600 KB Output is partially correct
29 Partially correct 8 ms 600 KB Output is partially correct
30 Partially correct 9 ms 560 KB Output is partially correct
31 Partially correct 8 ms 600 KB Output is partially correct
32 Partially correct 9 ms 664 KB Output is partially correct
33 Partially correct 8 ms 764 KB Output is partially correct
34 Partially correct 8 ms 856 KB Output is partially correct
35 Partially correct 10 ms 600 KB Output is partially correct
36 Partially correct 8 ms 600 KB Output is partially correct
37 Partially correct 8 ms 600 KB Output is partially correct
38 Partially correct 8 ms 664 KB Output is partially correct
39 Partially correct 9 ms 660 KB Output is partially correct
40 Partially correct 9 ms 460 KB Output is partially correct
41 Partially correct 13 ms 600 KB Output is partially correct
42 Partially correct 8 ms 600 KB Output is partially correct
43 Partially correct 8 ms 600 KB Output is partially correct
44 Partially correct 9 ms 548 KB Output is partially correct
45 Partially correct 9 ms 600 KB Output is partially correct
46 Partially correct 8 ms 664 KB Output is partially correct
47 Partially correct 13 ms 656 KB Output is partially correct
48 Partially correct 9 ms 600 KB Output is partially correct
49 Partially correct 9 ms 600 KB Output is partially correct
50 Partially correct 13 ms 1144 KB Output is partially correct
51 Partially correct 8 ms 600 KB Output is partially correct
52 Partially correct 8 ms 600 KB Output is partially correct
53 Partially correct 9 ms 600 KB Output is partially correct
54 Partially correct 11 ms 600 KB Output is partially correct
55 Partially correct 9 ms 508 KB Output is partially correct
56 Partially correct 9 ms 856 KB Output is partially correct
57 Partially correct 9 ms 600 KB Output is partially correct
58 Partially correct 9 ms 600 KB Output is partially correct
59 Partially correct 9 ms 856 KB Output is partially correct
60 Partially correct 10 ms 592 KB Output is partially correct
61 Partially correct 8 ms 600 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct