oj.uz

Submission #730799

# Submission time Handle Problem Language Result Execution time Memory
730799 2023-04-26T12:28:29 Z josanneo22 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 11 ms 824 KB 
#include <bits/stdc++.h>
using namespace std;
inline int rd(){
	int x=0,w=1;
	char ch=getchar();
	for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') w=-1;
	for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1) +(x<<3) +ch-'0';
	return x*w;
}
long long dp[61];
 
void merge_biscuits(long long x, vector<long long> &a) {
    while(a.size()<61) a.push_back(0);
    for(int i=0; i<(int)a.size(); i++) {
        if(a[i]>x+1) {
            a[i+1] += (a[i]-x)/2;
            a[i] -= ((a[i]-x)/2)*2;
        }
    }
}
 #include "biscuits.h"
long long count_tastiness(long long x, std::vector<long long> a) {
    merge_biscuits(x, a);
    dp[0] = a[0]<x ? 1 : 2;
    for(int i=1; i<=60; i++) {
        if(a[i] >= x) {
            dp[i] = 2*dp[i-1];
        } else {
            dp[i] = dp[i-1];
            long long target = 2*(x-a[i]); // we are short of (target) coins of type idx-1
            for(int idx=i-1; idx>=0 && target<=2*x && target>0; idx--) {
                if(a[idx] < target) { // not enough to meet target, subtract from target
                    target -= a[idx];
                    target *= 2; // double because we now use lower value coins
                } else if(idx==0) {
                    dp[i] += (a[idx]-target<x ? 1: 2);
                } else {
                    target = 2*(x-a[idx]+target);
                    dp[i] += dp[idx-1];
                }
            }
        }
    }
    return dp[60];
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 7 ms 724 KB Output is correct
3 Correct 7 ms 824 KB Output is correct
4 Correct 7 ms 724 KB Output is correct
5 Correct 7 ms 724 KB Output is correct
6 Correct 9 ms 724 KB Output is correct
7 Correct 8 ms 724 KB Output is correct
8 Correct 7 ms 724 KB Output is correct
9 Correct 11 ms 724 KB Output is correct
10 Correct 7 ms 724 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 252 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 7 ms 724 KB Output is correct
39 Correct 7 ms 824 KB Output is correct
40 Correct 7 ms 724 KB Output is correct
41 Correct 7 ms 724 KB Output is correct
42 Correct 9 ms 724 KB Output is correct
43 Correct 8 ms 724 KB Output is correct
44 Correct 7 ms 724 KB Output is correct
45 Correct 11 ms 724 KB Output is correct
46 Correct 7 ms 724 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 8 ms 724 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 7 ms 724 KB Output is correct
51 Correct 8 ms 724 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 8 ms 724 KB Output is correct
54 Correct 8 ms 740 KB Output is correct
55 Correct 9 ms 772 KB Output is correct
56 Correct 9 ms 712 KB Output is correct
57 Correct 9 ms 724 KB Output is correct