oj.uz

Submission #1029515

# Submission time Handle Problem Language Result Execution time Memory
1029515 2024-07-21T01:53:36 Z irmuun Counting Mushrooms (IOI20_mushrooms) C++17
80.1418 / 100
 6 ms 600 KB 
#include<bits/stdc++.h>
#include "mushrooms.h"
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
 
int count_mushrooms(int n){
    if(n<=200){
        int ans=1;
        for(int i=1;i<n;i++){
            int d=use_machine({0,i});
            if(d==0){
                ans++;
            }
        }
        return ans;
    }
    int ans=0;
    vector<int>a,b;
    a.pb(0);
    for(int i=1;i<3;i++){
        int d=use_machine({0,i});
        if(d==0){
            a.pb(i);
        }
        else{
            b.pb(i);
        }
    }
    if(a.size()>=2){
        for(int i=3;i<280;i+=2){
            int d=use_machine({a[0],i,a[1],i+1});
            if(d<=1) a.pb(i);
            else b.pb(i);
            if(d%2==0) a.pb(i+1);
            else b.pb(i+1);
        }
    }
    else{
        for(int i=3;i<280;i+=2){
            int d=use_machine({b[0],i,b[1],i+1});
            if(d<=1) b.pb(i);
            else a.pb(i);
            if(d%2==0) b.pb(i+1);
            else a.pb(i+1);
        }
    }
    ans=a.size();
    if(b.size()>a.size()){
        int len=b.size();
        len--;
        for(int i=281;i<n;i+=len){
            int r=min(i+len-1,n-1);
            int cur=1;
            vector<int>v;
            v.pb(b[0]);
            for(int j=i;j<=r;j++){
                v.pb(j);
                v.pb(b[cur]);
                cur++;
            }
            for(int j=cur;j<b.size();j++){
                v.pb(b[j]);
            }
            ans+=use_machine(v)/2;
        }
    }
    else{
        int len=a.size();
        len--;
        for(int i=281;i<n;i+=len){
            int r=min(i+len-1,n-1);
            int cur=1;
            vector<int>v;
            v.pb(a[0]);
            int cnt=0;
            for(int j=i;j<=r;j++){
                v.pb(j);
                cnt++;
                v.pb(a[cur]);
                cur++;
            }
            for(int j=cur;j<a.size();j++){
                v.pb(a[j]);
            }
            ans+=cnt-use_machine(v)/2;
        }
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:68:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for(int j=cur;j<b.size();j++){
      |                           ~^~~~~~~~~
mushrooms.cpp:89:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |             for(int j=cur;j<a.size();j++){
      |                           ~^~~~~~~~~

Subtask #1
80.1418 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 5 ms 344 KB Output is partially correct
12 Partially correct 5 ms 344 KB Output is partially correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Partially correct 3 ms 344 KB Output is partially correct
16 Partially correct 5 ms 344 KB Output is partially correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Partially correct 3 ms 600 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 6 ms 344 KB Output is partially correct
23 Partially correct 3 ms 344 KB Output is partially correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 5 ms 344 KB Output is partially correct
26 Partially correct 3 ms 344 KB Output is partially correct
27 Partially correct 3 ms 344 KB Output is partially correct
28 Partially correct 3 ms 344 KB Output is partially correct
29 Partially correct 3 ms 344 KB Output is partially correct
30 Partially correct 5 ms 448 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 4 ms 344 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 3 ms 344 KB Output is partially correct
35 Partially correct 5 ms 344 KB Output is partially correct
36 Partially correct 3 ms 344 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 3 ms 448 KB Output is partially correct
39 Partially correct 3 ms 600 KB Output is partially correct
40 Partially correct 5 ms 344 KB Output is partially correct
41 Partially correct 3 ms 344 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 3 ms 344 KB Output is partially correct
44 Partially correct 4 ms 344 KB Output is partially correct
45 Partially correct 3 ms 344 KB Output is partially correct
46 Partially correct 3 ms 344 KB Output is partially correct
47 Partially correct 3 ms 344 KB Output is partially correct
48 Partially correct 3 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 5 ms 344 KB Output is partially correct
51 Partially correct 3 ms 344 KB Output is partially correct
52 Partially correct 3 ms 340 KB Output is partially correct
53 Partially correct 3 ms 344 KB Output is partially correct
54 Partially correct 4 ms 448 KB Output is partially correct
55 Partially correct 3 ms 344 KB Output is partially correct
56 Partially correct 6 ms 444 KB Output is partially correct
57 Partially correct 3 ms 340 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 3 ms 344 KB Output is partially correct
60 Partially correct 3 ms 344 KB Output is partially correct
61 Partially correct 3 ms 344 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 0 ms 340 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 0 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