oj.uz

Submission #1043400

# Submission time Handle Problem Language Result Execution time Memory
1043400 2024-08-04T09:05:45 Z vjudge1 Discharging (NOI20_discharging) C++17
100 / 100
 73 ms 16100 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX             1000005
int nArr;

int dp[MAX], A[MAX];
struct Line{
    int a, b;
    Line(int _a = 0, int _b = LINF): a(_a), b(_b){}

    double cross(Line o){
        return (double)(o.b - b) / (double)(a - o.a);
    }
    int f(int x){return a * x + b;}
};

struct CHT{
    deque<Line> q;
    CHT(){}
    void clear(void){
        q.clear();
    }
    bool bad(Line a, Line b, Line c){
        return a.cross(c) <= a.cross(b);
    }
    void addLine(Line line){
        while(q.size() >= 2 && bad(q.end()[-2], q.end()[-1], line))
            q.pop_back();
        q.push_back(line);
    }
    void addLine(int a, int b){
        addLine(Line(a, b));
    }

    int query(int x){
        while(q.size() >= 2 && q[0].f(x) >= q[1].f(x)){
            q.pop_front();
        }
        return q[0].f(x);
    }
};

//slope decreasing, query increasing

void process(void){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) {
        cin >> A[i];
        maximize(A[i], A[i - 1]);
    }

    memset(dp, 0x3f, sizeof dp);
    dp[0] = 0;
    CHT cht;
    cht.addLine(0, 0);
    FOR(i, 1, nArr){
        dp[i] = cht.query(A[i]) + A[i] * nArr;
        cht.addLine(-i, dp[i]);
    }
    cout << dp[nArr];
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9564 KB Output is correct
2 Correct 1 ms 9564 KB Output is correct
3 Correct 1 ms 9692 KB Output is correct
4 Correct 1 ms 9564 KB Output is correct
5 Correct 2 ms 9564 KB Output is correct
6 Correct 2 ms 9564 KB Output is correct
7 Correct 1 ms 9684 KB Output is correct
8 Correct 1 ms 9564 KB Output is correct
9 Correct 1 ms 9564 KB Output is correct
10 Correct 1 ms 9564 KB Output is correct
11 Correct 1 ms 9564 KB Output is correct
12 Correct 1 ms 9564 KB Output is correct
13 Correct 2 ms 9560 KB Output is correct
14 Correct 1 ms 9564 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 1 ms 9564 KB Output is correct
4 Correct 2 ms 9564 KB Output is correct
5 Correct 1 ms 9600 KB Output is correct
6 Correct 1 ms 9564 KB Output is correct
7 Correct 1 ms 9564 KB Output is correct
8 Correct 2 ms 9572 KB Output is correct
9 Correct 1 ms 9564 KB Output is correct
10 Correct 2 ms 9560 KB Output is correct
11 Correct 1 ms 9564 KB Output is correct
12 Correct 1 ms 9564 KB Output is correct
13 Correct 1 ms 9564 KB Output is correct
14 Correct 1 ms 9564 KB Output is correct
15 Correct 1 ms 9564 KB Output is correct
16 Correct 54 ms 16016 KB Output is correct
17 Correct 55 ms 15956 KB Output is correct
18 Correct 62 ms 15952 KB Output is correct
19 Correct 56 ms 16012 KB Output is correct
20 Correct 55 ms 16008 KB Output is correct
21 Correct 56 ms 15956 KB Output is correct
22 Correct 55 ms 16008 KB Output is correct
23 Correct 59 ms 15952 KB Output is correct
24 Correct 56 ms 15956 KB Output is correct
25 Correct 68 ms 15952 KB Output is correct
26 Correct 59 ms 16008 KB Output is correct
27 Correct 53 ms 16100 KB Output is correct
28 Correct 55 ms 15956 KB Output is correct
29 Correct 57 ms 15952 KB Output is correct
30 Correct 67 ms 16004 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15952 KB Output is correct
2 Correct 71 ms 15956 KB Output is correct
3 Correct 67 ms 15952 KB Output is correct
4 Correct 64 ms 16092 KB Output is correct
5 Correct 61 ms 15952 KB Output is correct
6 Correct 61 ms 15952 KB Output is correct
7 Correct 64 ms 16004 KB Output is correct
8 Correct 62 ms 15992 KB Output is correct
9 Correct 66 ms 15960 KB Output is correct
10 Correct 64 ms 15960 KB Output is correct

Subtask #5
14.0 / 14.0

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

Subtask #6
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9564 KB Output is correct
2 Correct 1 ms 9564 KB Output is correct
3 Correct 1 ms 9692 KB Output is correct
4 Correct 1 ms 9564 KB Output is correct
5 Correct 2 ms 9564 KB Output is correct
6 Correct 2 ms 9564 KB Output is correct
7 Correct 1 ms 9684 KB Output is correct
8 Correct 1 ms 9564 KB Output is correct
9 Correct 1 ms 9564 KB Output is correct
10 Correct 1 ms 9564 KB Output is correct
11 Correct 1 ms 9564 KB Output is correct
12 Correct 1 ms 9564 KB Output is correct
13 Correct 2 ms 9560 KB Output is correct
14 Correct 1 ms 9564 KB Output is correct
15 Correct 2 ms 9564 KB Output is correct
16 Correct 2 ms 9564 KB Output is correct
17 Correct 1 ms 9564 KB Output is correct
18 Correct 2 ms 9564 KB Output is correct
19 Correct 1 ms 9600 KB Output is correct
20 Correct 1 ms 9564 KB Output is correct
21 Correct 1 ms 9564 KB Output is correct
22 Correct 2 ms 9572 KB Output is correct
23 Correct 1 ms 9564 KB Output is correct
24 Correct 2 ms 9560 KB Output is correct
25 Correct 1 ms 9564 KB Output is correct
26 Correct 1 ms 9564 KB Output is correct
27 Correct 1 ms 9564 KB Output is correct
28 Correct 1 ms 9564 KB Output is correct
29 Correct 1 ms 9564 KB Output is correct
30 Correct 54 ms 16016 KB Output is correct
31 Correct 55 ms 15956 KB Output is correct
32 Correct 62 ms 15952 KB Output is correct
33 Correct 56 ms 16012 KB Output is correct
34 Correct 55 ms 16008 KB Output is correct
35 Correct 56 ms 15956 KB Output is correct
36 Correct 55 ms 16008 KB Output is correct
37 Correct 59 ms 15952 KB Output is correct
38 Correct 56 ms 15956 KB Output is correct
39 Correct 68 ms 15952 KB Output is correct
40 Correct 59 ms 16008 KB Output is correct
41 Correct 53 ms 16100 KB Output is correct
42 Correct 55 ms 15956 KB Output is correct
43 Correct 57 ms 15952 KB Output is correct
44 Correct 67 ms 16004 KB Output is correct
45 Correct 63 ms 15952 KB Output is correct
46 Correct 71 ms 15956 KB Output is correct
47 Correct 67 ms 15952 KB Output is correct
48 Correct 64 ms 16092 KB Output is correct
49 Correct 61 ms 15952 KB Output is correct
50 Correct 61 ms 15952 KB Output is correct
51 Correct 64 ms 16004 KB Output is correct
52 Correct 62 ms 15992 KB Output is correct
53 Correct 66 ms 15960 KB Output is correct
54 Correct 64 ms 15960 KB Output is correct
55 Correct 2 ms 9560 KB Output is correct
56 Correct 2 ms 9564 KB Output is correct
57 Correct 1 ms 9564 KB Output is correct
58 Correct 1 ms 9564 KB Output is correct
59 Correct 1 ms 9564 KB Output is correct
60 Correct 2 ms 9564 KB Output is correct
61 Correct 1 ms 9564 KB Output is correct
62 Correct 1 ms 9564 KB Output is correct
63 Correct 1 ms 9564 KB Output is correct
64 Correct 1 ms 9564 KB Output is correct
65 Correct 1 ms 9564 KB Output is correct
66 Correct 1 ms 9564 KB Output is correct
67 Correct 1 ms 9564 KB Output is correct
68 Correct 1 ms 9560 KB Output is correct
69 Correct 2 ms 9564 KB Output is correct
70 Correct 1 ms 9676 KB Output is correct
71 Correct 1 ms 9564 KB Output is correct
72 Correct 1 ms 9564 KB Output is correct
73 Correct 1 ms 9564 KB Output is correct
74 Correct 1 ms 9564 KB Output is correct
75 Correct 1 ms 9564 KB Output is correct
76 Correct 56 ms 16096 KB Output is correct
77 Correct 53 ms 15952 KB Output is correct
78 Correct 52 ms 16008 KB Output is correct
79 Correct 53 ms 15952 KB Output is correct
80 Correct 56 ms 15956 KB Output is correct
81 Correct 52 ms 16012 KB Output is correct
82 Correct 51 ms 15956 KB Output is correct
83 Correct 57 ms 15964 KB Output is correct
84 Correct 53 ms 15956 KB Output is correct
85 Correct 54 ms 15952 KB Output is correct
86 Correct 51 ms 15952 KB Output is correct
87 Correct 53 ms 15952 KB Output is correct
88 Correct 53 ms 15960 KB Output is correct
89 Correct 57 ms 15956 KB Output is correct
90 Correct 65 ms 15996 KB Output is correct
91 Correct 50 ms 16016 KB Output is correct
92 Correct 63 ms 15952 KB Output is correct
93 Correct 55 ms 15996 KB Output is correct
94 Correct 73 ms 15952 KB Output is correct
95 Correct 60 ms 15956 KB Output is correct
96 Correct 51 ms 15956 KB Output is correct
97 Correct 51 ms 16000 KB Output is correct
98 Correct 51 ms 15956 KB Output is correct
99 Correct 67 ms 16008 KB Output is correct
100 Correct 50 ms 15952 KB Output is correct