Submission #91876

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
91876	2018-12-30T20:40:03 Z	Alisabzi	Art Exhibition (JOI18_art)	C++14	100 / 100	217 ms	21100 KB

#include<bits/stdc++.h>
using namespace std ;
#define F first 
#define S second
typedef long long ll ;
const ll N = 5000011 ;
pair<ll,int> P[N] ;
int n ;
ll a , b, ans;
int main ()
{
	scanf("%d", &n) ;
	for(int i = 1 ; i <= n ; i ++){
		scanf("%lld%lld", &a, &b) ;
		P[i].F = a, P[i].S = b; 
	}
	sort(P+1, P+n+1) ;
	ans = a = P[1].S ;
	b = 0 ;
	for(int i = 2 ; i <= n ; i ++){
		b = max(a+P[i].S-(P[i].F-P[i-1].F), (ll)P[i].S) ; 
		ans = max(ans, b) ;
		a = b ;
	}
	printf("%lld", ans) ;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n) ;
  ~~~~~^~~~~~~~~~
art.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &a, &b) ;
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	292 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	4 ms	504 KB	Output is correct
28	Correct	4 ms	504 KB	Output is correct
29	Correct	4 ms	504 KB	Output is correct
30	Correct	4 ms	504 KB	Output is correct
31	Correct	4 ms	504 KB	Output is correct
32	Correct	4 ms	504 KB	Output is correct
33	Correct	4 ms	504 KB	Output is correct
34	Correct	4 ms	504 KB	Output is correct
35	Correct	3 ms	504 KB	Output is correct
36	Correct	4 ms	504 KB	Output is correct
37	Correct	4 ms	504 KB	Output is correct
38	Correct	4 ms	504 KB	Output is correct
39	Correct	3 ms	504 KB	Output is correct
40	Correct	4 ms	504 KB	Output is correct
41	Correct	3 ms	504 KB	Output is correct
42	Correct	4 ms	504 KB	Output is correct
43	Correct	4 ms	504 KB	Output is correct
44	Correct	4 ms	504 KB	Output is correct
45	Correct	3 ms	504 KB	Output is correct
46	Correct	3 ms	504 KB	Output is correct
47	Correct	4 ms	504 KB	Output is correct
48	Correct	4 ms	504 KB	Output is correct
49	Correct	3 ms	504 KB	Output is correct
50	Correct	3 ms	504 KB	Output is correct
51	Correct	4 ms	504 KB	Output is correct
52	Correct	215 ms	20728 KB	Output is correct
53	Correct	213 ms	20856 KB	Output is correct
54	Correct	214 ms	20920 KB	Output is correct
55	Correct	213 ms	20904 KB	Output is correct
56	Correct	217 ms	20892 KB	Output is correct
57	Correct	211 ms	20900 KB	Output is correct
58	Correct	212 ms	20848 KB	Output is correct
59	Correct	210 ms	20856 KB	Output is correct
60	Correct	215 ms	20996 KB	Output is correct
61	Correct	214 ms	20704 KB	Output is correct
62	Correct	211 ms	20856 KB	Output is correct
63	Correct	214 ms	21004 KB	Output is correct
64	Correct	212 ms	20788 KB	Output is correct
65	Correct	214 ms	20856 KB	Output is correct
66	Correct	215 ms	21100 KB	Output is correct
67	Correct	210 ms	20984 KB	Output is correct
68	Correct	208 ms	20828 KB	Output is correct

Submission #91876

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