oj.uz

Submission #287966

# Submission time Handle Problem Language Result Execution time Memory
287966 2020-09-01T07:16:38 Z PeppaPig Discharging (NOI20_discharging) C++14
100 / 100
 181 ms 13276 KB 
#include <bits/stdc++.h>

#define long long long

using namespace std;

const int N = 1e6 + 5;

struct CHT {
    struct line {
        long m, c;
        line(long m, long c) : m(m), c(c) {}
        long f(long x) { return m * x + c; }
    };
    vector<line> vec;

    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(long m, long c) {
        line l(m, c);
        while(vec.size() > 1 && bad(vec[(int)vec.size() - 2], vec.back(), l))
            vec.pop_back();
        vec.emplace_back(l);
    }

    long get_ans(long x) {
        if(vec.empty()) return 1e18;
        int l = 0, r = (int)vec.size() - 1;
        while(l < r) {
            int mid = (l + r) >> 1;
            if(vec[mid].f(x) >= vec[mid + 1].f(x))
                l = mid + 1;
            else r = mid;
        }
        return vec[r].f(x);
    }
} hull;

int n, A[N];
long dp[N];
vector<int> stk;

int main() {
    scanf("%d", &n);
    for(int i = n; i; i--) scanf("%d", A + i);

    for(int i = 1; i <= n; i++) {
        while(!stk.empty() && A[stk.back()] <= A[i])
            stk.pop_back();
        stk.emplace_back(i);
    }
    for(int i = 0; i < (int)stk.size(); i++) {
        hull.add(A[stk[i]], dp[i - 1]);
        dp[i] = hull.get_ans(stk[i]);
    }

    printf("%lld\n", dp[(int)stk.size() - 1]);

    return 0;
}

Compilation message

Discharging.cpp: In function 'int main()':
Discharging.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Discharging.cpp:47:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   47 |     for(int i = n; i; i--) scanf("%d", A + i);
      |                            ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
13.0 / 13.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 151 ms 10296 KB Output is correct
17 Correct 161 ms 11000 KB Output is correct
18 Correct 140 ms 8936 KB Output is correct
19 Correct 153 ms 10960 KB Output is correct
20 Correct 165 ms 11492 KB Output is correct
21 Correct 157 ms 10892 KB Output is correct
22 Correct 150 ms 10468 KB Output is correct
23 Correct 174 ms 12764 KB Output is correct
24 Correct 168 ms 11868 KB Output is correct
25 Correct 168 ms 12000 KB Output is correct
26 Correct 178 ms 13276 KB Output is correct
27 Correct 139 ms 9700 KB Output is correct
28 Correct 157 ms 11108 KB Output is correct
29 Correct 166 ms 12124 KB Output is correct
30 Correct 170 ms 13020 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 4856 KB Output is correct
2 Correct 163 ms 4984 KB Output is correct
3 Correct 164 ms 4856 KB Output is correct
4 Correct 163 ms 4948 KB Output is correct
5 Correct 159 ms 4856 KB Output is correct
6 Correct 160 ms 4856 KB Output is correct
7 Correct 159 ms 4860 KB Output is correct
8 Correct 162 ms 4984 KB Output is correct
9 Correct 158 ms 5072 KB Output is correct
10 Correct 160 ms 4984 KB Output is correct

Subtask #5
14.0 / 14.0

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

Subtask #6
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 376 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 380 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 151 ms 10296 KB Output is correct
31 Correct 161 ms 11000 KB Output is correct
32 Correct 140 ms 8936 KB Output is correct
33 Correct 153 ms 10960 KB Output is correct
34 Correct 165 ms 11492 KB Output is correct
35 Correct 157 ms 10892 KB Output is correct
36 Correct 150 ms 10468 KB Output is correct
37 Correct 174 ms 12764 KB Output is correct
38 Correct 168 ms 11868 KB Output is correct
39 Correct 168 ms 12000 KB Output is correct
40 Correct 178 ms 13276 KB Output is correct
41 Correct 139 ms 9700 KB Output is correct
42 Correct 157 ms 11108 KB Output is correct
43 Correct 166 ms 12124 KB Output is correct
44 Correct 170 ms 13020 KB Output is correct
45 Correct 158 ms 4856 KB Output is correct
46 Correct 163 ms 4984 KB Output is correct
47 Correct 164 ms 4856 KB Output is correct
48 Correct 163 ms 4948 KB Output is correct
49 Correct 159 ms 4856 KB Output is correct
50 Correct 160 ms 4856 KB Output is correct
51 Correct 159 ms 4860 KB Output is correct
52 Correct 162 ms 4984 KB Output is correct
53 Correct 158 ms 5072 KB Output is correct
54 Correct 160 ms 4984 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 1 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 308 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 1 ms 384 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 1 ms 416 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 416 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 1 ms 384 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 1 ms 384 KB Output is correct
76 Correct 156 ms 5448 KB Output is correct
77 Correct 160 ms 5520 KB Output is correct
78 Correct 152 ms 5496 KB Output is correct
79 Correct 153 ms 5496 KB Output is correct
80 Correct 181 ms 5496 KB Output is correct
81 Correct 156 ms 5496 KB Output is correct
82 Correct 157 ms 5496 KB Output is correct
83 Correct 161 ms 5496 KB Output is correct
84 Correct 154 ms 5624 KB Output is correct
85 Correct 157 ms 5496 KB Output is correct
86 Correct 152 ms 5496 KB Output is correct
87 Correct 154 ms 5496 KB Output is correct
88 Correct 162 ms 5496 KB Output is correct
89 Correct 154 ms 5496 KB Output is correct
90 Correct 151 ms 5496 KB Output is correct
91 Correct 152 ms 5496 KB Output is correct
92 Correct 164 ms 11752 KB Output is correct
93 Correct 163 ms 10984 KB Output is correct
94 Correct 146 ms 5496 KB Output is correct
95 Correct 174 ms 5496 KB Output is correct
96 Correct 149 ms 5496 KB Output is correct
97 Correct 156 ms 5632 KB Output is correct
98 Correct 160 ms 5496 KB Output is correct
99 Correct 159 ms 5496 KB Output is correct
100 Correct 154 ms 5496 KB Output is correct