oj.uz

Submission #898906

# Submission time Handle Problem Language Result Execution time Memory
898906 2024-01-05T08:57:21 Z abcvuitunggio Counting Mushrooms (IOI20_mushrooms) C++17
56.927 / 100
 5 ms 696 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
const int k=100;
vector <int> a,b;
int t,res,sz;
int count_mushrooms(int n){
	if (n<=227){
        for (int i=1;i<n;i++)
            res+=1-use_machine({0,i});
        return res+1;
	}
	a.push_back(0);
	for (int i=1;i<=k*2;i++){
        if (max(a.size(),b.size())==k)
            break;
        int x=use_machine({0,i});
        if (x)
            b.push_back(i);
        else
            a.push_back(i);
	}
	sz=a.size();
	t=(a.size()!=k);
	if (a.size()!=k)
        swap(a,b);
	for (int i=a.size()+b.size();i<n;i+=k*2){
        if (i==n-1){
            res+=abs(t-use_machine({0,i}));
            continue;
        }
        vector <int> ve;
        if (n-i<k){
            for (int j=i;j<n;j++){
                ve.push_back(a[j-i]);
                ve.push_back(j);
            }
            ve.push_back(a[n-i]);
            res+=use_machine(ve)/2;
            break;
        }
        for (int j=i;j<min(i+k+1,n);j++){
            ve.push_back(j);
            if (j-i<k)
                ve.push_back(a[j-i]);
        }
        if (n-i-1<k)
            ve.pop_back();
        int x=use_machine(ve);
        if (i==n-2){
            res+=x;
            continue;
        }
        int l=ve[0],r=ve.back();
        ve.clear();
        ve.push_back(l);
        for (int j=min(i+k+1,n);j<min(i+k*2,n);j++){
            ve.push_back(a[j-i-k-1]);
            ve.push_back(j);
        }
        ve.push_back(a[min(i+k*2,n)-min(i+k+1,n)]);
        ve.push_back(r);
        res+=(x+use_machine(ve))/2;
	}
	return (t?res:n-a.size()-b.size()-res)+sz;
}

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