oj.uz

Submission #685393

# Submission time Handle Problem Language Result Execution time Memory
685393 2023-01-24T09:32:55 Z GudStonks Divide and conquer (IZhO14_divide) C++17
48 / 100
 1000 ms 2784 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ft first
#define sd second
const ll MOD = 1e9+7;
ll n;
vector<pair<ll, pair<ll, ll> > >q;

void fun(){
	cin>>n;
	for(int i = 1, a, b, c; i <= n; i++){
		cin>>a>>b>>c;
		q.push_back({a, {c, b}});
	}
	ll ans = 0;
	for(int i = 0; i < n; i++){
		ll dist = 0, ch = q[i].sd.ft, sum = q[i].sd.sd;
		ans = max(ans, q[i].sd.sd);
		for(int j = i + 1; j < n; j++){
			dist += q[j].ft - q[j - 1].ft;
			ch += q[j].sd.ft;
			sum += q[j].sd.sd;
			if(dist <= ch)
				ans = max(ans, sum);
		}
	}
	cout<<ans<<endl;
}
int  main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int ttt = 1;
	//cin>>ttt;
	while(ttt--)fun();
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 276 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 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 276 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 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 12 ms 708 KB Output is correct
24 Correct 12 ms 724 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 276 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 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 12 ms 708 KB Output is correct
24 Correct 12 ms 724 KB Output is correct
25 Correct 16 ms 596 KB Output is correct
26 Correct 60 ms 916 KB Output is correct
27 Correct 58 ms 1036 KB Output is correct
28 Execution timed out 1069 ms 2784 KB Time limit exceeded
29 Halted 0 ms 0 KB -