oj.uz

Submission #824714

# Submission time Handle Problem Language Result Execution time Memory
824714 2023-08-14T09:04:50 Z kwongweng Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 8 ms 568 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define fi first
#define se second
#define f use_machine

// max # use of f : 280
// goal : 226
int lim=75;
int count_mushrooms(int n) {
	int ans=0;
	vi A, B;
	A.pb(0); int a=1; int b=0;
	int cur=1;
	while (cur < n){
		if (a>b){
			if (a>=2 && a<=lim && cur<n-1){
				int num = f({A[0],cur,A[1],cur+1});
				if (num%2==1) {B.pb(cur+1); b++;}
				else {A.pb(cur+1); a++;}
				if (num>=2) {B.pb(cur); b++;}
				else {A.pb(cur); a++;}
				cur=cur+2; continue;
			}
			vi val; int len=0;
			FOR(i,0,min(a,n-cur)){
				val.pb(A[i]); val.pb(cur+i); len+=2;
			}
			int num = f(val);
			ans += len/2-1-num/2;
			if (num%2==0) {a++; A.pb(val[len-1]);}
			else {b++; B.pb(val[len-1]);}
			cur=val[len-1]+1;
		}else{
			if (b>=2 && b<=lim && cur<n-1){
				int num = f({B[0],cur,B[1],cur+1});
				if (num%2==0) {B.pb(cur+1); b++;}
				else {A.pb(cur+1); a++;}
				if (num<2) {B.pb(cur); b++;}
				else {A.pb(cur); a++;}
				cur=cur+2; continue;
			}
			vi val; int len=0;
			FOR(i,0,min(b,n-cur)){
				val.pb(B[i]); val.pb(cur+i); len+=2;
			}
			int num = f(val);
			ans += num/2;
			if (num%2==0) {b++; B.pb(val[len-1]);}
			else {a++; A.pb(val[len-1]);}
			cur=val[len-1]+1;
		}
	}
	return ans+a;
}

Subtask #1
92.623 / 100.0

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