oj.uz

답안 #337615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337615 2020-12-21T09:13:42 Z ncduy0303 Discharging (NOI20_discharging) C++17
100 / 100
 129 ms 12000 KB 
#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long

const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;

struct convexhull {
    struct line {
        ll m, c; 
        line(ll m, ll c): m(m), c(c) {}
        ll operator()(ll x) {return m * x + c;}
    };
    deque<line> dq;
 
    bool bad(line a, line b, line c) {
        return 1.0 * (c.c - a.c) / (a.m - c.m) <= 1.0 * (b.c - a.c) /  (a.m - b.m);
    }
 
    void add(line l) {
        while(dq.size() > 1 && bad(dq[(int)dq.size() - 2], dq.back(), l))
            dq.pop_back();
        dq.emplace_back(l);
    }

    ll query(ll x) { // min query, increasing x
        while (dq.size() >= 2 && dq[0](x) >= dq[1](x)) dq.pop_front();
        return dq[0](x);
    }
 
    // ll query(ll x) { // min query, any x
    //     int lo = -1, hi = dq.size() - 1;
    //     while (lo + 1 < hi) {
    //         int mid = (lo + hi) / 2;
    //         if (dq[mid](x) >= dq[mid + 1](x)) lo = mid;
    //         else hi = mid;
    //     }
    //     return dq[hi](x);
    // }
};

// struct convexhull {
//     struct line {
//         ll m, c; 
//         line(ll m, ll c): m(m), c(c) {}
//         ll operator()(ll x) {return m * x + c;}
//     };
//     deque<line> dq;
//     bool check(line p1, line p2, line p3) {
//         return (p2.m - p1.m) * (p3.c - p2.c) >= (p3.m - p2.m) * (p2.c - p1.c);
//     }
//     void add(line y) { // decreasing slope
//         while (dq.size() >= 2 && check(dq[dq.size() - 2], dq[dq.size() - 1], y)) dq.pop_back();
//         dq.push_back(y);
//     }
//     ll query(ll x) { // min query, increasing x
//         while (dq.size() >= 2 && dq[0](x) >= dq[1](x)) dq.pop_front();
//         return dq[0](x);
//     }
//     ll query(ll x) { // min query, any x
//         int lo = -1, hi = dq.size() - 1;
//         while (lo + 1 < hi) {
//             int mid = (lo + hi) / 2;
//             if (dq[mid](x) >= dq[mid + 1](x)) lo = mid;
//             else hi = mid;
//         }
//         return dq[hi](x);
//     }
// };

void solve() {
    int n; cin >> n;
    vector<int> a(n + 1);
    for (int i = n; i > 0; i--) cin >> a[i];
    vector<int> st;
    for (int i = 1; i <= n; i++) {
        while (st.size() && a[st.back()] <= a[i]) st.pop_back();
        st.push_back(i);
    }
    int m = st.size();
    vector<ll> dp(m + 1);
    convexhull cht;
    for (int i = 1; i <= m; i++) {
        cht.add({a[st[i - 1]], dp[i - 1]});
        dp[i] = cht.query(st[i - 1]);
    }
    cout << dp[m] << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

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 0 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 1 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 0 ms 364 KB Output is correct
14 Correct 1 ms 364 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 384 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 384 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 104 ms 9060 KB Output is correct
17 Correct 112 ms 9700 KB Output is correct
18 Correct 95 ms 7652 KB Output is correct
19 Correct 111 ms 9572 KB Output is correct
20 Correct 111 ms 10212 KB Output is correct
21 Correct 110 ms 9700 KB Output is correct
22 Correct 109 ms 9188 KB Output is correct
23 Correct 122 ms 11620 KB Output is correct
24 Correct 116 ms 10592 KB Output is correct
25 Correct 120 ms 10592 KB Output is correct
26 Correct 129 ms 12000 KB Output is correct
27 Correct 103 ms 8548 KB Output is correct
28 Correct 112 ms 9828 KB Output is correct
29 Correct 116 ms 10848 KB Output is correct
30 Correct 122 ms 11744 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 4204 KB Output is correct
2 Correct 127 ms 4204 KB Output is correct
3 Correct 117 ms 4204 KB Output is correct
4 Correct 112 ms 4204 KB Output is correct
5 Correct 115 ms 4204 KB Output is correct
6 Correct 116 ms 4204 KB Output is correct
7 Correct 117 ms 4204 KB Output is correct
8 Correct 114 ms 4204 KB Output is correct
9 Correct 115 ms 4204 KB Output is correct
10 Correct 115 ms 4204 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 0 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 1 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 0 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 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 384 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 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 0 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 1 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 0 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 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 384 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 104 ms 9060 KB Output is correct
31 Correct 112 ms 9700 KB Output is correct
32 Correct 95 ms 7652 KB Output is correct
33 Correct 111 ms 9572 KB Output is correct
34 Correct 111 ms 10212 KB Output is correct
35 Correct 110 ms 9700 KB Output is correct
36 Correct 109 ms 9188 KB Output is correct
37 Correct 122 ms 11620 KB Output is correct
38 Correct 116 ms 10592 KB Output is correct
39 Correct 120 ms 10592 KB Output is correct
40 Correct 129 ms 12000 KB Output is correct
41 Correct 103 ms 8548 KB Output is correct
42 Correct 112 ms 9828 KB Output is correct
43 Correct 116 ms 10848 KB Output is correct
44 Correct 122 ms 11744 KB Output is correct
45 Correct 112 ms 4204 KB Output is correct
46 Correct 127 ms 4204 KB Output is correct
47 Correct 117 ms 4204 KB Output is correct
48 Correct 112 ms 4204 KB Output is correct
49 Correct 115 ms 4204 KB Output is correct
50 Correct 116 ms 4204 KB Output is correct
51 Correct 117 ms 4204 KB Output is correct
52 Correct 114 ms 4204 KB Output is correct
53 Correct 115 ms 4204 KB Output is correct
54 Correct 115 ms 4204 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 104 ms 4204 KB Output is correct
77 Correct 104 ms 4204 KB Output is correct
78 Correct 103 ms 4204 KB Output is correct
79 Correct 101 ms 4204 KB Output is correct
80 Correct 108 ms 4204 KB Output is correct
81 Correct 103 ms 4204 KB Output is correct
82 Correct 100 ms 4204 KB Output is correct
83 Correct 103 ms 4204 KB Output is correct
84 Correct 104 ms 4204 KB Output is correct
85 Correct 104 ms 4204 KB Output is correct
86 Correct 99 ms 4204 KB Output is correct
87 Correct 99 ms 4204 KB Output is correct
88 Correct 101 ms 4204 KB Output is correct
89 Correct 100 ms 4204 KB Output is correct
90 Correct 100 ms 4204 KB Output is correct
91 Correct 100 ms 4204 KB Output is correct
92 Correct 118 ms 10468 KB Output is correct
93 Correct 111 ms 9828 KB Output is correct
94 Correct 98 ms 4204 KB Output is correct
95 Correct 104 ms 4204 KB Output is correct
96 Correct 100 ms 4204 KB Output is correct
97 Correct 100 ms 4204 KB Output is correct
98 Correct 101 ms 4204 KB Output is correct
99 Correct 100 ms 4204 KB Output is correct
100 Correct 106 ms 4352 KB Output is correct