oj.uz

Submission #680928

# Submission time Handle Problem Language Result Execution time Memory
680928 2023-01-12T03:46:19 Z oblantis Divide and conquer (IZhO14_divide) C++17
100 / 100
 56 ms 10968 KB 
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 2e9;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 12;
void solve() {
	int n;
	cin >> n;
	ll ans = 0;
	pair<ll, pll> p[n];
	for(int i = 0; i < n; i++) {
		cin >> p[i].ff >> p[i].ss.ff >> p[i].ss.ss;
		ans = max(ans, p[i].ss.ff);
	}
	sort(p, p + n);
	set<pll> s;
	s.insert({p[0].ff, 0});
	ll t = p[0].ff;
	for(int i = 1; i < n; i++) {
		p[i].ss.ss += p[i - 1].ss.ss;
		p[i].ss.ff += p[i - 1].ss.ff;
		ll x = p[i].ff - p[i].ss.ss;
		auto j = s.lower_bound({x, 0});
		if(j != s.end()) {
			ans = max(ans, p[i].ss.ff - (*j).ss);
		}
		if(t < p[i].ff - p[i - 1].ss.ss)s.insert({p[i].ff - p[i - 1].ss.ss, p[i - 1].ss.ff}), t = p[i].ff - p[i - 1].ss.ss;
	}
	cout << ans;
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int tcs = 1;
	//cin >> tcs;
	for(int i = 1; i <= tcs; i++) {
		solve();
	}
	return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 3 ms 852 KB Output is correct
24 Correct 3 ms 844 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 3 ms 852 KB Output is correct
24 Correct 3 ms 844 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 4 ms 596 KB Output is correct
27 Correct 3 ms 664 KB Output is correct
28 Correct 13 ms 2388 KB Output is correct
29 Correct 17 ms 2764 KB Output is correct
30 Correct 29 ms 5448 KB Output is correct
31 Correct 25 ms 4308 KB Output is correct
32 Correct 28 ms 4444 KB Output is correct
33 Correct 24 ms 4168 KB Output is correct
34 Correct 45 ms 7476 KB Output is correct
35 Correct 55 ms 10968 KB Output is correct
36 Correct 56 ms 10824 KB Output is correct