oj.uz

Submission #653584

# Submission time Handle Problem Language Result Execution time Memory
653584 2022-10-27T11:03:46 Z coding_snorlax Counting Mushrooms (IOI20_mushrooms) C++14
75.5853 / 100
 12 ms 364 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
int count_mushrooms(int n){
    int answer=0;
    vector<int> s={0};
    vector<int> A={0};
    vector<int> B;
    if(n<=200){
        for(int i=1;i<min(n,200);i++){
            s.push_back(i);
            if(use_machine(s)) B.push_back(i);
            else A.push_back(i);
            s.pop_back();
        }
        return (int)A.size();
    }
    else{
        s.push_back(1);
        if(use_machine(s)) B.push_back(1);
        else A.push_back(1);
        s.pop_back();
        s.push_back(2);
        if(use_machine(s)) B.push_back(2);
        else A.push_back(2);
        s.pop_back();
        s.push_back(3);
        if(use_machine(s)) B.push_back(3);
        else A.push_back(3);
        if((int)A.size()>=2){
            vector<int> Out1;
            for(int i=4;i<200;i+=2){
                Out1.clear();
                Out1.push_back(i);
                Out1.push_back(A[0]);
                Out1.push_back(i+1);
                Out1.push_back(A[1]);
                int num=use_machine(Out1);
                if(num==0){
                    A.push_back(i);
                    A.push_back(i+1);
                }
                if(num==1){
                    B.push_back(i);
                    A.push_back(i+1);
                }
                if(num==2){
                    A.push_back(i);
                    B.push_back(i+1);
                }
                if(num==3){
                    B.push_back(i);
                    B.push_back(i+1);
                }
            }

        }
        else{
            vector<int> Out1;
            for(int i=4;i<200;i+=2){
                Out1.clear();
                Out1.push_back(i);
                Out1.push_back(B[0]);
                Out1.push_back(i+1);
                Out1.push_back(B[1]);
                int num=use_machine(Out1);
                if(num==3){
                    A.push_back(i);
                    A.push_back(i+1);
                }
                if(num==2){
                    B.push_back(i);
                    A.push_back(i+1);
                }
                if(num==1){
                    A.push_back(i);
                    B.push_back(i+1);
                }
                if(num==0){
                    B.push_back(i);
                    B.push_back(i+1);
                }
            }
        }

    }
    answer=(int)A.size();
    vector<int> Out;
    int Mark=0;
    if(A.size()>=100){
        for(int i=0;i<100;i++){
            Out.push_back(A[i]);
            Out.push_back(-1);
        }
    }
    else{
        for(int i=0;i<100;i++){
            Out.push_back(B[i]);
            Out.push_back(-1);
        }
        Mark=1;
    }
    for(int i=0;i<(n-200)/100;i++){
        for(int j=0;j<100;j++){
            Out[2*j+1]=200+100*i+j;
        }
        int num=use_machine(Out);
        if(Mark && num%2){
            answer++;
            answer+=num/2;
        }
        else if(Mark){
            answer+=num/2;
        }
        else if(!Mark && num%2){
            answer+=100-num/2-1;
        }
        else{
            answer+=100-num/2;
        }
    }
    vector<int> New;
    if(n%100){
        if(A.size()>=100){
            for(int i=0;i<n%100;i++){
                New.push_back(A[i]);
                New.push_back(n-n%100+i);
            }
        }
        else{
            for(int i=0;i<n%100;i++){
                New.push_back(B[i]);
                New.push_back(n-n%100+i);
            }
            Mark=1;
        }
        int num=use_machine(New);
        if(Mark && num%2){
            answer++;
            answer+=num/2;
        }
        else if(Mark){
            answer+=num/2;
        }
        else if(!Mark && num%2){
            answer+=n%100-num/2-1;
        }
        else{
            answer+=n%100-num/2;
        }
    }
    return answer;
}

Subtask #1
75.5853 / 100.0

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