oj.uz

답안 #428533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
428533 2021-06-15T12:39:07 Z Peti 비스킷 담기 (IOI20_biscuits) C++14
100 / 100
 14 ms 1304 KB 
#include <bits/stdc++.h>
#include "biscuits.h"

using namespace std;

const int bitc = 60;

long long count_tastiness(long long x, std::vector<long long> a) {
    vector<long long> ossz(bitc, 0), dp(bitc, 0);
    ossz[0] = a[0];
    for(int i = 1; i < (int)a.size(); i++)
        ossz[i] = ossz[i-1] + (1ll<<i)*a[i];
    for(int i = (int)a.size(); i < bitc; i++)
        ossz[i] = ossz[i-1];

    for(int i = 0; i < bitc; i++){
        if((1ll<<i)*x > (long long)1e18)
            return dp[i-1] + 1ll;
        if(ossz[i] >= (1ll<<i)*x){
            //cout<<"\nbit: "<<i<<"\n";
            //cout<<ossz[i]<<" ossz------------\n";
            long long c = ossz[i] - (1ll<<i)*x;
            //cout<<"c: "<<c<<"\n";
            for(int j = i-1; j >= 0; j--){
                if(((1ll<<(j+1))-1ll)*x <= c){
                    //cout<<j<<" all good\n";
                    dp[i] += dp[j];
                    break;
                } else if((1ll<<j)*x <= c && ossz[j] >= (1ll<<j)*x){
                    c = min(c, ossz[j]) - (1ll<<j)*x;
                    //cout<<j<<" "<<dp[j-1]+1ll<<" one\n";
                    dp[i] += (j > 0 ? dp[j-1]+1ll : 1ll);
                }
            }
            dp[i] += 1ll;
            //cout<<"dp: "<<dp[i]<<"\n";
        }

        if(i > 0)
            dp[i] += dp[i-1];
        //cout<<i<<" dp: "<<dp[i]<<"\n";
    }

	return dp[bitc-1]+1ll;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 11 ms 1184 KB Output is correct
3 Correct 11 ms 1200 KB Output is correct
4 Correct 13 ms 1100 KB Output is correct
5 Correct 11 ms 1100 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 11 ms 1100 KB Output is correct
8 Correct 13 ms 1140 KB Output is correct
9 Correct 10 ms 1084 KB Output is correct
10 Correct 11 ms 1100 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 288 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 11 ms 1184 KB Output is correct
39 Correct 11 ms 1200 KB Output is correct
40 Correct 13 ms 1100 KB Output is correct
41 Correct 11 ms 1100 KB Output is correct
42 Correct 10 ms 1100 KB Output is correct
43 Correct 11 ms 1100 KB Output is correct
44 Correct 13 ms 1140 KB Output is correct
45 Correct 10 ms 1084 KB Output is correct
46 Correct 11 ms 1100 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 11 ms 1228 KB Output is correct
49 Correct 2 ms 308 KB Output is correct
50 Correct 9 ms 1100 KB Output is correct
51 Correct 10 ms 1304 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 8 ms 1100 KB Output is correct
54 Correct 14 ms 1100 KB Output is correct
55 Correct 12 ms 1072 KB Output is correct
56 Correct 12 ms 1200 KB Output is correct
57 Correct 12 ms 1116 KB Output is correct