Submission #265627

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
265627	2020-08-15T04:07:05 Z	Marlov	Art Exhibition (JOI18_art)	C++14	100 / 100	261 ms	24864 KB

/*
Code by @marlov       
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
using namespace std;
typedef long long ll;
typedef pair<long long,long long> pi;

#define maxN 500000

long long N;
pair<long long,long long> arr[maxN];
long long dp[maxN];
long long result=0;

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>N;
	for(long long i=0;i<N;i++){
		cin>>arr[i].first>>arr[i].second;
	}
	sort(arr,arr+N);
	dp[0]=arr[0].second;
	for(int i=1;i<N;i++){
		dp[i]=arr[i].second+max((long long)0,dp[i-1]-arr[i].first+arr[i-1].first);
	}
	for(int i=0;i<N;i++){
		result=max(dp[i],result);
	}
	cout<<result<<'\n';
    return 0;
}

/* stuff you should look for
	* long long overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	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	512 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	288 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	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	512 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	288 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 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	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 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	416 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	396 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	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	512 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	288 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 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	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 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	416 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	396 KB	Output is correct
27	Correct	3 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	3 ms	640 KB	Output is correct
31	Correct	3 ms	640 KB	Output is correct
32	Correct	3 ms	640 KB	Output is correct
33	Correct	3 ms	640 KB	Output is correct
34	Correct	2 ms	640 KB	Output is correct
35	Correct	2 ms	640 KB	Output is correct
36	Correct	2 ms	640 KB	Output is correct
37	Correct	3 ms	640 KB	Output is correct
38	Correct	2 ms	640 KB	Output is correct
39	Correct	2 ms	640 KB	Output is correct
40	Correct	3 ms	640 KB	Output is correct
41	Correct	2 ms	640 KB	Output is correct
42	Correct	4 ms	640 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	4 ms	640 KB	Output is correct
45	Correct	3 ms	640 KB	Output is correct
46	Correct	2 ms	640 KB	Output is correct
47	Correct	2 ms	640 KB	Output is correct
48	Correct	2 ms	640 KB	Output is correct
49	Correct	2 ms	640 KB	Output is correct
50	Correct	2 ms	640 KB	Output is correct
51	Correct	3 ms	640 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	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	512 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	288 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 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	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 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	416 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	396 KB	Output is correct
27	Correct	3 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	3 ms	640 KB	Output is correct
31	Correct	3 ms	640 KB	Output is correct
32	Correct	3 ms	640 KB	Output is correct
33	Correct	3 ms	640 KB	Output is correct
34	Correct	2 ms	640 KB	Output is correct
35	Correct	2 ms	640 KB	Output is correct
36	Correct	2 ms	640 KB	Output is correct
37	Correct	3 ms	640 KB	Output is correct
38	Correct	2 ms	640 KB	Output is correct
39	Correct	2 ms	640 KB	Output is correct
40	Correct	3 ms	640 KB	Output is correct
41	Correct	2 ms	640 KB	Output is correct
42	Correct	4 ms	640 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	4 ms	640 KB	Output is correct
45	Correct	3 ms	640 KB	Output is correct
46	Correct	2 ms	640 KB	Output is correct
47	Correct	2 ms	640 KB	Output is correct
48	Correct	2 ms	640 KB	Output is correct
49	Correct	2 ms	640 KB	Output is correct
50	Correct	2 ms	640 KB	Output is correct
51	Correct	3 ms	640 KB	Output is correct
52	Correct	231 ms	24652 KB	Output is correct
53	Correct	238 ms	24696 KB	Output is correct
54	Correct	204 ms	24696 KB	Output is correct
55	Correct	205 ms	24696 KB	Output is correct
56	Correct	261 ms	24696 KB	Output is correct
57	Correct	222 ms	24680 KB	Output is correct
58	Correct	208 ms	24704 KB	Output is correct
59	Correct	207 ms	24696 KB	Output is correct
60	Correct	240 ms	24712 KB	Output is correct
61	Correct	215 ms	24568 KB	Output is correct
62	Correct	241 ms	24800 KB	Output is correct
63	Correct	228 ms	24864 KB	Output is correct
64	Correct	206 ms	24824 KB	Output is correct
65	Correct	209 ms	24828 KB	Output is correct
66	Correct	223 ms	24696 KB	Output is correct
67	Correct	214 ms	24696 KB	Output is correct
68	Correct	200 ms	24696 KB	Output is correct

Submission #265627

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