oj.uz

Submission #691312

# Submission time Handle Problem Language Result Execution time Memory
691312 2023-01-31T05:03:38 Z saayan007 Discharging (NOI20_discharging) C++17
100 / 100
 147 ms 33448 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
using vi = vector<int>;
using vl = vector<long long>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<long long, long long>>;

#define fur(i, a, b) for(ll i = a; i <= (ll)b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll)b; --i)
#define fr first 
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define nl "\n"
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

const ll inf = 1e16L;
struct CHT {
    struct Line {
        ll m, c;

        Line(ll a, ll b){
            m = a;
            c = b;
        }

        ll isect(Line &other) {
            return (c - other.c + other.m - m + 1) / (other.m - m);
        }

        ll val(ll x) {
            return m*x + c;
        }
    };

    deque<pair<Line, ll>> dq;

    void insert(ll m, ll c) {
        Line nex(m, c);
        if(dq.empty()) {
            dq.eb(nex, 0);
            return;
        }

        while(!dq.empty()) {
            Line pr = dq.back().fr;
            ll x = dq.back().sc;
            if(nex.m == pr.m) {
                if(nex.c > pr.c) {
                    return;
                }
            } else if(nex.isect(pr) > x) {
                break;
            }
            dq.pop_back();
        }

        if(dq.empty()) {
            dq.eb(nex, 0);
            return;
        }

        dq.eb(nex, nex.isect(dq.back().fr));
    }

    ll query(ll x) {
        ll m = dq.size();
        while(m > 1 && dq[1].sc <= x) {
            dq.pop_front();
            --m;
        }
        return dq.front().fr.val(x);
    }
};

int main() 
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll n;
    cin >> n;

    ll t[n + 1];
    fur(i, 1, n)
        cin >> t[i];

    ll dp[n + 1];
    dp[0] = 0;
    ll p[n + 1];
    p[1] = 1;

    fur(i, 2, n) {
        if(t[i] > t[p[i - 1]])
            p[i] = i;
        else p[i] = p[i - 1];
    }

    CHT cht;
    fur(i, 1, n) {
        cht.insert(n - i + 1, dp[i - 1]);
        dp[i] = cht.query(t[p[i]]);
    }

    cout << dp[n] << nl;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 100 ms 23740 KB Output is correct
17 Correct 123 ms 23744 KB Output is correct
18 Correct 97 ms 23772 KB Output is correct
19 Correct 103 ms 23776 KB Output is correct
20 Correct 103 ms 23656 KB Output is correct
21 Correct 103 ms 23752 KB Output is correct
22 Correct 100 ms 23736 KB Output is correct
23 Correct 121 ms 23884 KB Output is correct
24 Correct 103 ms 23744 KB Output is correct
25 Correct 108 ms 23744 KB Output is correct
26 Correct 110 ms 23780 KB Output is correct
27 Correct 96 ms 23748 KB Output is correct
28 Correct 119 ms 23868 KB Output is correct
29 Correct 120 ms 23736 KB Output is correct
30 Correct 109 ms 23740 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 23784 KB Output is correct
2 Correct 133 ms 33440 KB Output is correct
3 Correct 136 ms 33324 KB Output is correct
4 Correct 128 ms 33324 KB Output is correct
5 Correct 127 ms 33324 KB Output is correct
6 Correct 134 ms 33320 KB Output is correct
7 Correct 137 ms 33320 KB Output is correct
8 Correct 139 ms 33448 KB Output is correct
9 Correct 147 ms 33324 KB Output is correct
10 Correct 127 ms 33356 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 324 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 324 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 324 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 328 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct

Subtask #6
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 100 ms 23740 KB Output is correct
31 Correct 123 ms 23744 KB Output is correct
32 Correct 97 ms 23772 KB Output is correct
33 Correct 103 ms 23776 KB Output is correct
34 Correct 103 ms 23656 KB Output is correct
35 Correct 103 ms 23752 KB Output is correct
36 Correct 100 ms 23736 KB Output is correct
37 Correct 121 ms 23884 KB Output is correct
38 Correct 103 ms 23744 KB Output is correct
39 Correct 108 ms 23744 KB Output is correct
40 Correct 110 ms 23780 KB Output is correct
41 Correct 96 ms 23748 KB Output is correct
42 Correct 119 ms 23868 KB Output is correct
43 Correct 120 ms 23736 KB Output is correct
44 Correct 109 ms 23740 KB Output is correct
45 Correct 127 ms 23784 KB Output is correct
46 Correct 133 ms 33440 KB Output is correct
47 Correct 136 ms 33324 KB Output is correct
48 Correct 128 ms 33324 KB Output is correct
49 Correct 127 ms 33324 KB Output is correct
50 Correct 134 ms 33320 KB Output is correct
51 Correct 137 ms 33320 KB Output is correct
52 Correct 139 ms 33448 KB Output is correct
53 Correct 147 ms 33324 KB Output is correct
54 Correct 127 ms 33356 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 324 KB Output is correct
57 Correct 1 ms 324 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 324 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 324 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 324 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 328 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 109 ms 29756 KB Output is correct
77 Correct 108 ms 29864 KB Output is correct
78 Correct 104 ms 29208 KB Output is correct
79 Correct 104 ms 29464 KB Output is correct
80 Correct 110 ms 30016 KB Output is correct
81 Correct 112 ms 29324 KB Output is correct
82 Correct 100 ms 29228 KB Output is correct
83 Correct 115 ms 29748 KB Output is correct
84 Correct 119 ms 29552 KB Output is correct
85 Correct 109 ms 29752 KB Output is correct
86 Correct 110 ms 29132 KB Output is correct
87 Correct 120 ms 29120 KB Output is correct
88 Correct 108 ms 29364 KB Output is correct
89 Correct 101 ms 29324 KB Output is correct
90 Correct 108 ms 29224 KB Output is correct
91 Correct 114 ms 28968 KB Output is correct
92 Correct 118 ms 30256 KB Output is correct
93 Correct 119 ms 29480 KB Output is correct
94 Correct 105 ms 28748 KB Output is correct
95 Correct 108 ms 30144 KB Output is correct
96 Correct 107 ms 29028 KB Output is correct
97 Correct 114 ms 29376 KB Output is correct
98 Correct 102 ms 29496 KB Output is correct
99 Correct 100 ms 29100 KB Output is correct
100 Correct 117 ms 29228 KB Output is correct