답안 #806706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
806706	2023-08-04T09:04:49 Z	PixelCat	비스킷 담기 (IOI20_biscuits)	C++14	100 / 100	88 ms	1324 KB

biscuits

#include "biscuits.h"
 
#ifdef NYAOWO
#include "grader.cpp"
#endif
 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;
 
const int MAXK = 60;
 
int a[MAXK + 10];
int val[MAXK + 10];

struct Ayaya {
    int l, r, add;
};

vector<Ayaya> aya;
int eval(int i) {
    int res = 0;
    Forr(it, sz(aya) - 1, 0) {
        auto &ay = aya[it];
        if(ay.l <= i && i <= ay.r) {
            i -= ay.l;
            res += ay.add;
        }
    }
    return res;
}

long long count_tastiness(long long x, std::vector<long long> _a) {
    int k = sz(_a);

    memset(a, 0, sizeof(a));
    memset(val, 0, sizeof(val));
    aya.clear();
    
    For(i, 0, k - 1) {
        a[i] = _a[i];
        val[i] = a[i] << i;
    }
    k = 60;
    For(i, 1, k) {
        val[i] += val[i - 1];
    }

    int lim = val[k] / x;
    aya.push_back({0, 0, val[k]});
    For(i, 0, k - 1) {
        if((1ll << i) > lim) break;
        int hi = aya.back().r + 1;
        int lo = -1;
        while(hi - lo > 1) {
            int mi = (hi + lo) / 2;
            int y = eval(mi);
            if(val[k] - y + (x << i) <= val[i]) lo = mi;
            else hi = mi;
        }
        if(lo >= 0) aya.push_back({aya.back().r + 1, aya.back().r + lo + 1, -(x << i)});
    }
    return aya.back().r + 1;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	212 KB	Output is correct
5	Correct	2 ms	212 KB	Output is correct
6	Correct	2 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	2 ms	352 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	300 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	296 KB	Output is correct
6	Correct	1 ms	260 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	300 KB	Output is correct
10	Correct	2 ms	212 KB	Output is correct
11	Correct	2 ms	212 KB	Output is correct
12	Correct	2 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	340 KB	Output is correct
2	Correct	26 ms	820 KB	Output is correct
3	Correct	26 ms	824 KB	Output is correct
4	Correct	25 ms	820 KB	Output is correct
5	Correct	25 ms	740 KB	Output is correct
6	Correct	31 ms	816 KB	Output is correct
7	Correct	30 ms	1132 KB	Output is correct
8	Correct	29 ms	1108 KB	Output is correct
9	Correct	28 ms	1108 KB	Output is correct
10	Correct	25 ms	1152 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 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
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	300 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	0 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	212 KB	Output is correct
19	Correct	2 ms	212 KB	Output is correct
20	Correct	2 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	2 ms	352 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	300 KB	Output is correct
28	Correct	1 ms	296 KB	Output is correct
29	Correct	1 ms	260 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	300 KB	Output is correct
33	Correct	2 ms	212 KB	Output is correct
34	Correct	2 ms	212 KB	Output is correct
35	Correct	2 ms	340 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	3 ms	340 KB	Output is correct
38	Correct	26 ms	820 KB	Output is correct
39	Correct	26 ms	824 KB	Output is correct
40	Correct	25 ms	820 KB	Output is correct
41	Correct	25 ms	740 KB	Output is correct
42	Correct	31 ms	816 KB	Output is correct
43	Correct	30 ms	1132 KB	Output is correct
44	Correct	29 ms	1108 KB	Output is correct
45	Correct	28 ms	1108 KB	Output is correct
46	Correct	25 ms	1152 KB	Output is correct
47	Correct	11 ms	340 KB	Output is correct
48	Correct	78 ms	1312 KB	Output is correct
49	Correct	44 ms	392 KB	Output is correct
50	Correct	72 ms	1136 KB	Output is correct
51	Correct	6 ms	1324 KB	Output is correct
52	Correct	2 ms	304 KB	Output is correct
53	Correct	5 ms	1108 KB	Output is correct
54	Correct	88 ms	1144 KB	Output is correct
55	Correct	81 ms	1164 KB	Output is correct
56	Correct	64 ms	1180 KB	Output is correct
57	Correct	46 ms	1108 KB	Output is correct

답안 #806706

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 21.0 / 21.0

Subtask #4 35.0 / 35.0

Subtask #5 23.0 / 23.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
21.0 / 21.0

Subtask #4
35.0 / 35.0

Subtask #5
23.0 / 23.0