Submission #887088

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
887088	2023-12-13T17:22:46 Z	BBart888	Art Exhibition (JOI18_art)	C++14	100 / 100	154 ms	34828 KB

#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <queue>
#include <stack>
#include <cassert>
#include <cstring>
#include <climits>
#include <functional>
#include<cstdlib>
//#include "arc.h"
//#include "dreaming.h"


using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long LL;



const int MAXN = 5e5 + 11; 
using ll = long long;
const ll mod1 = 1e9 + 7;
const ll mod2 = 1000000021;
const ll P = 31;



/*
void setIO(string name = "") {
	cin.tie(0)->sync_with_stdio(0); // see /general/fast-io
	if ((name.size())) {
		freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output
		freopen((name + ".out").c_str(), "w", stdout);
	}
}
*/


int n;
vector<pair<ll, ll>> vp;
vector<ll> arr;
ll mn;
ll sum;


int main()
{
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(false);
	//setIO("time");
	
	
	cin >> n;


	for (int i = 1; i <= n; i++)
	{
		ll a, b;
		cin >> a >> b;
		vp.push_back({ a,b });
	}


	sort(vp.begin(), vp.end());


	for (int i = 0; i < n; i++)
	{
		if (i > 0)
		{
			arr.push_back(-(vp[i].first - vp[i-1].first));
		}
		arr.push_back(vp[i].second);
	}

	ll ans = 0;

	for (int i = 0; i < arr.size(); i++)
	{
		if (sum < 0)
			sum = 0;
		sum += arr[i];
		ans = max(ans, sum);
	}

	cout << ans << '\n';












	return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:88:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |  for (int i = 0; i < arr.size(); i++)
      |                  ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	452 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	412 KB	Output is correct
9	Correct	0 ms	456 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	452 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	412 KB	Output is correct
9	Correct	0 ms	456 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	600 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	2 ms	860 KB	Output is correct
29	Correct	2 ms	860 KB	Output is correct
30	Correct	2 ms	856 KB	Output is correct
31	Correct	2 ms	860 KB	Output is correct
32	Correct	2 ms	860 KB	Output is correct
33	Correct	2 ms	860 KB	Output is correct
34	Correct	2 ms	860 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	904 KB	Output is correct
37	Correct	2 ms	860 KB	Output is correct
38	Correct	2 ms	860 KB	Output is correct
39	Correct	2 ms	860 KB	Output is correct
40	Correct	2 ms	860 KB	Output is correct
41	Correct	2 ms	860 KB	Output is correct
42	Correct	2 ms	860 KB	Output is correct
43	Correct	2 ms	860 KB	Output is correct
44	Correct	2 ms	860 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	860 KB	Output is correct
47	Correct	2 ms	860 KB	Output is correct
48	Correct	2 ms	860 KB	Output is correct
49	Correct	2 ms	856 KB	Output is correct
50	Correct	2 ms	860 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	135 ms	33720 KB	Output is correct
53	Correct	135 ms	33976 KB	Output is correct
54	Correct	137 ms	32952 KB	Output is correct
55	Correct	134 ms	33608 KB	Output is correct
56	Correct	133 ms	34228 KB	Output is correct
57	Correct	136 ms	34828 KB	Output is correct
58	Correct	133 ms	34220 KB	Output is correct
59	Correct	134 ms	34556 KB	Output is correct
60	Correct	154 ms	33476 KB	Output is correct
61	Correct	136 ms	33460 KB	Output is correct
62	Correct	139 ms	33976 KB	Output is correct
63	Correct	142 ms	34484 KB	Output is correct
64	Correct	138 ms	33944 KB	Output is correct
65	Correct	136 ms	33464 KB	Output is correct
66	Correct	136 ms	33540 KB	Output is correct
67	Correct	137 ms	33848 KB	Output is correct
68	Correct	138 ms	33464 KB	Output is correct

Submission #887088

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