oj.uz

Submission #955595

# Submission time Handle Problem Language Result Execution time Memory
955595 2024-03-31T05:01:34 Z Trisanu_Das Packing Biscuits (IOI20_biscuits) C++17
77 / 100
 204 ms 1420 KB 
#include"biscuits.h"
#ifndef EVAL
#include"grader.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x;
map<ll,ll>dp[61];
vector<ll>a;
ll rec(int pos,int cur){
	if(pos==61)return 1ll;
	if(dp[pos].count(cur))return dp[pos][cur];
	auto it=dp[pos].lower_bound(cur);
    if(true){
        auto itt=it;
        if(itt!=dp[pos].begin()){
            itt--;
            if(itt->second==it->second)return it->second;
        }
    }
    dp[pos][cur]=rec(pos+1,(cur+a[pos])>>1);
    if(a[pos]+cur>=x)dp[pos][cur]+=rec(pos+1,(a[pos]+cur-x)>>1);
	return dp[pos][cur];
}
ll count_tastiness(ll X,vector<ll>A){
	a=A;x=X;
	a.resize(61);
	for(int i=0;i<61;i++)dp[i].clear();
	for(int i=0;i<60;i++)
		if(a[i]>x){
			ll tmp=(a[i]-x)>>1ll;
			a[i+1]+=tmp;
			a[i]-=(tmp<<1ll);
		}
	return rec(0,0);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 8 ms 600 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 348 KB Output is correct
2 Correct 136 ms 1420 KB Output is correct
3 Correct 129 ms 1372 KB Output is correct
4 Correct 119 ms 1368 KB Output is correct
5 Correct 109 ms 1416 KB Output is correct
6 Correct 202 ms 1372 KB Output is correct
7 Correct 204 ms 1384 KB Output is correct
8 Correct 179 ms 1368 KB Output is correct
9 Correct 165 ms 1376 KB Output is correct
10 Correct 95 ms 1372 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 7 ms 600 KB Output is correct
36 Correct 8 ms 600 KB Output is correct
37 Correct 37 ms 348 KB Output is correct
38 Correct 136 ms 1420 KB Output is correct
39 Correct 129 ms 1372 KB Output is correct
40 Correct 119 ms 1368 KB Output is correct
41 Correct 109 ms 1416 KB Output is correct
42 Correct 202 ms 1372 KB Output is correct
43 Correct 204 ms 1384 KB Output is correct
44 Correct 179 ms 1368 KB Output is correct
45 Correct 165 ms 1376 KB Output is correct
46 Correct 95 ms 1372 KB Output is correct
47 Correct 125 ms 600 KB Output is correct
48 Correct 19 ms 1368 KB Output is correct
49 Correct 12 ms 348 KB Output is correct
50 Correct 17 ms 1116 KB Output is correct
51 Correct 8 ms 1372 KB Output is correct
52 Incorrect 4 ms 348 KB Output isn't correct
53 Halted 0 ms 0 KB -