oj.uz

답안 #303730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303730 2020-09-20T15:26:31 Z denkendoemeer 비스킷 담기 (IOI20_biscuits) C++14
100 / 100
 191 ms 940 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
map<ll,ll>dp;
ll calc(ll num)
{
    ll u=0;
    while(num)
      {
      num=num/2;
      u++;
      }
    return u-1;
}
ll divide(ll x,vector<ll>a,ll lim)
{
    if (dp.find(lim)!=dp.end())
        return dp[lim];
    if (lim<=0)
        return 0;
    if (lim==1)
        return dp[lim]=1;
    ll nr=calc(lim-1);
    return dp[lim]=divide(x,a,1LL<<nr)+divide(x,a,min(lim,1+a[nr]/x)-(1LL<<nr));
}
ll count_tastiness(ll x,vector<ll>a)
{
    dp.clear();
    int i;
    for(i=1;i<a.size();i++)
        a[i]=a[i-1]+(a[i]<<i);
    while(a.size()<=64)
      a.push_back(a.back());
    return divide(x,a,1+a.back());
}

Compilation message

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 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 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 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 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 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 384 KB Output is correct
2 Correct 51 ms 896 KB Output is correct
3 Correct 50 ms 896 KB Output is correct
4 Correct 61 ms 936 KB Output is correct
5 Correct 49 ms 896 KB Output is correct
6 Correct 63 ms 896 KB Output is correct
7 Correct 62 ms 896 KB Output is correct
8 Correct 56 ms 896 KB Output is correct
9 Correct 59 ms 940 KB Output is correct
10 Correct 43 ms 896 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 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 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 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 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 1 ms 512 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 2 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 20 ms 384 KB Output is correct
38 Correct 51 ms 896 KB Output is correct
39 Correct 50 ms 896 KB Output is correct
40 Correct 61 ms 936 KB Output is correct
41 Correct 49 ms 896 KB Output is correct
42 Correct 63 ms 896 KB Output is correct
43 Correct 62 ms 896 KB Output is correct
44 Correct 56 ms 896 KB Output is correct
45 Correct 59 ms 940 KB Output is correct
46 Correct 43 ms 896 KB Output is correct
47 Correct 31 ms 384 KB Output is correct
48 Correct 49 ms 896 KB Output is correct
49 Correct 33 ms 504 KB Output is correct
50 Correct 52 ms 888 KB Output is correct
51 Correct 33 ms 896 KB Output is correct
52 Correct 20 ms 384 KB Output is correct
53 Correct 31 ms 768 KB Output is correct
54 Correct 191 ms 896 KB Output is correct
55 Correct 173 ms 896 KB Output is correct
56 Correct 128 ms 896 KB Output is correct
57 Correct 100 ms 896 KB Output is correct