Submission #418468

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
418468	2021-06-05T11:42:55 Z	_Avocado_	Art Exhibition (JOI18_art)	C++14	100 / 100	238 ms	22488 KB

    #include <bits/stdc++.h>
    #include <iostream>
    using namespace std;
    #define int int64_t
     
    signed main(){
    	ios_base::sync_with_stdio(false);
    	cin.tie(NULL);
    	int n; cin>>n;
    	
    	vector<pair<int, int>>v;
    	
    	for(int i = 0; i<n; ++i){
    		int a, b; cin>>a>>b;
    		v.push_back({a, b});
    	}
    	
    	sort(v.begin(), v.end());
    	
    	vector<int>prefix(n);
    	
    	prefix[0] = v[0].second;
    	
    	for(int i = 1; i<n; ++i) prefix[i] = prefix[i-1] + v[i].second;
    	
    	vector<int>ans(n);
    	
    	for(int i = 1; i<n; ++i){
    		int cur = prefix[i] - (v[i].first - v[0].first);
    		ans[i] = cur;
  
    	}
    	
    	vector<int>suffix(n);
    	
    	suffix[n-1] = ans[n-1];
    	
    	for(int i = n-2; i>=0; --i){
			suffix[i] = max(suffix[i+1], ans[i]);
		}
		/*
		for(auto u: suffix) cout<<u<<" ";
		cout<<endl;
		*/
		
		int out = suffix[0];
    	
    	for(int i = 1; i<n-1; ++i){
    		int diff = (v[i].first - v[0].first) - prefix[i-1];
    		out = max(out, suffix[i] + diff);
    		//if(diff > 0) ans += diff;
    	}
    	
    	for(int i = 0; i<n; ++i) out = max(out, v[i].second);
    	
    	cout<<out;
    	
    	
    	cout<<'\n';
    }

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	204 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	1 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	204 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	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 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	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	316 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	204 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	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 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	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	316 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	3 ms	588 KB	Output is correct
28	Correct	3 ms	588 KB	Output is correct
29	Correct	3 ms	556 KB	Output is correct
30	Correct	3 ms	580 KB	Output is correct
31	Correct	3 ms	588 KB	Output is correct
32	Correct	3 ms	588 KB	Output is correct
33	Correct	3 ms	584 KB	Output is correct
34	Correct	3 ms	588 KB	Output is correct
35	Correct	3 ms	588 KB	Output is correct
36	Correct	3 ms	588 KB	Output is correct
37	Correct	3 ms	588 KB	Output is correct
38	Correct	3 ms	588 KB	Output is correct
39	Correct	3 ms	580 KB	Output is correct
40	Correct	3 ms	588 KB	Output is correct
41	Correct	3 ms	588 KB	Output is correct
42	Correct	3 ms	588 KB	Output is correct
43	Correct	3 ms	588 KB	Output is correct
44	Correct	3 ms	588 KB	Output is correct
45	Correct	3 ms	588 KB	Output is correct
46	Correct	3 ms	588 KB	Output is correct
47	Correct	3 ms	548 KB	Output is correct
48	Correct	3 ms	588 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	3 ms	588 KB	Output is correct
51	Correct	3 ms	588 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	204 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	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 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	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	316 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	3 ms	588 KB	Output is correct
28	Correct	3 ms	588 KB	Output is correct
29	Correct	3 ms	556 KB	Output is correct
30	Correct	3 ms	580 KB	Output is correct
31	Correct	3 ms	588 KB	Output is correct
32	Correct	3 ms	588 KB	Output is correct
33	Correct	3 ms	584 KB	Output is correct
34	Correct	3 ms	588 KB	Output is correct
35	Correct	3 ms	588 KB	Output is correct
36	Correct	3 ms	588 KB	Output is correct
37	Correct	3 ms	588 KB	Output is correct
38	Correct	3 ms	588 KB	Output is correct
39	Correct	3 ms	580 KB	Output is correct
40	Correct	3 ms	588 KB	Output is correct
41	Correct	3 ms	588 KB	Output is correct
42	Correct	3 ms	588 KB	Output is correct
43	Correct	3 ms	588 KB	Output is correct
44	Correct	3 ms	588 KB	Output is correct
45	Correct	3 ms	588 KB	Output is correct
46	Correct	3 ms	588 KB	Output is correct
47	Correct	3 ms	548 KB	Output is correct
48	Correct	3 ms	588 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	3 ms	588 KB	Output is correct
51	Correct	3 ms	588 KB	Output is correct
52	Correct	222 ms	22312 KB	Output is correct
53	Correct	226 ms	22384 KB	Output is correct
54	Correct	229 ms	22392 KB	Output is correct
55	Correct	223 ms	22364 KB	Output is correct
56	Correct	238 ms	22408 KB	Output is correct
57	Correct	225 ms	22452 KB	Output is correct
58	Correct	222 ms	22436 KB	Output is correct
59	Correct	226 ms	22396 KB	Output is correct
60	Correct	222 ms	22476 KB	Output is correct
61	Correct	228 ms	22436 KB	Output is correct
62	Correct	224 ms	22384 KB	Output is correct
63	Correct	221 ms	22436 KB	Output is correct
64	Correct	227 ms	22488 KB	Output is correct
65	Correct	220 ms	22380 KB	Output is correct
66	Correct	224 ms	22400 KB	Output is correct
67	Correct	223 ms	22388 KB	Output is correct
68	Correct	223 ms	22424 KB	Output is correct

Submission #418468

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0