oj.uz

Submission #305139

# Submission time Handle Problem Language Result Execution time Memory
305139 2020-09-22T15:46:24 Z Sho10 Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 29 ms 924 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
//#include "biscuits.h"
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll s[65],dp[65][65],x,a[105];
ll solve(ll bit,ll nr){
if(bit==-1)return 1;
ll &val=dp[bit][nr];
if(val!=-1) {
        return val;
}
ll b=s[nr]&((1ll<<(bit+1))-1);
if(b>s[bit]){
b=s[bit];
nr=bit;
}
val=0;
if((1ll<<bit)>b){
val+=solve(bit-1,nr);
}else {
val+=solve(bit-1,bit-1)+solve(bit-1,nr);
}
return val;
}
ll count_tastiness(ll X,vector<ll>A){
x=X;
memset(a,0,sizeof(a));
for(ll i=0;i<A.size();i++)
    a[i]=A[i];
for(ll i=0;i<60;i++)
s[i]=(1ll<<i)*a[i];
for(ll i=1;i<60;i++)
 s[i]+=s[i-1];
for(ll i=0;i<60;i++)
s[i]/=x;
for(ll i=0;i<60;i++)
s[i]=min(s[i],(1ll<<(i+1))-1);
memset(dp,-1,sizeof(dp));
return solve(59,59);
}
/*
int32_t main(){
CODE_START;
*/

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:48:13: 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]
   48 | for(ll i=0;i<A.size();i++)
      |            ~^~~~~~~~~

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 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

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