oj.uz

Submission #988804

# Submission time Handle Problem Language Result Execution time Memory
988804 2024-05-26T09:21:46 Z Muhammet Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 500005
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

ll T, n, b[N], mx[N];

pair <ll,ll> a[N];

int main(){
	ios::sync_with_stdio(false); cin.tie(0);

	cin >> n;

	ll s = 0;
	for(int i = 1; i <= n; i++){
		cin >> a[i].ff >> a[i].ss;
		s += a[i].ss;
	}

	sort(a+1,a+n+1);

	ll ans = (s - (a[n].ff - a[1].ff));

	for(int i = n; i >= 1; i--){
		b[i] = b[i+1];
		b[i] -= a[i].ss;
		b[i] += (a[i].ff - a[i-1].ff);
		mx[i] = max(mx[i+1], b[i]);
	}

	ll x = 0, k = max(0ll,mx[1]);
	for(int i = 1; i <= n; i++){
		x -= a[i].ss;
		x += (a[i+1].ff - a[i].ff - 1);
		k = max(k,x + mx[i+1]);
	}
	cout << ans + k << '\n';

	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -