oj.uz

Submission #673319

# Submission time Handle Problem Language Result Execution time Memory
673319 2022-12-20T07:47:32 Z Hanksburger Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 75 ms 1320 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp;
long long s[60], x;
long long f(long long n)
{
    if (n<=0 || mp[n])
        return mp[n];
    long long m=n-1, l=0;
    while (m/=2)
        l++;
    return mp[n]=f(1LL<<l)+f(min(n, 1+s[l]/x)-(1LL<<l));
}
long long count_tastiness(long long X, vector<long long> A)
{
    mp.clear();
    x=X, mp[1]=1, s[0]=A[0];
	for (long long i=1; i<A.size(); i++)
        s[i]=s[i-1]+(A[i]<<i);
    for (long long i=A.size(); i<60; i++)
        s[i]=s[i-1];
    return f(1LL<<60);
}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 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 340 KB Output is correct
6 Correct 1 ms 300 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
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 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 300 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 1 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 304 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 2 ms 304 KB Output is correct
13 Correct 2 ms 212 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 340 KB Output is correct
2 Correct 32 ms 1188 KB Output is correct
3 Correct 27 ms 1108 KB Output is correct
4 Correct 27 ms 1108 KB Output is correct
5 Correct 26 ms 1108 KB Output is correct
6 Correct 34 ms 1132 KB Output is correct
7 Correct 35 ms 1148 KB Output is correct
8 Correct 43 ms 1080 KB Output is correct
9 Correct 31 ms 1228 KB Output is correct
10 Correct 25 ms 1108 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 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 340 KB Output is correct
6 Correct 1 ms 300 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
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 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 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 300 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 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 2 ms 304 KB Output is correct
36 Correct 2 ms 212 KB Output is correct
37 Correct 13 ms 340 KB Output is correct
38 Correct 32 ms 1188 KB Output is correct
39 Correct 27 ms 1108 KB Output is correct
40 Correct 27 ms 1108 KB Output is correct
41 Correct 26 ms 1108 KB Output is correct
42 Correct 34 ms 1132 KB Output is correct
43 Correct 35 ms 1148 KB Output is correct
44 Correct 43 ms 1080 KB Output is correct
45 Correct 31 ms 1228 KB Output is correct
46 Correct 25 ms 1108 KB Output is correct
47 Correct 13 ms 400 KB Output is correct
48 Correct 23 ms 1320 KB Output is correct
49 Correct 15 ms 408 KB Output is correct
50 Correct 21 ms 1084 KB Output is correct
51 Correct 21 ms 1236 KB Output is correct
52 Correct 14 ms 340 KB Output is correct
53 Correct 19 ms 1108 KB Output is correct
54 Correct 75 ms 1184 KB Output is correct
55 Correct 67 ms 1188 KB Output is correct
56 Correct 64 ms 1200 KB Output is correct
57 Correct 52 ms 1212 KB Output is correct