oj.uz

Submission #320535

# Submission time Handle Problem Language Result Execution time Memory
320535 2020-11-09T04:13:48 Z arujbansal Discharging (NOI20_discharging) C++17
100 / 100
 847 ms 285508 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;
        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);
        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

# Verdict Execution time Memory 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 0 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 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2532 KB Output is correct
2 Correct 5 ms 2680 KB Output is correct
3 Correct 3 ms 2672 KB Output is correct
4 Correct 3 ms 2532 KB Output is correct
5 Correct 3 ms 2532 KB Output is correct
6 Correct 3 ms 2532 KB Output is correct
7 Correct 3 ms 2532 KB Output is correct
8 Correct 4 ms 2532 KB Output is correct
9 Correct 3 ms 2532 KB Output is correct
10 Correct 3 ms 2532 KB Output is correct
11 Correct 4 ms 2532 KB Output is correct
12 Correct 3 ms 2532 KB Output is correct
13 Correct 3 ms 2532 KB Output is correct
14 Correct 4 ms 2532 KB Output is correct
15 Correct 5 ms 2532 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2532 KB Output is correct
2 Correct 5 ms 2680 KB Output is correct
3 Correct 3 ms 2672 KB Output is correct
4 Correct 3 ms 2532 KB Output is correct
5 Correct 3 ms 2532 KB Output is correct
6 Correct 3 ms 2532 KB Output is correct
7 Correct 3 ms 2532 KB Output is correct
8 Correct 4 ms 2532 KB Output is correct
9 Correct 3 ms 2532 KB Output is correct
10 Correct 3 ms 2532 KB Output is correct
11 Correct 4 ms 2532 KB Output is correct
12 Correct 3 ms 2532 KB Output is correct
13 Correct 3 ms 2532 KB Output is correct
14 Correct 4 ms 2532 KB Output is correct
15 Correct 5 ms 2532 KB Output is correct
16 Correct 740 ms 283976 KB Output is correct
17 Correct 800 ms 284616 KB Output is correct
18 Correct 599 ms 151884 KB Output is correct
19 Correct 728 ms 284664 KB Output is correct
20 Correct 761 ms 284804 KB Output is correct
21 Correct 786 ms 284788 KB Output is correct
22 Correct 713 ms 284228 KB Output is correct
23 Correct 826 ms 285248 KB Output is correct
24 Correct 778 ms 284748 KB Output is correct
25 Correct 826 ms 285128 KB Output is correct
26 Correct 847 ms 285508 KB Output is correct
27 Correct 613 ms 152684 KB Output is correct
28 Correct 810 ms 284892 KB Output is correct
29 Correct 784 ms 285040 KB Output is correct
30 Correct 798 ms 285260 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 22628 KB Output is correct
2 Correct 427 ms 25828 KB Output is correct
3 Correct 426 ms 25824 KB Output is correct
4 Correct 430 ms 25700 KB Output is correct
5 Correct 426 ms 25856 KB Output is correct
6 Correct 429 ms 25828 KB Output is correct
7 Correct 430 ms 25828 KB Output is correct
8 Correct 425 ms 25696 KB Output is correct
9 Correct 426 ms 25828 KB Output is correct
10 Correct 423 ms 25816 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory 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 0 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 1 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 4 ms 2532 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 3 ms 2672 KB Output is correct
18 Correct 3 ms 2532 KB Output is correct
19 Correct 3 ms 2532 KB Output is correct
20 Correct 3 ms 2532 KB Output is correct
21 Correct 3 ms 2532 KB Output is correct
22 Correct 4 ms 2532 KB Output is correct
23 Correct 3 ms 2532 KB Output is correct
24 Correct 3 ms 2532 KB Output is correct
25 Correct 4 ms 2532 KB Output is correct
26 Correct 3 ms 2532 KB Output is correct
27 Correct 3 ms 2532 KB Output is correct
28 Correct 4 ms 2532 KB Output is correct
29 Correct 5 ms 2532 KB Output is correct
30 Correct 2 ms 1004 KB Output is correct
31 Correct 2 ms 1004 KB Output is correct
32 Correct 2 ms 1004 KB Output is correct
33 Correct 2 ms 1004 KB Output is correct
34 Correct 2 ms 1004 KB Output is correct
35 Correct 2 ms 1004 KB Output is correct
36 Correct 2 ms 1004 KB Output is correct
37 Correct 2 ms 1004 KB Output is correct
38 Correct 2 ms 1004 KB Output is correct
39 Correct 2 ms 1004 KB Output is correct
40 Correct 2 ms 1004 KB Output is correct
41 Correct 2 ms 1004 KB Output is correct
42 Correct 2 ms 1004 KB Output is correct
43 Correct 3 ms 2532 KB Output is correct
44 Correct 2 ms 1004 KB Output is correct
45 Correct 2 ms 1004 KB Output is correct
46 Correct 2 ms 1004 KB Output is correct
47 Correct 2 ms 1004 KB Output is correct
48 Correct 2 ms 1004 KB Output is correct
49 Correct 2 ms 1004 KB Output is correct
50 Correct 2 ms 1004 KB Output is correct

Subtask #6
28.0 / 28.0

# Verdict Execution time Memory 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 0 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 1 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 4 ms 2532 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 3 ms 2672 KB Output is correct
18 Correct 3 ms 2532 KB Output is correct
19 Correct 3 ms 2532 KB Output is correct
20 Correct 3 ms 2532 KB Output is correct
21 Correct 3 ms 2532 KB Output is correct
22 Correct 4 ms 2532 KB Output is correct
23 Correct 3 ms 2532 KB Output is correct
24 Correct 3 ms 2532 KB Output is correct
25 Correct 4 ms 2532 KB Output is correct
26 Correct 3 ms 2532 KB Output is correct
27 Correct 3 ms 2532 KB Output is correct
28 Correct 4 ms 2532 KB Output is correct
29 Correct 5 ms 2532 KB Output is correct
30 Correct 740 ms 283976 KB Output is correct
31 Correct 800 ms 284616 KB Output is correct
32 Correct 599 ms 151884 KB Output is correct
33 Correct 728 ms 284664 KB Output is correct
34 Correct 761 ms 284804 KB Output is correct
35 Correct 786 ms 284788 KB Output is correct
36 Correct 713 ms 284228 KB Output is correct
37 Correct 826 ms 285248 KB Output is correct
38 Correct 778 ms 284748 KB Output is correct
39 Correct 826 ms 285128 KB Output is correct
40 Correct 847 ms 285508 KB Output is correct
41 Correct 613 ms 152684 KB Output is correct
42 Correct 810 ms 284892 KB Output is correct
43 Correct 784 ms 285040 KB Output is correct
44 Correct 798 ms 285260 KB Output is correct
45 Correct 428 ms 22628 KB Output is correct
46 Correct 427 ms 25828 KB Output is correct
47 Correct 426 ms 25824 KB Output is correct
48 Correct 430 ms 25700 KB Output is correct
49 Correct 426 ms 25856 KB Output is correct
50 Correct 429 ms 25828 KB Output is correct
51 Correct 430 ms 25828 KB Output is correct
52 Correct 425 ms 25696 KB Output is correct
53 Correct 426 ms 25828 KB Output is correct
54 Correct 423 ms 25816 KB Output is correct
55 Correct 2 ms 1004 KB Output is correct
56 Correct 2 ms 1004 KB Output is correct
57 Correct 2 ms 1004 KB Output is correct
58 Correct 2 ms 1004 KB Output is correct
59 Correct 2 ms 1004 KB Output is correct
60 Correct 2 ms 1004 KB Output is correct
61 Correct 2 ms 1004 KB Output is correct
62 Correct 2 ms 1004 KB Output is correct
63 Correct 2 ms 1004 KB Output is correct
64 Correct 2 ms 1004 KB Output is correct
65 Correct 2 ms 1004 KB Output is correct
66 Correct 2 ms 1004 KB Output is correct
67 Correct 2 ms 1004 KB Output is correct
68 Correct 3 ms 2532 KB Output is correct
69 Correct 2 ms 1004 KB Output is correct
70 Correct 2 ms 1004 KB Output is correct
71 Correct 2 ms 1004 KB Output is correct
72 Correct 2 ms 1004 KB Output is correct
73 Correct 2 ms 1004 KB Output is correct
74 Correct 2 ms 1004 KB Output is correct
75 Correct 2 ms 1004 KB Output is correct
76 Correct 406 ms 22792 KB Output is correct
77 Correct 406 ms 22796 KB Output is correct
78 Correct 401 ms 22120 KB Output is correct
79 Correct 401 ms 22504 KB Output is correct
80 Correct 409 ms 23016 KB Output is correct
81 Correct 404 ms 22252 KB Output is correct
82 Correct 407 ms 22120 KB Output is correct
83 Correct 407 ms 22632 KB Output is correct
84 Correct 400 ms 22504 KB Output is correct
85 Correct 408 ms 22756 KB Output is correct
86 Correct 397 ms 22136 KB Output is correct
87 Correct 402 ms 21992 KB Output is correct
88 Correct 402 ms 22676 KB Output is correct
89 Correct 399 ms 22248 KB Output is correct
90 Correct 400 ms 22120 KB Output is correct
91 Correct 398 ms 21864 KB Output is correct
92 Correct 794 ms 285384 KB Output is correct
93 Correct 757 ms 284612 KB Output is correct
94 Correct 406 ms 21608 KB Output is correct
95 Correct 404 ms 23012 KB Output is correct
96 Correct 397 ms 21864 KB Output is correct
97 Correct 401 ms 22252 KB Output is correct
98 Correct 443 ms 22376 KB Output is correct
99 Correct 399 ms 22120 KB Output is correct
100 Correct 398 ms 22276 KB Output is correct