oj.uz

Submission #360553

# Submission time Handle Problem Language Result Execution time Memory
360553 2021-01-28T04:53:35 Z juggernaut Packing Biscuits (IOI20_biscuits) C++14
77 / 100
 290 ms 1440 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;
	auto it=dp[pos].lower_bound(cur);
    if(it!=dp[pos].end()){
        if(it->first==cur)return it->second;
        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 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 492 KB Output is correct
2 Correct 217 ms 1388 KB Output is correct
3 Correct 187 ms 1388 KB Output is correct
4 Correct 180 ms 1388 KB Output is correct
5 Correct 160 ms 1388 KB Output is correct
6 Correct 278 ms 1324 KB Output is correct
7 Correct 290 ms 1336 KB Output is correct
8 Correct 256 ms 1260 KB Output is correct
9 Correct 244 ms 1440 KB Output is correct
10 Correct 133 ms 1388 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 4 ms 492 KB Output is correct
35 Correct 9 ms 492 KB Output is correct
36 Correct 10 ms 620 KB Output is correct
37 Correct 51 ms 492 KB Output is correct
38 Correct 217 ms 1388 KB Output is correct
39 Correct 187 ms 1388 KB Output is correct
40 Correct 180 ms 1388 KB Output is correct
41 Correct 160 ms 1388 KB Output is correct
42 Correct 278 ms 1324 KB Output is correct
43 Correct 290 ms 1336 KB Output is correct
44 Correct 256 ms 1260 KB Output is correct
45 Correct 244 ms 1440 KB Output is correct
46 Correct 133 ms 1388 KB Output is correct
47 Correct 176 ms 492 KB Output is correct
48 Correct 29 ms 1388 KB Output is correct
49 Correct 17 ms 492 KB Output is correct
50 Correct 32 ms 1260 KB Output is correct
51 Correct 13 ms 1388 KB Output is correct
52 Incorrect 6 ms 492 KB Output isn't correct
53 Halted 0 ms 0 KB -