답안 #284232

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284232	2020-08-27T04:34:21 Z	송준혁(#5749)	Discharging (NOI20_discharging)	C++17	72 / 100	205 ms	8824 KB

Discharging

#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 (b.se-a.se)*(b.fi-c.fi) <= (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 && CH[p].fi*x+CH[p].se > 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 && CH[p].fi*x+CH[p].se > 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

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

#	결과	실행 시간	메모리	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	416 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	384 KB	Output is correct
4	Correct	1 ms	416 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	131 ms	8184 KB	Output is correct
17	Correct	134 ms	8696 KB	Output is correct
18	Correct	121 ms	8712 KB	Output is correct
19	Correct	132 ms	8696 KB	Output is correct
20	Correct	134 ms	8696 KB	Output is correct
21	Correct	132 ms	8696 KB	Output is correct
22	Correct	129 ms	8696 KB	Output is correct
23	Correct	140 ms	8696 KB	Output is correct
24	Correct	141 ms	8696 KB	Output is correct
25	Correct	135 ms	8696 KB	Output is correct
26	Correct	146 ms	8696 KB	Output is correct
27	Correct	135 ms	8696 KB	Output is correct
28	Correct	137 ms	8696 KB	Output is correct
29	Correct	156 ms	8696 KB	Output is correct
30	Correct	197 ms	8696 KB	Output is correct

Subtask #4
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	168 ms	8168 KB	Output is correct
2	Correct	168 ms	8184 KB	Output is correct
3	Correct	163 ms	8188 KB	Output is correct
4	Correct	169 ms	8184 KB	Output is correct
5	Correct	205 ms	8184 KB	Output is correct
6	Correct	169 ms	8184 KB	Output is correct
7	Correct	168 ms	8184 KB	Output is correct
8	Correct	164 ms	8184 KB	Output is correct
9	Correct	174 ms	8184 KB	Output is correct
10	Correct	168 ms	8184 KB	Output is correct

Subtask #5
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 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	416 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	1 ms	384 KB	Output is correct
41	Correct	1 ms	288 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
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 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	416 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	131 ms	8184 KB	Output is correct
31	Correct	134 ms	8696 KB	Output is correct
32	Correct	121 ms	8712 KB	Output is correct
33	Correct	132 ms	8696 KB	Output is correct
34	Correct	134 ms	8696 KB	Output is correct
35	Correct	132 ms	8696 KB	Output is correct
36	Correct	129 ms	8696 KB	Output is correct
37	Correct	140 ms	8696 KB	Output is correct
38	Correct	141 ms	8696 KB	Output is correct
39	Correct	135 ms	8696 KB	Output is correct
40	Correct	146 ms	8696 KB	Output is correct
41	Correct	135 ms	8696 KB	Output is correct
42	Correct	137 ms	8696 KB	Output is correct
43	Correct	156 ms	8696 KB	Output is correct
44	Correct	197 ms	8696 KB	Output is correct
45	Correct	168 ms	8168 KB	Output is correct
46	Correct	168 ms	8184 KB	Output is correct
47	Correct	163 ms	8188 KB	Output is correct
48	Correct	169 ms	8184 KB	Output is correct
49	Correct	205 ms	8184 KB	Output is correct
50	Correct	169 ms	8184 KB	Output is correct
51	Correct	168 ms	8184 KB	Output is correct
52	Correct	164 ms	8184 KB	Output is correct
53	Correct	174 ms	8184 KB	Output is correct
54	Correct	168 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	1 ms	384 KB	Output is correct
66	Correct	1 ms	288 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	152 ms	8696 KB	Output is correct
77	Incorrect	154 ms	8824 KB	Output isn't correct
78	Halted	0 ms	0 KB	-

답안 #284232

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 13.0 / 13.0

Subtask #3 25.0 / 25.0

Subtask #4 11.0 / 11.0

Subtask #5 14.0 / 14.0

Subtask #6 0 / 28.0

Subtask #1
9.0 / 9.0

Subtask #2
13.0 / 13.0

Subtask #3
25.0 / 25.0

Subtask #4
11.0 / 11.0

Subtask #5
14.0 / 14.0

Subtask #6
0 / 28.0