oj.uz

Submission #1021584

# Submission time Handle Problem Language Result Execution time Memory
1021584 2024-07-12T20:24:30 Z Ahmed_Solyman Counting Mushrooms (IOI20_mushrooms) C++14
80.427 / 100
 7 ms 600 KB 
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
int use_machine(vector<int>x);
int count_mushrooms(int n){
    if(n<=226){
        int ret=1;
        for(int i=1;i<n;i++){
            ret+=1-use_machine({0,i});
        }
        return ret;
    }
    int ret=0,k=137;
    vector<int>v[2];
    v[0].push_back(0);
    for(int i=1;i<=2;i++){
        if(use_machine({0,i})==0)v[0].push_back(i);
        else v[1].push_back(i);
    }
    bool typ;
    int x,y;
    if(v[0].size()>=2){
        typ=0;
        x=v[0][0];y=v[0][1];
    }
    else{
        typ=1;
        x=v[1][0];y=v[1][1];
    }
    for(int i=3;i<=2*k-2;i+=2){
        int h=use_machine({i,x,i+1,y});
        if(h==0){
            v[typ].push_back(i);
            v[typ].push_back(i+1);
        }
        if(h==1){
            v[typ^1].push_back(i);
            v[typ].push_back(i+1);
        }
        if(h==2){
            v[typ].push_back(i);
            v[typ^1].push_back(i+1);
        }
        if(h==3){
            v[typ^1].push_back(i);
            v[typ^1].push_back(i+1);
        }
    }
    vector<int>g;
    if(v[0].size()>=k){
        typ=0;
        for(int i=0;i<k;i++)g.push_back(v[0][i]);
    }
    else{
        typ=1;
        for(int i=0;i<k;i++)g.push_back(v[1][i]);
    }
    auto f=[&](int l,int r){
        vector<int>p;
        for(int i=l;i<=r;i++){
            p.push_back(i);
            p.push_back(g[i-l]);
        }
        int g=use_machine(p);
        g=(g+1)/2;
        if(typ)return g;
        else return r-l+1-g;
    };
    ret=(int)v[0].size();
    for(int i=2*k-1;i<n;i+=k){
        ret+=f(i,min(i+k-1,n-1));
    }
    return ret;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:56:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   56 |     if(v[0].size()>=k){
      |        ~~~~~~~~~~~^~~

Subtask #1
80.427 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 Partially correct 5 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 6 ms 344 KB Output is partially correct
11 Partially correct 5 ms 344 KB Output is partially correct
12 Partially correct 7 ms 344 KB Output is partially correct
13 Partially correct 4 ms 344 KB Output is partially correct
14 Correct 2 ms 600 KB Output is correct
15 Partially correct 4 ms 344 KB Output is partially correct
16 Partially correct 3 ms 344 KB Output is partially correct
17 Correct 2 ms 344 KB Output is correct
18 Partially correct 4 ms 344 KB Output is partially correct
19 Partially correct 4 ms 344 KB Output is partially correct
20 Partially correct 4 ms 344 KB Output is partially correct
21 Partially correct 4 ms 344 KB Output is partially correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Partially correct 5 ms 344 KB Output is partially correct
24 Correct 4 ms 344 KB Output is correct
25 Partially correct 6 ms 344 KB Output is partially correct
26 Partially correct 3 ms 344 KB Output is partially correct
27 Partially correct 3 ms 440 KB Output is partially correct
28 Partially correct 4 ms 344 KB Output is partially correct
29 Partially correct 6 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 3 ms 344 KB Output is partially correct
34 Partially correct 4 ms 340 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 3 ms 344 KB Output is partially correct
37 Partially correct 4 ms 344 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 4 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 4 ms 344 KB Output is partially correct
44 Partially correct 4 ms 344 KB Output is partially correct
45 Partially correct 6 ms 448 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 4 ms 344 KB Output is partially correct
49 Partially correct 6 ms 344 KB Output is partially correct
50 Partially correct 6 ms 344 KB Output is partially correct
51 Partially correct 4 ms 344 KB Output is partially correct
52 Partially correct 4 ms 344 KB Output is partially correct
53 Partially correct 3 ms 344 KB Output is partially correct
54 Partially correct 5 ms 344 KB Output is partially correct
55 Partially correct 6 ms 344 KB Output is partially correct
56 Partially correct 4 ms 344 KB Output is partially correct
57 Partially correct 4 ms 344 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 3 ms 344 KB Output is partially correct
61 Partially correct 4 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 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 1 ms 344 KB Output is correct
77 Correct 1 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 356 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 1 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct