Submission #528483

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
528483	2022-02-20T11:01:25 Z	georgerapeanu	Art Exhibition (JOI18_art)	C++11	100 / 100	202 ms	24828 KB

#include <bits/stdc++.h>

using namespace std;

int main(){
  
  int n;

  scanf("%d", &n);

  vector<pair<long long, int> > v(n, {0, 0});
  vector<long long> dp(n, 0);

  for(auto &it:v){
    scanf("%lld %d", &it.first, &it.second);
  }

  sort(v.begin(), v.end());
  
  long long ans = 0;
  for(int i = 0;i < n;i++){
    dp[i] = max(1LL * v[i].second, (i == 0 ? 0LL:v[i].second - (v[i].first - v[i - 1].first) + dp[i - 1]));
    ans = max(ans, dp[i]);
  }
  printf("%lld\n", ans);

  return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
art.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%lld %d", &it.first, &it.second);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	292 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	0 ms	296 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	292 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	0 ms	296 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	2 ms	424 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	2 ms	424 KB	Output is correct
30	Correct	2 ms	424 KB	Output is correct
31	Correct	2 ms	516 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	2 ms	532 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	3 ms	460 KB	Output is correct
36	Correct	3 ms	460 KB	Output is correct
37	Correct	3 ms	436 KB	Output is correct
38	Correct	2 ms	428 KB	Output is correct
39	Correct	3 ms	428 KB	Output is correct
40	Correct	2 ms	432 KB	Output is correct
41	Correct	2 ms	520 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	2 ms	460 KB	Output is correct
44	Correct	2 ms	424 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	2 ms	532 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	2 ms	512 KB	Output is correct
50	Correct	2 ms	528 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	292 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	0 ms	296 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	2 ms	424 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	2 ms	424 KB	Output is correct
30	Correct	2 ms	424 KB	Output is correct
31	Correct	2 ms	516 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	2 ms	532 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	3 ms	460 KB	Output is correct
36	Correct	3 ms	460 KB	Output is correct
37	Correct	3 ms	436 KB	Output is correct
38	Correct	2 ms	428 KB	Output is correct
39	Correct	3 ms	428 KB	Output is correct
40	Correct	2 ms	432 KB	Output is correct
41	Correct	2 ms	520 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	2 ms	460 KB	Output is correct
44	Correct	2 ms	424 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	2 ms	532 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	2 ms	512 KB	Output is correct
50	Correct	2 ms	528 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct
52	Correct	187 ms	24636 KB	Output is correct
53	Correct	174 ms	24816 KB	Output is correct
54	Correct	194 ms	24696 KB	Output is correct
55	Correct	182 ms	24704 KB	Output is correct
56	Correct	171 ms	24692 KB	Output is correct
57	Correct	174 ms	24692 KB	Output is correct
58	Correct	173 ms	24828 KB	Output is correct
59	Correct	171 ms	24796 KB	Output is correct
60	Correct	185 ms	24700 KB	Output is correct
61	Correct	180 ms	24448 KB	Output is correct
62	Correct	171 ms	24700 KB	Output is correct
63	Correct	168 ms	24744 KB	Output is correct
64	Correct	177 ms	24700 KB	Output is correct
65	Correct	174 ms	24696 KB	Output is correct
66	Correct	168 ms	24696 KB	Output is correct
67	Correct	202 ms	24684 KB	Output is correct
68	Correct	178 ms	24700 KB	Output is correct

Submission #528483

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