oj.uz

Submission #899018

# Submission time Handle Problem Language Result Execution time Memory
899018 2024-01-05T10:53:41 Z abcvuitunggio Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 5 ms 968 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
const int k=75;
vector <int> a[2];
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[0].push_back(0);
	for (int i=1;i<=2;i++){
        int x=use_machine({0,i});
        a[x].push_back(i);
	}
	int ch=0;
	if (a[0].size()<a[1].size()){
        swap(a[0],a[1]);
        ch=1;
	}
	for (int i=3;max(a[0].size(),a[1].size())<k;i+=2){
        int x=use_machine({i,a[0][0],i+1,a[0][1]});
        a[x&1].push_back(i);
        a[(x>>1)&1].push_back(i+1);
	}
	t=(a[0].size()<k)^ch;
	if (a[0].size()<k)
        swap(a[0],a[1]);
    res=a[1].size();
	for (int i=a[0].size()+a[1].size();i<n;){
        if (i==n-1){
            res+=abs(t-use_machine({0,i}));
            break;
        }
        vector <int> ve;
        for (int j=i;j<min(i+(int)a[0].size(),n);j++){
            ve.push_back(j);
            ve.push_back(a[0][j-i]);
        }
        int x=use_machine(ve);
        res+=(x+1)/2;
        a[x&1].push_back(i);
        if (a[0].size()<a[1].size()){
            res=min(i+(int)a[0].size(),n)-res;
            swap(a[0],a[1]);
            t^=1;
        }
        i=ve[ve.size()-2]+1;
	}
	return (t?res:n-res);
}

Subtask #1
92.623 / 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 452 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 4 ms 464 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 4 ms 716 KB Output is correct
11 Partially correct 4 ms 472 KB Output is partially correct
12 Correct 4 ms 464 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 2 ms 968 KB Output is correct
15 Partially correct 4 ms 472 KB Output is partially correct
16 Partially correct 4 ms 468 KB Output is partially correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 4 ms 464 KB Output is correct
19 Partially correct 4 ms 472 KB Output is partially correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 4 ms 464 KB Output is correct
22 Partially correct 4 ms 468 KB Output is partially correct
23 Correct 4 ms 468 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Partially correct 4 ms 468 KB Output is partially correct
26 Partially correct 4 ms 476 KB Output is partially correct
27 Partially correct 4 ms 472 KB Output is partially correct
28 Partially correct 4 ms 612 KB Output is partially correct
29 Partially correct 4 ms 468 KB Output is partially correct
30 Partially correct 4 ms 468 KB Output is partially correct
31 Partially correct 4 ms 472 KB Output is partially correct
32 Partially correct 4 ms 472 KB Output is partially correct
33 Partially correct 4 ms 468 KB Output is partially correct
34 Partially correct 4 ms 472 KB Output is partially correct
35 Partially correct 4 ms 724 KB Output is partially correct
36 Partially correct 4 ms 628 KB Output is partially correct
37 Partially correct 4 ms 468 KB Output is partially correct
38 Partially correct 4 ms 472 KB Output is partially correct
39 Partially correct 4 ms 456 KB Output is partially correct
40 Partially correct 5 ms 472 KB Output is partially correct
41 Partially correct 4 ms 468 KB Output is partially correct
42 Partially correct 4 ms 468 KB Output is partially correct
43 Partially correct 4 ms 468 KB Output is partially correct
44 Partially correct 4 ms 724 KB Output is partially correct
45 Partially correct 4 ms 472 KB Output is partially correct
46 Partially correct 4 ms 468 KB Output is partially correct
47 Partially correct 4 ms 476 KB Output is partially correct
48 Partially correct 4 ms 468 KB Output is partially correct
49 Partially correct 4 ms 472 KB Output is partially correct
50 Partially correct 4 ms 476 KB Output is partially correct
51 Partially correct 4 ms 472 KB Output is partially correct
52 Partially correct 4 ms 476 KB Output is partially correct
53 Partially correct 4 ms 728 KB Output is partially correct
54 Partially correct 4 ms 724 KB Output is partially correct
55 Partially correct 4 ms 468 KB Output is partially correct
56 Partially correct 4 ms 468 KB Output is partially correct
57 Partially correct 4 ms 472 KB Output is partially correct
58 Partially correct 4 ms 468 KB Output is partially correct
59 Partially correct 4 ms 468 KB Output is partially correct
60 Partially correct 4 ms 716 KB Output is partially correct
61 Partially correct 4 ms 628 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 596 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