oj.uz

Submission #307729

# Submission time Handle Problem Language Result Execution time Memory
307729 2020-09-29T08:37:46 Z CodePlatina Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 54 ms 1024 KB 
#include "biscuits.h"
#include <vector>
#include <algorithm>
#include <utility>
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<long long, long long>
#define plll pair<long long, pll>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
#include <iostream>

using namespace std;

long long count_tastiness(long long y, vector<long long> a)
{
    int k = a.size();
    vector<long long> b(60); b[0] = a[0];
    for(int i = 1; i < 60; ++i) b[i] = b[i - 1] + (i < k ? (a[i] << i) : 0);
    for(int i = 0; i < 60; ++i) b[i] /= y;
    for(int i = 0; i < 60; ++i) if(b[i] >= (1ll << i + 1)) b[i] = (1ll << i + 1) - 1;

    vector<pll> V; V.push_back({(1ll << 61) - 1, 1});
    for(int i = 59; i >= 0; --i)
    {
        vector<pll> _V;
        for(auto x : V)
        {
            x.ff = min(x.ff, b[i]);
            if(x.ff >= (1ll << i)) _V.push_back({(1ll << i) - 1, x.ss}), _V.push_back({x.ff - (1ll << i), x.ss});
            else _V.push_back(x);
        }
        sort(_V.begin(), _V.end());
        V.clear();
        for(auto x : _V)
        {
            if(V.size() && V.back().ff == x.ff) V.back().ss += x.ss;
            else V.push_back(x);
        }
//        cout << i << endl;
//        for(auto x : V) cout << x.ff << ' ' << x.ss << endl;
    }

    return V[0].ss;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:23:54: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   23 |     for(int i = 0; i < 60; ++i) if(b[i] >= (1ll << i + 1)) b[i] = (1ll << i + 1) - 1;
      |                                                    ~~^~~
biscuits.cpp:23:77: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   23 |     for(int i = 0; i < 60; ++i) if(b[i] >= (1ll << i + 1)) b[i] = (1ll << i + 1) - 1;
      |                                                                           ~~^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 26 ms 896 KB Output is correct
3 Correct 25 ms 896 KB Output is correct
4 Correct 25 ms 888 KB Output is correct
5 Correct 24 ms 1024 KB Output is correct
6 Correct 29 ms 896 KB Output is correct
7 Correct 27 ms 888 KB Output is correct
8 Correct 25 ms 896 KB Output is correct
9 Correct 25 ms 888 KB Output is correct
10 Correct 21 ms 896 KB Output is correct

Subtask #5
23.0 / 23.0

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