oj.uz

Submission #853377

# Submission time Handle Problem Language Result Execution time Memory
853377 2023-09-24T09:02:17 Z abcvuitunggio Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 31 ms 968 KB 
#include "biscuits.h"
#define int long long
int dp[60][60],v[60];
int f(int i, int j){
    if (i<0)
        return 1;
    if (dp[i][j]!=-1)
        return dp[i][j];
    dp[i][j]=f(i-1,(i&&v[i-1]%(1LL<<i)<v[j]%(1LL<<i)?i-1:j));
    if ((v[j]>>i)&1)
        dp[i][j]+=f(i-1,i-1);
    return dp[i][j];
}
int count_tastiness(int x, std::vector <int> a){
    std::fill(v,v+60,0);
    for (int i=0;i<a.size();i++)
        v[i]=(a[i]<<i);
    for (int i=1;i<60;i++)
        v[i]+=v[i-1];
    for (int i=0;i<60;i++)
        v[i]=std::min(v[i]/x,(1LL<<(i+1))-1);
    for (int i=0;i<60;i++)
        for (int j=0;j<60;j++)
            dp[i][j]=-1;
    return f(59,59);
}

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

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

Subtask #5
23.0 / 23.0

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