Submission #895775

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
895775	2023-12-30T19:26:18 Z	Minbaev	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	20764 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e17 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}
void solve(){
	int n,m,k;
	
	cin>>n;
	
	vector<pii>v;
	
	for(int i = 1;i<=n;i++){
		cin>>m>>k;
		v.pb({m,k});
	}
	
	sort(all(v));
	int ans = -1 * mod;
	for(int i = 0;i<n;i++){
		int sum = 0;
		int mn = mod,mx = -1 * mod;
		for(int j = i;j<n;j++){
			sum += v[j].s;
			umax(mx,v[j].f);
			umin(mn,v[j].f);
			umax(ans,sum - (mx-mn));
		}
	}
	cout<<ans;
	
	
}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	456 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	20 ms	604 KB	Output is correct
28	Correct	20 ms	604 KB	Output is correct
29	Correct	20 ms	804 KB	Output is correct
30	Correct	20 ms	604 KB	Output is correct
31	Correct	20 ms	604 KB	Output is correct
32	Correct	20 ms	604 KB	Output is correct
33	Correct	20 ms	720 KB	Output is correct
34	Correct	20 ms	600 KB	Output is correct
35	Correct	20 ms	604 KB	Output is correct
36	Correct	20 ms	604 KB	Output is correct
37	Correct	20 ms	604 KB	Output is correct
38	Correct	26 ms	860 KB	Output is correct
39	Correct	20 ms	604 KB	Output is correct
40	Correct	20 ms	600 KB	Output is correct
41	Correct	24 ms	604 KB	Output is correct
42	Correct	23 ms	604 KB	Output is correct
43	Correct	20 ms	724 KB	Output is correct
44	Correct	20 ms	604 KB	Output is correct
45	Correct	20 ms	600 KB	Output is correct
46	Correct	20 ms	604 KB	Output is correct
47	Correct	21 ms	772 KB	Output is correct
48	Correct	20 ms	604 KB	Output is correct
49	Correct	20 ms	604 KB	Output is correct
50	Correct	20 ms	604 KB	Output is correct
51	Correct	20 ms	792 KB	Output is correct
52	Execution timed out	1049 ms	20764 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #895775

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0