oj.uz

Submission #284234

# Submission time Handle Problem Language Result Execution time Memory
284234 2020-08-27T04:36:32 Z 송준혁(#5749) Discharging (NOI20_discharging) C++17
100 / 100
 204 ms 9208 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<LL,LL> pii;

int N;
LL A[1010101];

bool chk(pii a, pii b, pii c){
	return (__int128)(b.se-a.se)*(b.fi-c.fi) <= (__int128)(c.se-b.se)*(a.fi-b.fi);
}

struct CHT{
	int p=0;
	vector<pii> CH;
	void push(pii l){
		while (CH.size()>1 && chk(l, CH.back(), CH[CH.size()-2])){
			CH.pop_back();
			if (p == CH.size()) p--;
		}
		CH.pb(l);
	}
	LL f(LL x){
		while (p < CH.size()-1 && (__int128)CH[p].fi*x+CH[p].se > (__int128)CH[p+1].fi*x+CH[p+1].se) p++;
		return CH[p].fi*x+CH[p].se;
	}
} D;

int main(){
	scanf("%d", &N);
	for (int i=1; i<=N; i++) scanf("%lld", &A[i]), A[i]=max(A[i], A[i-1]);
	D.push(pii(N, 0));
	for (int i=1; i<N; i++){
		LL r = D.f(A[i]);
		D.push(pii(N-i, r));
	}
	printf("%lld\n", D.f(A[N]));
	return 0;
}

Compilation message

Discharging.cpp: In member function 'void CHT::push(pii)':
Discharging.cpp:22:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |    if (p == CH.size()) p--;
      |        ~~^~~~~~~~~~~~
Discharging.cpp: In member function 'LL CHT::f(LL)':
Discharging.cpp:27:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   while (p < CH.size()-1 && (__int128)CH[p].fi*x+CH[p].se > (__int128)CH[p+1].fi*x+CH[p+1].se) p++;
      |          ~~^~~~~~~~~~~~~
Discharging.cpp: In function 'int main()':
Discharging.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
Discharging.cpp:34:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   34 |  for (int i=1; i<=N; i++) scanf("%lld", &A[i]), A[i]=max(A[i], A[i-1]);
      |                           ~~~~~^~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 384 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 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 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 179 ms 8440 KB Output is correct
17 Correct 204 ms 8568 KB Output is correct
18 Correct 136 ms 8568 KB Output is correct
19 Correct 148 ms 8568 KB Output is correct
20 Correct 150 ms 8568 KB Output is correct
21 Correct 153 ms 8568 KB Output is correct
22 Correct 149 ms 8568 KB Output is correct
23 Correct 167 ms 8560 KB Output is correct
24 Correct 154 ms 8568 KB Output is correct
25 Correct 151 ms 8568 KB Output is correct
26 Correct 161 ms 8568 KB Output is correct
27 Correct 140 ms 8568 KB Output is correct
28 Correct 152 ms 8568 KB Output is correct
29 Correct 149 ms 8548 KB Output is correct
30 Correct 165 ms 8568 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 8440 KB Output is correct
2 Correct 197 ms 8368 KB Output is correct
3 Correct 173 ms 8440 KB Output is correct
4 Correct 173 ms 8440 KB Output is correct
5 Correct 173 ms 8568 KB Output is correct
6 Correct 176 ms 8364 KB Output is correct
7 Correct 172 ms 8444 KB Output is correct
8 Correct 179 ms 8440 KB Output is correct
9 Correct 186 ms 8440 KB Output is correct
10 Correct 204 ms 8424 KB Output is correct

Subtask #5
14.0 / 14.0

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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 384 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 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 179 ms 8440 KB Output is correct
31 Correct 204 ms 8568 KB Output is correct
32 Correct 136 ms 8568 KB Output is correct
33 Correct 148 ms 8568 KB Output is correct
34 Correct 150 ms 8568 KB Output is correct
35 Correct 153 ms 8568 KB Output is correct
36 Correct 149 ms 8568 KB Output is correct
37 Correct 167 ms 8560 KB Output is correct
38 Correct 154 ms 8568 KB Output is correct
39 Correct 151 ms 8568 KB Output is correct
40 Correct 161 ms 8568 KB Output is correct
41 Correct 140 ms 8568 KB Output is correct
42 Correct 152 ms 8568 KB Output is correct
43 Correct 149 ms 8548 KB Output is correct
44 Correct 165 ms 8568 KB Output is correct
45 Correct 176 ms 8440 KB Output is correct
46 Correct 197 ms 8368 KB Output is correct
47 Correct 173 ms 8440 KB Output is correct
48 Correct 173 ms 8440 KB Output is correct
49 Correct 173 ms 8568 KB Output is correct
50 Correct 176 ms 8364 KB Output is correct
51 Correct 172 ms 8444 KB Output is correct
52 Correct 179 ms 8440 KB Output is correct
53 Correct 186 ms 8440 KB Output is correct
54 Correct 204 ms 8424 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 512 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 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 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 170 ms 8544 KB Output is correct
77 Correct 173 ms 8568 KB Output is correct
78 Correct 157 ms 8952 KB Output is correct
79 Correct 161 ms 8952 KB Output is correct
80 Correct 167 ms 8908 KB Output is correct
81 Correct 160 ms 8952 KB Output is correct
82 Correct 159 ms 8952 KB Output is correct
83 Correct 165 ms 8952 KB Output is correct
84 Correct 165 ms 8952 KB Output is correct
85 Correct 164 ms 8984 KB Output is correct
86 Correct 160 ms 8956 KB Output is correct
87 Correct 156 ms 8952 KB Output is correct
88 Correct 169 ms 8952 KB Output is correct
89 Correct 163 ms 8952 KB Output is correct
90 Correct 167 ms 8952 KB Output is correct
91 Correct 157 ms 8952 KB Output is correct
92 Correct 162 ms 8952 KB Output is correct
93 Correct 156 ms 8952 KB Output is correct
94 Correct 155 ms 8960 KB Output is correct
95 Correct 169 ms 8952 KB Output is correct
96 Correct 177 ms 9208 KB Output is correct
97 Correct 162 ms 8952 KB Output is correct
98 Correct 166 ms 9080 KB Output is correct
99 Correct 161 ms 8952 KB Output is correct
100 Correct 162 ms 8952 KB Output is correct