Submission #46279

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
46279	2018-04-18T17:26:47 Z	fredbr	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	24080 KB

#include <bits/stdc++.h>

#define ff first
#define ss second

using namespace std;

typedef long long ll;
typedef pair<ll, ll> ii;

const int maxn = 500010;
const ll inf = 0x3f3f3f3f3f3f3f3f;

ll p[maxn];
ii v[maxn];

ll a[maxn];
ll b[maxn];

ll s[maxn];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;

	for (int i = 1; i <= n; i++) cin >> v[i].ff >> v[i].ss;

	sort(v+1, v+1+n);

	for (int i = 1; i <= n; i++) p[i] = p[i-1] + v[i].ss;

	for (int i = 1; i <= n; i++) a[i] = -p[i-1] + v[i].ff;

	for (int i = 1; i <= n; i++) b[i] = p[i]-v[i].ff;

	s[n+1] = -inf;
	for (int i = n; i >= 1; i--) s[i] = max(s[i+1], b[i]);

	ll ans = -inf;

	for (int i = 1; i <= n; i++) {

		for (int j = i; j <= n; j++) {

			ans = max(ans, a[i]+b[j]);
		}
	}


	// for (int i = 1; i <= n; i++) ans = max(ans, a[i]+s[i]);

	cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	564 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	2 ms	648 KB	Output is correct
11	Correct	2 ms	648 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	564 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	2 ms	648 KB	Output is correct
11	Correct	2 ms	648 KB	Output is correct
12	Correct	2 ms	648 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	2 ms	680 KB	Output is correct
17	Correct	2 ms	680 KB	Output is correct
18	Correct	2 ms	680 KB	Output is correct
19	Correct	2 ms	680 KB	Output is correct
20	Correct	2 ms	680 KB	Output is correct
21	Correct	2 ms	680 KB	Output is correct
22	Correct	2 ms	680 KB	Output is correct
23	Correct	2 ms	680 KB	Output is correct
24	Correct	2 ms	680 KB	Output is correct
25	Correct	2 ms	680 KB	Output is correct
26	Correct	2 ms	680 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	564 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	2 ms	648 KB	Output is correct
11	Correct	2 ms	648 KB	Output is correct
12	Correct	2 ms	648 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	2 ms	680 KB	Output is correct
17	Correct	2 ms	680 KB	Output is correct
18	Correct	2 ms	680 KB	Output is correct
19	Correct	2 ms	680 KB	Output is correct
20	Correct	2 ms	680 KB	Output is correct
21	Correct	2 ms	680 KB	Output is correct
22	Correct	2 ms	680 KB	Output is correct
23	Correct	2 ms	680 KB	Output is correct
24	Correct	2 ms	680 KB	Output is correct
25	Correct	2 ms	680 KB	Output is correct
26	Correct	2 ms	680 KB	Output is correct
27	Correct	16 ms	868 KB	Output is correct
28	Correct	15 ms	868 KB	Output is correct
29	Correct	15 ms	868 KB	Output is correct
30	Correct	15 ms	868 KB	Output is correct
31	Correct	16 ms	868 KB	Output is correct
32	Correct	15 ms	992 KB	Output is correct
33	Correct	16 ms	992 KB	Output is correct
34	Correct	17 ms	992 KB	Output is correct
35	Correct	17 ms	992 KB	Output is correct
36	Correct	15 ms	992 KB	Output is correct
37	Correct	16 ms	992 KB	Output is correct
38	Correct	16 ms	992 KB	Output is correct
39	Correct	16 ms	992 KB	Output is correct
40	Correct	16 ms	992 KB	Output is correct
41	Correct	16 ms	992 KB	Output is correct
42	Correct	20 ms	992 KB	Output is correct
43	Correct	16 ms	992 KB	Output is correct
44	Correct	17 ms	992 KB	Output is correct
45	Correct	16 ms	992 KB	Output is correct
46	Correct	16 ms	992 KB	Output is correct
47	Correct	22 ms	992 KB	Output is correct
48	Correct	16 ms	992 KB	Output is correct
49	Correct	16 ms	992 KB	Output is correct
50	Correct	16 ms	992 KB	Output is correct
51	Correct	17 ms	992 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	564 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	2 ms	648 KB	Output is correct
11	Correct	2 ms	648 KB	Output is correct
12	Correct	2 ms	648 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	2 ms	680 KB	Output is correct
17	Correct	2 ms	680 KB	Output is correct
18	Correct	2 ms	680 KB	Output is correct
19	Correct	2 ms	680 KB	Output is correct
20	Correct	2 ms	680 KB	Output is correct
21	Correct	2 ms	680 KB	Output is correct
22	Correct	2 ms	680 KB	Output is correct
23	Correct	2 ms	680 KB	Output is correct
24	Correct	2 ms	680 KB	Output is correct
25	Correct	2 ms	680 KB	Output is correct
26	Correct	2 ms	680 KB	Output is correct
27	Correct	16 ms	868 KB	Output is correct
28	Correct	15 ms	868 KB	Output is correct
29	Correct	15 ms	868 KB	Output is correct
30	Correct	15 ms	868 KB	Output is correct
31	Correct	16 ms	868 KB	Output is correct
32	Correct	15 ms	992 KB	Output is correct
33	Correct	16 ms	992 KB	Output is correct
34	Correct	17 ms	992 KB	Output is correct
35	Correct	17 ms	992 KB	Output is correct
36	Correct	15 ms	992 KB	Output is correct
37	Correct	16 ms	992 KB	Output is correct
38	Correct	16 ms	992 KB	Output is correct
39	Correct	16 ms	992 KB	Output is correct
40	Correct	16 ms	992 KB	Output is correct
41	Correct	16 ms	992 KB	Output is correct
42	Correct	20 ms	992 KB	Output is correct
43	Correct	16 ms	992 KB	Output is correct
44	Correct	17 ms	992 KB	Output is correct
45	Correct	16 ms	992 KB	Output is correct
46	Correct	16 ms	992 KB	Output is correct
47	Correct	22 ms	992 KB	Output is correct
48	Correct	16 ms	992 KB	Output is correct
49	Correct	16 ms	992 KB	Output is correct
50	Correct	16 ms	992 KB	Output is correct
51	Correct	17 ms	992 KB	Output is correct
52	Execution timed out	1083 ms	24080 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #46279

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0