oj.uz

Submission #255287

# Submission time Handle Problem Language Result Execution time Memory
255287 2020-07-31T17:06:15 Z model_code Discharging (NOI20_discharging) C++17
100 / 100
 192 ms 24452 KB 
#include<bits/stdc++.h>
using namespace std;
typedef tuple<long double, long long,long long>  tp;
bool cmp(tp T1, tp T2, long long grad, long long constant){
	long double m1, c1, m2, c2;
	long double temp;
	tie(temp,m1,c1) = T1;
	tie(temp,m2,c2) = T2;
	return (constant - c2)*(m1 - grad) < (constant - c1)*(m2 - grad);
}
long double intersect(tp T1, tp T2){
	long double m1, c1, m2, c2;
	long double temp;
	tie(temp,m1,c1) = T1;
	tie(temp,m2,c2) = T2;
	return (long double)(c1-c2)/(long double)(m2-m1);
}
inline long long readInt() {
    long long x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar();
	}
    return x;
}
long long solve(int n, vector<long long> T){
	vector<long long> dp;
	deque<tp> convexHull; //intersect, gradient, constant
	long long curMax = 0;
	dp.push_back(0);
	convexHull.push_back(make_tuple(2e9,0ll,0ll));
	long long curDpVal;
	for(int i = 1; i <= n; i++){
		long long curT = T[i];
		if(curT >= curMax){
			curMax = curT;
			while(get<0>(convexHull.front())<(long double)curMax)convexHull.pop_front();
			long double temp;
			long long grad,constant;
			tie(temp, grad, constant) = convexHull.front();
			curDpVal = n*curMax + grad * curMax + constant;
		}
		dp.push_back(curDpVal);
		long long grad = -i;
		long long constant = dp[i];
		while(convexHull.size() >= 2 && cmp(convexHull[convexHull.size()-2],convexHull.back(),grad,constant)){
			convexHull.pop_back();
		}
		tp newLine = make_tuple(2e9,grad,constant);
		get<0>(convexHull.back()) = intersect(convexHull.back(),newLine);
		convexHull.push_back(newLine);
	}
	return dp[n];
}

int main(){
	int n;
	n = readInt();
	vector<long long> T(n+1);
	for(int i = 1; i <= n; i++) T[i]=readInt();
	long long answer = solve(n, T);
	cout << answer;
}

Compilation message

Discharging.cpp: In function 'long long int solve(int, std::vector<long long int>)':
Discharging.cpp:34:12: warning: 'curDpVal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  long long curDpVal;
            ^~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 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 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 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

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 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 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 124 ms 24292 KB Output is correct
17 Correct 129 ms 24292 KB Output is correct
18 Correct 107 ms 24292 KB Output is correct
19 Correct 129 ms 24292 KB Output is correct
20 Correct 124 ms 24292 KB Output is correct
21 Correct 121 ms 24292 KB Output is correct
22 Correct 120 ms 24420 KB Output is correct
23 Correct 138 ms 24292 KB Output is correct
24 Correct 132 ms 24292 KB Output is correct
25 Correct 128 ms 24296 KB Output is correct
26 Correct 143 ms 24352 KB Output is correct
27 Correct 119 ms 24292 KB Output is correct
28 Correct 126 ms 24312 KB Output is correct
29 Correct 153 ms 24308 KB Output is correct
30 Correct 148 ms 24304 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 24312 KB Output is correct
2 Correct 153 ms 24312 KB Output is correct
3 Correct 150 ms 24292 KB Output is correct
4 Correct 155 ms 24308 KB Output is correct
5 Correct 153 ms 24308 KB Output is correct
6 Correct 150 ms 24312 KB Output is correct
7 Correct 165 ms 24304 KB Output is correct
8 Correct 155 ms 24308 KB Output is correct
9 Correct 151 ms 24308 KB Output is correct
10 Correct 155 ms 24312 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 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 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 0 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 0 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 0 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 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 0 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 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 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 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 0 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 124 ms 24292 KB Output is correct
31 Correct 129 ms 24292 KB Output is correct
32 Correct 107 ms 24292 KB Output is correct
33 Correct 129 ms 24292 KB Output is correct
34 Correct 124 ms 24292 KB Output is correct
35 Correct 121 ms 24292 KB Output is correct
36 Correct 120 ms 24420 KB Output is correct
37 Correct 138 ms 24292 KB Output is correct
38 Correct 132 ms 24292 KB Output is correct
39 Correct 128 ms 24296 KB Output is correct
40 Correct 143 ms 24352 KB Output is correct
41 Correct 119 ms 24292 KB Output is correct
42 Correct 126 ms 24312 KB Output is correct
43 Correct 153 ms 24308 KB Output is correct
44 Correct 148 ms 24304 KB Output is correct
45 Correct 192 ms 24312 KB Output is correct
46 Correct 153 ms 24312 KB Output is correct
47 Correct 150 ms 24292 KB Output is correct
48 Correct 155 ms 24308 KB Output is correct
49 Correct 153 ms 24308 KB Output is correct
50 Correct 150 ms 24312 KB Output is correct
51 Correct 165 ms 24304 KB Output is correct
52 Correct 155 ms 24308 KB Output is correct
53 Correct 151 ms 24308 KB Output is correct
54 Correct 155 ms 24312 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 0 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 0 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 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 0 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 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 115 ms 24292 KB Output is correct
77 Correct 110 ms 24312 KB Output is correct
78 Correct 104 ms 24292 KB Output is correct
79 Correct 108 ms 24292 KB Output is correct
80 Correct 134 ms 24320 KB Output is correct
81 Correct 105 ms 24292 KB Output is correct
82 Correct 131 ms 24304 KB Output is correct
83 Correct 117 ms 24292 KB Output is correct
84 Correct 111 ms 24316 KB Output is correct
85 Correct 124 ms 24420 KB Output is correct
86 Correct 102 ms 24420 KB Output is correct
87 Correct 111 ms 24292 KB Output is correct
88 Correct 126 ms 24292 KB Output is correct
89 Correct 151 ms 24292 KB Output is correct
90 Correct 111 ms 24292 KB Output is correct
91 Correct 147 ms 24292 KB Output is correct
92 Correct 135 ms 24272 KB Output is correct
93 Correct 132 ms 24296 KB Output is correct
94 Correct 102 ms 24292 KB Output is correct
95 Correct 118 ms 24292 KB Output is correct
96 Correct 116 ms 24308 KB Output is correct
97 Correct 106 ms 24268 KB Output is correct
98 Correct 112 ms 24292 KB Output is correct
99 Correct 106 ms 24452 KB Output is correct
100 Correct 112 ms 24420 KB Output is correct