oj.uz

답안 #320536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320536 2020-11-09T04:15:09 Z arujbansal Discharging (NOI20_discharging) C++17
100 / 100
 146 ms 16172 KB 
#include <bits/stdc++.h>

#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define setIO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int) (x).size()
#define lc(i) 2*i
#define rc(i) 2*i+1
#define int long long
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vii = vector<ii>;
using vi = vector<int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vvb = vector<vb>;

const int N = 1e9 + 5, MOD = 1e9 + 7, INF = 1e17;

struct CHT {

    struct Line {
        int slope, yIntercept;

        Line(int slope, int yIntercept) : slope(slope), yIntercept(yIntercept) {}

        int val(int x) {
            return slope * x + yIntercept;
        }

        int intersect(Line y) {
            return (y.yIntercept - yIntercept + slope - y.slope - 1) / (slope - y.slope);
        }
    };

    deque<pair<Line, int>> dq;

    void insert(int slope, int yIntercept) {
        Line newLine(slope, yIntercept);

        while (sz(dq) > 1 && dq.back().second >= dq.back().first.intersect(newLine))
            dq.pop_back();

        if (dq.empty()) {
            dq.emplace_back(newLine, 0);
            return;
        }

        dq.emplace_back(newLine, dq.back().first.intersect(newLine));
    }

    int query(int x) {

        while (sz(dq) > 1) {
            if (dq[1].second <= x) dq.pop_front();
            else break;
        }

        return dq[0].first.val(x);
    }

    int query2(int x) {
        auto qry = *lower_bound(dq.rbegin(), dq.rend(),
                                make_pair(Line(0, 0), x),
                                [&](const pair<Line, int> &a, const pair<Line, int> &b) {
                                    return a.second > b.second;
                                });

        return qry.first.val(x);
    }
};

signed main() {
    FAST_IO;
#ifdef arujbansal_local
    setIO("input.txt", "output.txt");
#endif

    int n;
    cin >> n;

    int a[n + 1];
    for (int i = 1; i <= n; i++) cin >> a[i];

    CHT cht;

    vi dp(n + 1);
    dp[1] = a[1] * n;

    cht.insert(n, 0);

    int mx = a[1];

    for (int i = 2; i <= n; i++) {
        mx = max(mx, a[i]);
        cht.insert(n - i + 1, dp[i - 1]);
        dp[i] = cht.query(mx);
    }

    cout << dp[n];
}

Subtask #1
9.0 / 9.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 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 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 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 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 114 ms 15972 KB Output is correct
17 Correct 119 ms 15976 KB Output is correct
18 Correct 110 ms 15972 KB Output is correct
19 Correct 127 ms 15972 KB Output is correct
20 Correct 127 ms 15972 KB Output is correct
21 Correct 127 ms 15972 KB Output is correct
22 Correct 123 ms 15972 KB Output is correct
23 Correct 128 ms 16100 KB Output is correct
24 Correct 137 ms 15972 KB Output is correct
25 Correct 126 ms 15972 KB Output is correct
26 Correct 131 ms 15972 KB Output is correct
27 Correct 113 ms 15972 KB Output is correct
28 Correct 121 ms 15972 KB Output is correct
29 Correct 130 ms 15972 KB Output is correct
30 Correct 123 ms 15972 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 15972 KB Output is correct
2 Correct 142 ms 15976 KB Output is correct
3 Correct 145 ms 15972 KB Output is correct
4 Correct 139 ms 15972 KB Output is correct
5 Correct 144 ms 15972 KB Output is correct
6 Correct 140 ms 15972 KB Output is correct
7 Correct 146 ms 16088 KB Output is correct
8 Correct 140 ms 16100 KB Output is correct
9 Correct 146 ms 15972 KB Output is correct
10 Correct 141 ms 15972 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 1 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 384 KB Output is correct
15 Correct 1 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 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 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 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 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 364 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 1 ms 364 KB Output is correct

Subtask #6
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 1 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 384 KB Output is correct
15 Correct 1 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 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 114 ms 15972 KB Output is correct
31 Correct 119 ms 15976 KB Output is correct
32 Correct 110 ms 15972 KB Output is correct
33 Correct 127 ms 15972 KB Output is correct
34 Correct 127 ms 15972 KB Output is correct
35 Correct 127 ms 15972 KB Output is correct
36 Correct 123 ms 15972 KB Output is correct
37 Correct 128 ms 16100 KB Output is correct
38 Correct 137 ms 15972 KB Output is correct
39 Correct 126 ms 15972 KB Output is correct
40 Correct 131 ms 15972 KB Output is correct
41 Correct 113 ms 15972 KB Output is correct
42 Correct 121 ms 15972 KB Output is correct
43 Correct 130 ms 15972 KB Output is correct
44 Correct 123 ms 15972 KB Output is correct
45 Correct 141 ms 15972 KB Output is correct
46 Correct 142 ms 15976 KB Output is correct
47 Correct 145 ms 15972 KB Output is correct
48 Correct 139 ms 15972 KB Output is correct
49 Correct 144 ms 15972 KB Output is correct
50 Correct 140 ms 15972 KB Output is correct
51 Correct 146 ms 16088 KB Output is correct
52 Correct 140 ms 16100 KB Output is correct
53 Correct 146 ms 15972 KB Output is correct
54 Correct 141 ms 15972 KB Output is correct
55 Correct 1 ms 364 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 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 121 ms 15976 KB Output is correct
77 Correct 121 ms 15972 KB Output is correct
78 Correct 116 ms 16172 KB Output is correct
79 Correct 120 ms 15972 KB Output is correct
80 Correct 123 ms 16100 KB Output is correct
81 Correct 117 ms 16104 KB Output is correct
82 Correct 119 ms 15972 KB Output is correct
83 Correct 121 ms 15972 KB Output is correct
84 Correct 124 ms 15972 KB Output is correct
85 Correct 127 ms 16100 KB Output is correct
86 Correct 114 ms 15972 KB Output is correct
87 Correct 112 ms 16096 KB Output is correct
88 Correct 115 ms 15972 KB Output is correct
89 Correct 114 ms 16100 KB Output is correct
90 Correct 115 ms 15972 KB Output is correct
91 Correct 121 ms 15972 KB Output is correct
92 Correct 125 ms 15972 KB Output is correct
93 Correct 123 ms 15968 KB Output is correct
94 Correct 112 ms 15972 KB Output is correct
95 Correct 122 ms 16104 KB Output is correct
96 Correct 116 ms 15972 KB Output is correct
97 Correct 119 ms 16100 KB Output is correct
98 Correct 130 ms 16100 KB Output is correct
99 Correct 118 ms 15972 KB Output is correct
100 Correct 118 ms 15972 KB Output is correct