답안 #854911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
854911	2023-09-29T11:48:35 Z	Forested	Discharging (NOI20_discharging)	C++17	100 / 100	94 ms	25696 KB

Discharging

#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <charconv>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

class CHT {
    struct Line {
        i64 a, b;
        i64 operator()(i64 x) const {
            return a * x + b;
        }
    };
    static i64 inter(Line l0, Line l1) {
        assert(l0.a > l1.a);
        i64 ret = (l1.b - l0.b) / (l0.a - l1.a);
        /*if (l1.b - l0.b < 0 && (l1.b - l0.b) % (l0.a - l1.a) != 0) {
            ret -= 1;
        }*/
        return ret;
    }
    deque<Line> lines;
public:
    CHT() : lines() {}
    void add(i64 a, i64 b) {
        if (!lines.empty() && lines.back().a == a) {
            if (lines.back().b > b) {
                lines.pop_back();
            } else {
                return;
            }
        }
        if (!lines.empty()) {
            assert(lines.back().a > a);
        }
        Line line{a, b};
        while (lines.size() >= 2 && inter(lines[lines.size() - 2], lines.back()) >= inter(lines.back(), line)) {
            lines.pop_back();
        }
        lines.push_back(line);
    }
    i64 get(i64 x) {
        assert(!lines.empty());
        while (lines.size() >= 2 && lines[0](x) > lines[1](x)) {
            lines.pop_front();
        }
        return lines.front()(x);
    }
};

int main() {
    i32 n;
    cin >> n;
    Vec<i64> t(n);
    REP(i, n) {
        cin >> t[i];
    }
    REP(i, n - 1) {
        chmax(t[i + 1], t[i]);
    }
    reverse(ALL(t));
    Vec<i64> dp(n + 1, 0);
    CHT cht;
    REP(i, n) {
        cht.add(t[i], dp[i]);
        dp[i + 1] = cht.get(i + 1);
    }
    cout << dp[n] << '\n';
}

Subtask #1
9.0 / 9.0

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

Subtask #2
13.0 / 13.0

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

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	80 ms	21000 KB	Output is correct
17	Correct	78 ms	21840 KB	Output is correct
18	Correct	70 ms	20288 KB	Output is correct
19	Correct	82 ms	21840 KB	Output is correct
20	Correct	79 ms	21700 KB	Output is correct
21	Correct	85 ms	21876 KB	Output is correct
22	Correct	85 ms	21448 KB	Output is correct
23	Correct	90 ms	22684 KB	Output is correct
24	Correct	82 ms	21828 KB	Output is correct
25	Correct	83 ms	22208 KB	Output is correct
26	Correct	90 ms	22592 KB	Output is correct
27	Correct	78 ms	21076 KB	Output is correct
28	Correct	79 ms	21960 KB	Output is correct
29	Correct	88 ms	22104 KB	Output is correct
30	Correct	86 ms	22352 KB	Output is correct

Subtask #4
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	88 ms	25676 KB	Output is correct
2	Correct	86 ms	25680 KB	Output is correct
3	Correct	83 ms	25696 KB	Output is correct
4	Correct	83 ms	25672 KB	Output is correct
5	Correct	86 ms	25568 KB	Output is correct
6	Correct	84 ms	25560 KB	Output is correct
7	Correct	85 ms	25556 KB	Output is correct
8	Correct	83 ms	25680 KB	Output is correct
9	Correct	83 ms	25548 KB	Output is correct
10	Correct	83 ms	25548 KB	Output is correct

Subtask #5
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	380 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	464 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	388 KB	Output is correct
43	Correct	0 ms	464 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	460 KB	Output is correct
46	Correct	0 ms	464 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	344 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct

Subtask #6
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	380 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	80 ms	21000 KB	Output is correct
31	Correct	78 ms	21840 KB	Output is correct
32	Correct	70 ms	20288 KB	Output is correct
33	Correct	82 ms	21840 KB	Output is correct
34	Correct	79 ms	21700 KB	Output is correct
35	Correct	85 ms	21876 KB	Output is correct
36	Correct	85 ms	21448 KB	Output is correct
37	Correct	90 ms	22684 KB	Output is correct
38	Correct	82 ms	21828 KB	Output is correct
39	Correct	83 ms	22208 KB	Output is correct
40	Correct	90 ms	22592 KB	Output is correct
41	Correct	78 ms	21076 KB	Output is correct
42	Correct	79 ms	21960 KB	Output is correct
43	Correct	88 ms	22104 KB	Output is correct
44	Correct	86 ms	22352 KB	Output is correct
45	Correct	88 ms	25676 KB	Output is correct
46	Correct	86 ms	25680 KB	Output is correct
47	Correct	83 ms	25696 KB	Output is correct
48	Correct	83 ms	25672 KB	Output is correct
49	Correct	86 ms	25568 KB	Output is correct
50	Correct	84 ms	25560 KB	Output is correct
51	Correct	85 ms	25556 KB	Output is correct
52	Correct	83 ms	25680 KB	Output is correct
53	Correct	83 ms	25548 KB	Output is correct
54	Correct	83 ms	25548 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	464 KB	Output is correct
59	Correct	1 ms	344 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	1 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	388 KB	Output is correct
68	Correct	0 ms	464 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	0 ms	460 KB	Output is correct
71	Correct	0 ms	464 KB	Output is correct
72	Correct	0 ms	348 KB	Output is correct
73	Correct	0 ms	348 KB	Output is correct
74	Correct	0 ms	344 KB	Output is correct
75	Correct	1 ms	348 KB	Output is correct
76	Correct	71 ms	22364 KB	Output is correct
77	Correct	72 ms	22340 KB	Output is correct
78	Correct	69 ms	21328 KB	Output is correct
79	Correct	83 ms	21584 KB	Output is correct
80	Correct	75 ms	22220 KB	Output is correct
81	Correct	68 ms	21588 KB	Output is correct
82	Correct	69 ms	21612 KB	Output is correct
83	Correct	70 ms	21840 KB	Output is correct
84	Correct	69 ms	21904 KB	Output is correct
85	Correct	70 ms	21948 KB	Output is correct
86	Correct	66 ms	21448 KB	Output is correct
87	Correct	66 ms	21300 KB	Output is correct
88	Correct	69 ms	21584 KB	Output is correct
89	Correct	66 ms	21584 KB	Output is correct
90	Correct	67 ms	21568 KB	Output is correct
91	Correct	65 ms	21328 KB	Output is correct
92	Correct	84 ms	22600 KB	Output is correct
93	Correct	94 ms	21964 KB	Output is correct
94	Correct	74 ms	20812 KB	Output is correct
95	Correct	70 ms	22352 KB	Output is correct
96	Correct	65 ms	21320 KB	Output is correct
97	Correct	75 ms	21692 KB	Output is correct
98	Correct	70 ms	21828 KB	Output is correct
99	Correct	66 ms	21328 KB	Output is correct
100	Correct	71 ms	21588 KB	Output is correct

답안 #854911

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 13.0 / 13.0

Subtask #3 25.0 / 25.0

Subtask #4 11.0 / 11.0

Subtask #5 14.0 / 14.0

Subtask #6 28.0 / 28.0

Subtask #1
9.0 / 9.0

Subtask #2
13.0 / 13.0

Subtask #3
25.0 / 25.0

Subtask #4
11.0 / 11.0

Subtask #5
14.0 / 14.0

Subtask #6
28.0 / 28.0