oj.uz

답안 #818648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
818648 2023-08-10T06:04:53 Z kevinsogo 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 40 ms 51708 KB 
#include <bits/stdc++.h>
using namespace std;
#include "biscuits.h"
using ll = long long;
using lll = __int128;

struct node {
    lll mn, mx, ad, sz;
    node *l, *r;
};
using seq = node*;
seq con(lll n, lll v) {
    return n == 0 ? nullptr : new node{v, v, 0, n, nullptr, nullptr};
}
seq inc(seq s, lll a) {
    return a == 0 ? s : new node{s->mn, s->mx, s->ad + a, s->sz, s->l, s->r};
}
seq conc(seq l, seq r, lll ad = 0) {
    if (l == nullptr) return inc(r, ad);
    if (r == nullptr) return inc(l, ad);
    assert(l->mx + l->ad <= r->mn + r->ad);
    return new node{l->mn + l->ad, r->mx + r->ad, ad, l->sz + r->sz, l, r};
}
seq drop(seq s, lll u = 0) {
    u -= s->ad;
    return s->mx < u ? nullptr : u <= s->mn ? s : conc(drop(s->l, u), drop(s->r, u), s->ad);
}
lll size(seq s) {
    return s->sz;
}

ll count_tastiness(ll x, vector<ll> a) {
    a.resize(62);
    auto s = con(1, 0);
    for (int i = 0; i < a.size(); i++) s = drop(conc(inc(s, lll(-x) << i), s, lll(a[i]) << i));
    return size(s);
}

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:35:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (int i = 0; i < a.size(); i++) s = drop(conc(inc(s, lll(-x) << i), s, lll(a[i]) << i));
      |                     ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 428 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 812 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 13140 KB Output is correct
2 Correct 22 ms 27984 KB Output is correct
3 Correct 23 ms 27368 KB Output is correct
4 Correct 23 ms 26712 KB Output is correct
5 Correct 21 ms 26184 KB Output is correct
6 Correct 25 ms 32452 KB Output is correct
7 Correct 26 ms 32776 KB Output is correct
8 Correct 25 ms 31276 KB Output is correct
9 Correct 24 ms 30292 KB Output is correct
10 Correct 23 ms 22860 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 432 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 6 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 428 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 724 KB Output is correct
35 Correct 1 ms 852 KB Output is correct
36 Correct 1 ms 812 KB Output is correct
37 Correct 8 ms 13140 KB Output is correct
38 Correct 22 ms 27984 KB Output is correct
39 Correct 23 ms 27368 KB Output is correct
40 Correct 23 ms 26712 KB Output is correct
41 Correct 21 ms 26184 KB Output is correct
42 Correct 25 ms 32452 KB Output is correct
43 Correct 26 ms 32776 KB Output is correct
44 Correct 25 ms 31276 KB Output is correct
45 Correct 24 ms 30292 KB Output is correct
46 Correct 23 ms 22860 KB Output is correct
47 Correct 10 ms 14036 KB Output is correct
48 Correct 17 ms 18352 KB Output is correct
49 Correct 10 ms 15412 KB Output is correct
50 Correct 16 ms 17924 KB Output is correct
51 Correct 17 ms 17876 KB Output is correct
52 Correct 8 ms 12272 KB Output is correct
53 Correct 15 ms 16972 KB Output is correct
54 Correct 38 ms 51708 KB Output is correct
55 Correct 40 ms 51412 KB Output is correct
56 Correct 37 ms 49228 KB Output is correct
57 Correct 34 ms 44408 KB Output is correct