Submission #465911

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
465911	2021-08-17T10:07:14 Z	dattranxxx	Art Exhibition (JOI18_art)	C++11	100 / 100	260 ms	24812 KB

art

/*
 * Author :  shora
 */
#include <bits/stdc++.h>
#define print(_v) for (auto &_ : _v) {cerr << _ << ' ';} cerr << endl;
using namespace std;
using ll = long long;
const ll oo = 1e18;
const int N = 5e5;
struct P {
	int v = 0;
	ll w = 0, f = 0;
	bool operator < (const P& p) {
		return w < p.w;
	}
};
P a[N+1];
int n;
int main() {
  cin.tie(0)->sync_with_stdio(0); cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i)
  	cin >> a[i].w >> a[i].v;
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; ++i)
		a[i].f = a[i-1].f + a[i].v;
	ll res = -oo, mx = -oo; 
	// a[r].f - a[l-1].f - a[r].w + a[l].w
	// a[r].f - a[r].w + (a[l].w - a[l-1].f)
	for (int r = 1; r <= n; ++r) {
		mx = max(mx, a[r].w - a[r-1].f);
		res = max(res, a[r].f - a[r].w + mx);
	}
	cout << res;
  return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:22:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   22 |   for (int i = 1; i <= n; ++i)
      |   ^~~
art.cpp:24:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   24 |  sort(a + 1, a + n + 1);
      |  ^~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	4 ms	460 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	3 ms	460 KB	Output is correct
32	Correct	3 ms	460 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	3 ms	460 KB	Output is correct
35	Correct	2 ms	456 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	460 KB	Output is correct
40	Correct	2 ms	460 KB	Output is correct
41	Correct	3 ms	460 KB	Output is correct
42	Correct	3 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	3 ms	460 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	3 ms	444 KB	Output is correct
50	Correct	3 ms	568 KB	Output is correct
51	Correct	3 ms	460 KB	Output is correct

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	4 ms	460 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	3 ms	460 KB	Output is correct
32	Correct	3 ms	460 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	3 ms	460 KB	Output is correct
35	Correct	2 ms	456 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	460 KB	Output is correct
40	Correct	2 ms	460 KB	Output is correct
41	Correct	3 ms	460 KB	Output is correct
42	Correct	3 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	3 ms	460 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	3 ms	444 KB	Output is correct
50	Correct	3 ms	568 KB	Output is correct
51	Correct	3 ms	460 KB	Output is correct
52	Correct	221 ms	24572 KB	Output is correct
53	Correct	246 ms	24652 KB	Output is correct
54	Correct	209 ms	24812 KB	Output is correct
55	Correct	249 ms	24744 KB	Output is correct
56	Correct	203 ms	24636 KB	Output is correct
57	Correct	208 ms	24672 KB	Output is correct
58	Correct	235 ms	24700 KB	Output is correct
59	Correct	207 ms	24612 KB	Output is correct
60	Correct	214 ms	24792 KB	Output is correct
61	Correct	211 ms	24576 KB	Output is correct
62	Correct	208 ms	24656 KB	Output is correct
63	Correct	206 ms	24736 KB	Output is correct
64	Correct	213 ms	24748 KB	Output is correct
65	Correct	260 ms	24600 KB	Output is correct
66	Correct	211 ms	24712 KB	Output is correct
67	Correct	209 ms	24792 KB	Output is correct
68	Correct	210 ms	24704 KB	Output is correct