oj.uz

Submission #1090595

# Submission time Handle Problem Language Result Execution time Memory
1090595 2024-09-18T13:35:54 Z onlk97 Counting Mushrooms (IOI20_mushrooms) C++14
56.927 / 100
 6 ms 600 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
const int Q=186;
int count_mushrooms(int n){
    if (n<=Q+1){
        vector <int> v(n);
        v[0]=0;
        for (int i=1; i<n; i++){
            int tp=use_machine({i-1,i});
            if (tp) v[i]=v[i-1]^1;
            else v[i]=v[i-1];
        }
        return count(v.begin(),v.end(),0);
    }
    vector <int> v(Q+1);
    v[0]=0;
    for (int i=1; i<=Q; i++){
        int tp=use_machine({i-1,i});
        if (tp) v[i]=v[i-1]^1;
        else v[i]=v[i-1];
    }
    int cnt0=count(v.begin(),v.end(),0),cnt1=count(v.begin(),v.end(),1);
    int ans=cnt0;
    if (cnt0>=cnt1){
        vector <int> pos;
        for (int i=0; i<=Q; i++) if (!v[i]) pos.push_back(i);
        for (int i=Q+1; i<n; i+=pos.size()){
            vector <int> ths;
            for (int j=i; j<min(n,i+(int)pos.size()); j++) ths.push_back(j);
            vector <int> ask;
            for (int j=0; j<ths.size(); j++){
                ask.push_back(pos[j]);
                ask.push_back(ths[j]);
            }
            int ret=ask.size()-1-use_machine(ask);
            ans+=(ret+1)/2;
        }
    } else {
        vector <int> pos;
        for (int i=0; i<=Q; i++) if (v[i]) pos.push_back(i);
        for (int i=Q+1; i<n; i+=pos.size()){
            vector <int> ths;
            for (int j=i; j<min(n,i+(int)pos.size()); j++) ths.push_back(j);
            vector <int> ask;
            for (int j=0; j<ths.size(); j++){
                ask.push_back(pos[j]);
                ask.push_back(ths[j]);
            }
            int ret=ask.size()-1-use_machine(ask);
            ans+=(int)ths.size()-(ret+1)/2;
        }
    }
    return ans;
}

Compilation message

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

Subtask #1
56.927 / 100.0

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