oj.uz

Submission #336389

# Submission time Handle Problem Language Result Execution time Memory
336389 2020-12-15T07:16:39 Z KoD Remittance (JOI19_remittance) C++17
100 / 100
 690 ms 60012 KB 
#include <bits/stdc++.h>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

template <class T>
using Vec = std::vector<T>;

constexpr i32 inf32 = (u32) ~0 >> 2;
constexpr i64 inf64 = (u64) ~0 >> 2;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    usize N;
    std::cin >> N;
    Vec<i64> A(N), B(N);
    for (usize i = 0; i < N; ++i) {
        std::cin >> A[i] >> B[i];
    }
    Vec<i64> dif(N);
    for (usize i = 0; i < N; ++i) {
        const auto j = (i + 1 == N ? 0 : i + 1);
        dif[i] = B[j] - A[j];
    }
    std::vector<i64> number(N + 30);
    const auto add = [&](std::vector<i64> &vec, i64 x, const usize shift) {
        bool neg = (x < 0);
        x = std::abs(x);
        for (usize d = 0; d < 30; ++d) {
            if (x >> d & 1) {
                vec[shift + d] += (neg ? -1 : 1);
            }
        }
    };
    const auto fix = [&](std::vector<i64> &vec) {
        for (usize i = 0; i + 1 < vec.size(); ++i) {
            if (vec[i] < 0) {
                const auto tmp = -vec[i];
                vec[i] += tmp * 2;
                vec[i + 1] -= tmp;
            }
            const auto tmp = vec[i] / 2;
            vec[i] -= tmp * 2;
            vec[i + 1] += tmp;
        }
    };
    add(number, -dif[N - 1], 0);
    for (usize i = 0; i + 1 < N; ++i) {
        add(number, -dif[i], i + 1);
    }
    fix(number);
    if (number.back() < 0) {
        std::cout << "No\n";
        return 0;
    }
    i64 big = 1000000000, small = -1;
    while (big - small > 1) {
        const auto md = (big + small) / 2;
        std::vector<i64> comp(number.size());
        add(comp, md, N);
        add(comp, -md, 0);
        fix(comp);
        bool large = true;
        for (usize i = number.size(); i --> 0;) {
            if (comp[i] < number[i]) {
                large = false;
                break;
            }
            if (comp[i] > number[i]) {
                break;
            }
        }
        (large ? big : small) = md;
    }
    Vec<i64> X(N);
    X[N - 1] = big;
    for (usize i = N - 1; i --> 0;) {
        X[i] = dif[i] + 2 * X[i + 1];
        if (X[i] < 0) {
            std::cout << "No\n";
            return 0;
        }
    }
    for (usize step = 0; step < 30; ++step) {
        for (usize i = 0; i < N; ++i) {
            const auto j = (i + 1 == N ? 0 : i + 1);
            const auto tmp = std::min(X[i], A[i] / 2);
            X[i] -= tmp;
            A[i] -= 2 * tmp;
            A[j] += tmp;
        }
    }
    for (usize i = 0; i < N; ++i) {
        if (A[i] != B[i]) {
            std::cout << "No\n";
            return 0;
        }
    }
    std::cout << "Yes\n";
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 0 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 0 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 0 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 0 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 0 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 0 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 0 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 0 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 0 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 422 ms 31724 KB Output is correct
64 Correct 461 ms 43476 KB Output is correct
65 Correct 664 ms 58604 KB Output is correct
66 Correct 443 ms 43372 KB Output is correct
67 Correct 483 ms 44884 KB Output is correct
68 Correct 526 ms 47316 KB Output is correct
69 Correct 669 ms 58912 KB Output is correct
70 Correct 340 ms 43372 KB Output is correct
71 Correct 363 ms 44884 KB Output is correct
72 Correct 391 ms 47316 KB Output is correct
73 Correct 555 ms 59092 KB Output is correct
74 Correct 365 ms 43372 KB Output is correct
75 Correct 356 ms 45012 KB Output is correct
76 Correct 392 ms 47204 KB Output is correct
77 Correct 554 ms 58988 KB Output is correct
78 Correct 650 ms 51052 KB Output is correct
79 Correct 497 ms 51156 KB Output is correct
80 Correct 613 ms 51180 KB Output is correct
81 Correct 522 ms 51308 KB Output is correct
82 Correct 471 ms 43372 KB Output is correct
83 Correct 176 ms 35564 KB Output is correct
84 Correct 447 ms 43372 KB Output is correct
85 Correct 690 ms 59908 KB Output is correct
86 Correct 575 ms 60012 KB Output is correct
87 Correct 597 ms 52364 KB Output is correct
88 Correct 533 ms 52364 KB Output is correct