oj.uz

답안 #320628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320628 2020-11-09T09:43:54 Z arujbansal Discharging (NOI20_discharging) C++17
100 / 100
 437 ms 17680 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;

template<typename T>
struct LiChaoTree {

    struct Line {
        T slope, yIntercept;

        Line() {
            slope = 0;
            yIntercept = INF;
        }

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

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

    struct Node {
        int left, right;
        Line line;

        Node() {
            left = -1;
            right = -1;
        }

        T val(T x) { return line.val(x); }
    };

    T n;
    vector<Node> t;

    void init(T n) {
        this->n = n;
        t.clear();
        t.emplace_back();
        t.emplace_back();
    }

    void create_children(int i) {
        if (t[i].left > -1) return;
        t[i].left = sz(t);
        t.emplace_back();
        t[i].right = sz(t);
        t.emplace_back();
    }

    void insert(int i, T l, T r, Line newLine) {
        T mid = (l + r) >> 1;
        if (newLine.val(mid) < t[i].val(mid)) swap(newLine, t[i].line);
        if (r - l <= 1) return;
        if (newLine.yIntercept >= INF) return;
        create_children(i);
        if (newLine.val(l) <= t[i].val(l)) insert(t[i].left, l, mid, newLine);
        else insert(t[i].right, mid + 1, r, newLine);
    }

    T query(int i, T l, T r, T x) {
        if (r - l <= 1) return t[i].val(x);
        if (t[i].line.yIntercept >= INF) return INF;
        create_children(i);
        T mid = (l + r) >> 1;
        if (x <= mid) return min(t[i].val(x), query(t[i].left, l, mid, x));
        else return min(t[i].val(x), query(t[i].right, mid + 1, r, x));
    }

    void insert(T slope, T yIntercept) { insert(1, 0, n - 1, Line(slope, yIntercept)); }

    T query(T x) { return query(1, 0, n - 1, 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];

    LiChaoTree<int> cht;
    cht.init(N);

    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 1 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 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 0 ms 364 KB Output is correct
10 Correct 0 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 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 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 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 372 ms 17120 KB Output is correct
17 Correct 398 ms 17528 KB Output is correct
18 Correct 382 ms 17380 KB Output is correct
19 Correct 358 ms 17380 KB Output is correct
20 Correct 360 ms 17376 KB Output is correct
21 Correct 382 ms 17252 KB Output is correct
22 Correct 369 ms 17344 KB Output is correct
23 Correct 358 ms 17380 KB Output is correct
24 Correct 369 ms 17380 KB Output is correct
25 Correct 360 ms 17252 KB Output is correct
26 Correct 353 ms 17384 KB Output is correct
27 Correct 381 ms 17252 KB Output is correct
28 Correct 361 ms 17380 KB Output is correct
29 Correct 359 ms 17252 KB Output is correct
30 Correct 364 ms 17256 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 15972 KB Output is correct
2 Correct 373 ms 16100 KB Output is correct
3 Correct 358 ms 16100 KB Output is correct
4 Correct 384 ms 15972 KB Output is correct
5 Correct 348 ms 16136 KB Output is correct
6 Correct 382 ms 15972 KB Output is correct
7 Correct 363 ms 16176 KB Output is correct
8 Correct 365 ms 15972 KB Output is correct
9 Correct 380 ms 15972 KB Output is correct
10 Correct 380 ms 16024 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 1 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 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 0 ms 364 KB Output is correct
10 Correct 0 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 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 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 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 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 512 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 492 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 1 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 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 0 ms 364 KB Output is correct
10 Correct 0 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 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 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 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 372 ms 17120 KB Output is correct
31 Correct 398 ms 17528 KB Output is correct
32 Correct 382 ms 17380 KB Output is correct
33 Correct 358 ms 17380 KB Output is correct
34 Correct 360 ms 17376 KB Output is correct
35 Correct 382 ms 17252 KB Output is correct
36 Correct 369 ms 17344 KB Output is correct
37 Correct 358 ms 17380 KB Output is correct
38 Correct 369 ms 17380 KB Output is correct
39 Correct 360 ms 17252 KB Output is correct
40 Correct 353 ms 17384 KB Output is correct
41 Correct 381 ms 17252 KB Output is correct
42 Correct 361 ms 17380 KB Output is correct
43 Correct 359 ms 17252 KB Output is correct
44 Correct 364 ms 17256 KB Output is correct
45 Correct 437 ms 15972 KB Output is correct
46 Correct 373 ms 16100 KB Output is correct
47 Correct 358 ms 16100 KB Output is correct
48 Correct 384 ms 15972 KB Output is correct
49 Correct 348 ms 16136 KB Output is correct
50 Correct 382 ms 15972 KB Output is correct
51 Correct 363 ms 16176 KB Output is correct
52 Correct 365 ms 15972 KB Output is correct
53 Correct 380 ms 15972 KB Output is correct
54 Correct 380 ms 16024 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 512 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 492 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 313 ms 16228 KB Output is correct
77 Correct 319 ms 16228 KB Output is correct
78 Correct 327 ms 16200 KB Output is correct
79 Correct 324 ms 16228 KB Output is correct
80 Correct 314 ms 16228 KB Output is correct
81 Correct 322 ms 16228 KB Output is correct
82 Correct 320 ms 16356 KB Output is correct
83 Correct 334 ms 16228 KB Output is correct
84 Correct 317 ms 16228 KB Output is correct
85 Correct 328 ms 16232 KB Output is correct
86 Correct 328 ms 16228 KB Output is correct
87 Correct 331 ms 16228 KB Output is correct
88 Correct 332 ms 16228 KB Output is correct
89 Correct 321 ms 16232 KB Output is correct
90 Correct 323 ms 16228 KB Output is correct
91 Correct 342 ms 16228 KB Output is correct
92 Correct 359 ms 17680 KB Output is correct
93 Correct 366 ms 17252 KB Output is correct
94 Correct 327 ms 16228 KB Output is correct
95 Correct 311 ms 16228 KB Output is correct
96 Correct 341 ms 16228 KB Output is correct
97 Correct 326 ms 16232 KB Output is correct
98 Correct 314 ms 16228 KB Output is correct
99 Correct 323 ms 16228 KB Output is correct
100 Correct 317 ms 16228 KB Output is correct