oj.uz

Submission #416087

# Submission time Handle Problem Language Result Execution time Memory
416087 2021-06-01T23:58:17 Z duality Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 21 ms 820 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "biscuits.h"

LLI b[60],dp[61];
long long int count_tastiness(long long int x,vector<long long int> a) {
    int i,j;
    LLI s = 0;
    while (a.size() < 60) a.pb(0);
    for (i = 0; i < 60; i++) s += a[i] << i,b[i] = s/x;
    for (i = 0; i <= 60; i++) {
        dp[i] = 1;
        LLI n = 1e18;
        for (j = i-1; j >= 0; j--) {
            n = min(n,b[j]);
            if (n >= (1LL << j)) dp[i] += dp[j],n -= (1LL << j);
        }
    }
    return dp[60];
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 260 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 1 ms 288 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 364 KB Output is correct
2 Correct 15 ms 812 KB Output is correct
3 Correct 16 ms 812 KB Output is correct
4 Correct 16 ms 812 KB Output is correct
5 Correct 17 ms 784 KB Output is correct
6 Correct 16 ms 816 KB Output is correct
7 Correct 18 ms 716 KB Output is correct
8 Correct 14 ms 820 KB Output is correct
9 Correct 15 ms 816 KB Output is correct
10 Correct 13 ms 804 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 260 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 252 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 1 ms 252 KB Output is correct
31 Correct 2 ms 224 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 2 ms 208 KB Output is correct
34 Correct 2 ms 204 KB Output is correct
35 Correct 2 ms 204 KB Output is correct
36 Correct 2 ms 224 KB Output is correct
37 Correct 7 ms 364 KB Output is correct
38 Correct 15 ms 812 KB Output is correct
39 Correct 16 ms 812 KB Output is correct
40 Correct 16 ms 812 KB Output is correct
41 Correct 17 ms 784 KB Output is correct
42 Correct 16 ms 816 KB Output is correct
43 Correct 18 ms 716 KB Output is correct
44 Correct 14 ms 820 KB Output is correct
45 Correct 15 ms 816 KB Output is correct
46 Correct 13 ms 804 KB Output is correct
47 Correct 9 ms 332 KB Output is correct
48 Correct 21 ms 796 KB Output is correct
49 Correct 11 ms 364 KB Output is correct
50 Correct 16 ms 716 KB Output is correct
51 Correct 17 ms 816 KB Output is correct
52 Correct 8 ms 368 KB Output is correct
53 Correct 16 ms 716 KB Output is correct
54 Correct 20 ms 716 KB Output is correct
55 Correct 17 ms 716 KB Output is correct
56 Correct 20 ms 816 KB Output is correct
57 Correct 17 ms 716 KB Output is correct