oj.uz

Submission #590577

# Submission time Handle Problem Language Result Execution time Memory
590577 2022-07-06T06:47:31 Z ogibogi2004 Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 38 ms 1328 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
unordered_map<ll,ll>dp;
ll s[64];
ll xx;
ll calc(ll n)
{
    if(n<=0)return 0;
    if(n==1)return 1;
    if(dp.count(n))return dp[n];
    ll t=0,pw2=1;
    while(pw2<n){pw2*=2ll;t++;}
    pw2/=2ll;t--;
    return dp[n]=calc(pw2)+calc(min(n,1ll+s[t]/xx)-pw2);
}
long long count_tastiness(long long x, vector<long long> a) {
    dp.clear();
    s[0]=a[0];xx=x;
    for(ll i=1;i<a.size();i++)
    {
        s[i]=s[i-1]+a[i]*(1ll<<i);
    }
    for(ll i=a.size();i<=62;i++)s[i]=s[i-1];
    for(ll i=0;i<=62;i++)
    {
        calc((1ll<<i));
    }
    return dp[(1ll<<62)];
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:21:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(ll i=1;i<a.size();i++)
      |                ~^~~~~~~~~

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 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 1 ms 212 KB Output is correct
4 Correct 1 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

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 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 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 300 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 340 KB Output is correct
2 Correct 20 ms 1188 KB Output is correct
3 Correct 23 ms 1192 KB Output is correct
4 Correct 21 ms 1188 KB Output is correct
5 Correct 21 ms 1080 KB Output is correct
6 Correct 20 ms 1080 KB Output is correct
7 Correct 19 ms 1080 KB Output is correct
8 Correct 20 ms 1144 KB Output is correct
9 Correct 19 ms 1156 KB Output is correct
10 Correct 20 ms 1160 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 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 1 ms 212 KB Output is correct
18 Correct 1 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 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 12 ms 340 KB Output is correct
38 Correct 20 ms 1188 KB Output is correct
39 Correct 23 ms 1192 KB Output is correct
40 Correct 21 ms 1188 KB Output is correct
41 Correct 21 ms 1080 KB Output is correct
42 Correct 20 ms 1080 KB Output is correct
43 Correct 19 ms 1080 KB Output is correct
44 Correct 20 ms 1144 KB Output is correct
45 Correct 19 ms 1156 KB Output is correct
46 Correct 20 ms 1160 KB Output is correct
47 Correct 16 ms 388 KB Output is correct
48 Correct 26 ms 1320 KB Output is correct
49 Correct 16 ms 340 KB Output is correct
50 Correct 24 ms 1076 KB Output is correct
51 Correct 19 ms 1328 KB Output is correct
52 Correct 12 ms 308 KB Output is correct
53 Correct 19 ms 1172 KB Output is correct
54 Correct 38 ms 1092 KB Output is correct
55 Correct 33 ms 1184 KB Output is correct
56 Correct 31 ms 1236 KB Output is correct
57 Correct 32 ms 1100 KB Output is correct