oj.uz

답안 #270444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
270444 2020-08-17T15:37:51 Z doowey Discharging (NOI20_discharging) C++14
100 / 100
 203 ms 14840 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

struct Line{
    ld ai;
    ld bi;
    ld ti;
};

ld intersect(Line t1, Line t2){
    return (t2.bi-t1.bi)/(t1.ai-t2.ai);
}

vector<Line> hull;

void add_line(Line nw){
    while(hull.size() >= 2 && intersect(hull[hull.size() - 2], nw) <= intersect(hull[hull.size() - 2],hull[hull.size() - 1])){
        hull.pop_back();
    }
    if(!hull.empty())
        hull.back().ti = intersect(hull.back(), nw);
    hull.push_back(nw);
}

ll get(ll x){
    int li = 0, ri = hull.size() - 1;
    int mid;
    while(li < ri){
        mid = (li + ri) / 2;
        if(hull[mid].ti < x)
            li = mid + 1;
        else
            ri = mid;
    }
    return hull[li].ai * x + hull[li].bi;
}

const int N = (int)1e6 + 10;
ll dp[N];

int main(){
    fastIO;
    int n;
    cin >> n;
    ll a, x=0ll;
    add_line({-n,0,(ll)1e18});
    ll vl;
    for(int i = 1; i <= n; i ++ ){
        cin >> a;
        x = max(x, a);
        vl = get(x);
        dp[i]=-vl;
        add_line({-(n-i), -dp[i], (ll)1e18});
    }
    cout << dp[n] << "\n";
    return 0;
}

Compilation message

Discharging.cpp: In function 'int main()':
Discharging.cpp:56:15: warning: narrowing conversion of '- n' from 'int' to 'ld' {aka 'long double'} [-Wnarrowing]
   56 |     add_line({-n,0,(ll)1e18});
      |               ^~
Discharging.cpp:63:19: warning: narrowing conversion of '-(n - i)' from 'int' to 'ld' {aka 'long double'} [-Wnarrowing]
   63 |         add_line({-(n-i), -dp[i], (ll)1e18});
      |                   ^~~~~~
Discharging.cpp:63:27: warning: narrowing conversion of '- dp[i]' from 'll' {aka 'long long int'} to 'ld' {aka 'long double'} [-Wnarrowing]
   63 |         add_line({-(n-i), -dp[i], (ll)1e18});
      |                           ^~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 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 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 0 ms 384 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 416 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 384 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 416 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 384 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 173 ms 8184 KB Output is correct
17 Correct 172 ms 8148 KB Output is correct
18 Correct 164 ms 12536 KB Output is correct
19 Correct 200 ms 13944 KB Output is correct
20 Correct 198 ms 13816 KB Output is correct
21 Correct 178 ms 13944 KB Output is correct
22 Correct 176 ms 13560 KB Output is correct
23 Correct 181 ms 14604 KB Output is correct
24 Correct 180 ms 14152 KB Output is correct
25 Correct 183 ms 14456 KB Output is correct
26 Correct 183 ms 14840 KB Output is correct
27 Correct 190 ms 13272 KB Output is correct
28 Correct 193 ms 14072 KB Output is correct
29 Correct 181 ms 14284 KB Output is correct
30 Correct 192 ms 14584 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 8184 KB Output is correct
2 Correct 195 ms 8116 KB Output is correct
3 Correct 169 ms 8184 KB Output is correct
4 Correct 168 ms 8184 KB Output is correct
5 Correct 192 ms 8184 KB Output is correct
6 Correct 174 ms 8184 KB Output is correct
7 Correct 176 ms 8108 KB Output is correct
8 Correct 177 ms 8184 KB Output is correct
9 Correct 177 ms 8196 KB Output is correct
10 Correct 172 ms 8184 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 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 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 0 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 416 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 384 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 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 0 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 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 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 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 0 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 416 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 384 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 173 ms 8184 KB Output is correct
31 Correct 172 ms 8148 KB Output is correct
32 Correct 164 ms 12536 KB Output is correct
33 Correct 200 ms 13944 KB Output is correct
34 Correct 198 ms 13816 KB Output is correct
35 Correct 178 ms 13944 KB Output is correct
36 Correct 176 ms 13560 KB Output is correct
37 Correct 181 ms 14604 KB Output is correct
38 Correct 180 ms 14152 KB Output is correct
39 Correct 183 ms 14456 KB Output is correct
40 Correct 183 ms 14840 KB Output is correct
41 Correct 190 ms 13272 KB Output is correct
42 Correct 193 ms 14072 KB Output is correct
43 Correct 181 ms 14284 KB Output is correct
44 Correct 192 ms 14584 KB Output is correct
45 Correct 168 ms 8184 KB Output is correct
46 Correct 195 ms 8116 KB Output is correct
47 Correct 169 ms 8184 KB Output is correct
48 Correct 168 ms 8184 KB Output is correct
49 Correct 192 ms 8184 KB Output is correct
50 Correct 174 ms 8184 KB Output is correct
51 Correct 176 ms 8108 KB Output is correct
52 Correct 177 ms 8184 KB Output is correct
53 Correct 177 ms 8196 KB Output is correct
54 Correct 172 ms 8184 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 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 0 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 384 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 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 171 ms 14200 KB Output is correct
77 Correct 171 ms 14200 KB Output is correct
78 Correct 184 ms 13592 KB Output is correct
79 Correct 172 ms 13904 KB Output is correct
80 Correct 169 ms 14584 KB Output is correct
81 Correct 178 ms 13688 KB Output is correct
82 Correct 160 ms 13688 KB Output is correct
83 Correct 177 ms 14072 KB Output is correct
84 Correct 175 ms 13944 KB Output is correct
85 Correct 167 ms 14328 KB Output is correct
86 Correct 160 ms 13560 KB Output is correct
87 Correct 164 ms 13500 KB Output is correct
88 Correct 173 ms 13912 KB Output is correct
89 Correct 162 ms 13664 KB Output is correct
90 Correct 178 ms 13560 KB Output is correct
91 Correct 174 ms 13432 KB Output is correct
92 Correct 184 ms 14740 KB Output is correct
93 Correct 180 ms 13944 KB Output is correct
94 Correct 155 ms 13048 KB Output is correct
95 Correct 166 ms 14456 KB Output is correct
96 Correct 164 ms 13432 KB Output is correct
97 Correct 186 ms 13816 KB Output is correct
98 Correct 170 ms 14072 KB Output is correct
99 Correct 162 ms 13632 KB Output is correct
100 Correct 203 ms 13816 KB Output is correct