Submission #146447

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
146447	2019-08-24T05:10:03 Z	MathStudent2002	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	28920 KB

art

//wait darn

#include<bits/stdc++.h>

using namespace std;

#define x first
#define y second

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

const int MAXN = 1024576;

int N;
art muse[MAXN];
ll cost[MAXN];
ll psum[MAXN];

void input() {
    cin >> N;
    for(int i = 0; i < N; i++) {
        cin >> muse[i].x >> muse[i].y;
    }
    sort(muse, muse+N);
}

void process() {
    cost[0] = 0;
    for(int i = 1; i < N; i++) {
        cost[i] = muse[i].y - (muse[i].x - muse[i-1].x);
        //cout << cost[i] << endl;
    }
    psum[0] = 0;
    for(int i = 1; i < N; i++) {psum[i] = psum[i-1]+cost[i];}
}

void solve() {
    ll ans = 0;
    ll curm = psum[N-1];
    for(int i = N-1; i >= 0; i--) {
        curm = max(curm, psum[i]);
        ans = max(ans, curm-psum[i]+muse[i].y);
    }
    cout << ans << endl;
}

int main() {
    input();
    process();
    solve();
}

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	3 ms	376 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	12 ms	632 KB	Output is correct
28	Correct	12 ms	632 KB	Output is correct
29	Correct	13 ms	632 KB	Output is correct
30	Correct	12 ms	632 KB	Output is correct
31	Correct	12 ms	636 KB	Output is correct
32	Correct	12 ms	632 KB	Output is correct
33	Correct	12 ms	632 KB	Output is correct
34	Correct	12 ms	632 KB	Output is correct
35	Correct	12 ms	636 KB	Output is correct
36	Correct	12 ms	632 KB	Output is correct
37	Correct	13 ms	556 KB	Output is correct
38	Correct	12 ms	632 KB	Output is correct
39	Correct	12 ms	632 KB	Output is correct
40	Correct	12 ms	632 KB	Output is correct
41	Correct	12 ms	632 KB	Output is correct
42	Correct	12 ms	640 KB	Output is correct
43	Correct	12 ms	632 KB	Output is correct
44	Correct	13 ms	632 KB	Output is correct
45	Correct	12 ms	632 KB	Output is correct
46	Correct	12 ms	604 KB	Output is correct
47	Correct	12 ms	604 KB	Output is correct
48	Correct	12 ms	656 KB	Output is correct
49	Correct	12 ms	632 KB	Output is correct
50	Correct	12 ms	632 KB	Output is correct
51	Correct	12 ms	632 KB	Output is correct
52	Correct	976 ms	28788 KB	Output is correct
53	Correct	989 ms	28744 KB	Output is correct
54	Correct	974 ms	28892 KB	Output is correct
55	Correct	971 ms	28716 KB	Output is correct
56	Correct	976 ms	28800 KB	Output is correct
57	Correct	974 ms	28792 KB	Output is correct
58	Correct	986 ms	28920 KB	Output is correct
59	Correct	976 ms	28740 KB	Output is correct
60	Correct	970 ms	28604 KB	Output is correct
61	Correct	991 ms	28792 KB	Output is correct
62	Correct	977 ms	28812 KB	Output is correct
63	Correct	975 ms	28692 KB	Output is correct
64	Correct	972 ms	28864 KB	Output is correct
65	Correct	968 ms	28712 KB	Output is correct
66	Correct	978 ms	28892 KB	Output is correct
67	Execution timed out	1010 ms	28800 KB	Time limit exceeded
68	Halted	0 ms	0 KB	-