oj.uz

Submission #681616

# Submission time Handle Problem Language Result Execution time Memory
681616 2023-01-13T13:08:56 Z iskhakkutbilim Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 2252 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()



main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
//   ifstream cin("divide.in");
//   ofstream cout("divide.out");
	int n; cin >> n;
	int x[n], g[n], d[n];
	for(int i = 0;i < n; i++){
		cin >> x[i] >> g[i] >> d[i];
	}
	int gold[n], energy[n]; gold[0] = g[0], energy[0] = d[0];
	for(int i = 1;i < n; i++){
		gold[i] = gold[i-1] + g[i];
		energy[i] = energy[i-1]+d[i];
	}
	int answer = 0;
	function<int(int, int)> check=[&](int i, int j){
		if(i > j) swap(i, j);
		int s_g = gold[j] - (i > 0 ? gold[i-1] : 0);
		int s_e = energy[j] - (i > 0 ? energy[i-1] : 0);
		if(s_e >= x[j]-x[i]){
			answer = max(answer, s_g);
			return 1;
		}
		return 0;
	};
	for(int j = n-1; j >= 0; j--){
		answer = max(answer, g[j]);
		for(int i = 0;i < j; i++){
			check(i, j);
		}
//		int l = 0, r = j, cnt = 0;
//		if(check(0,j)) continue;
//		while(l + 1 < r){
//			if(cnt > 30) break;
//			cnt++;
//			int mid = (l + r)>>1;
//			if(check(mid, j)){
//				r = mid;
//			}else l = mid;
//		}
	}
	cout << answer;
	return 0;
}

Compilation message

divide.cpp:11:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   11 | main(){
      | ^~~~

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 284 KB Output is correct
3 Correct 0 ms 212 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 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 0 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 284 KB Output is correct
3 Correct 0 ms 212 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 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 400 KB Output is correct
22 Correct 8 ms 400 KB Output is correct
23 Correct 45 ms 596 KB Output is correct
24 Correct 46 ms 596 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 284 KB Output is correct
3 Correct 0 ms 212 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 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 400 KB Output is correct
22 Correct 8 ms 400 KB Output is correct
23 Correct 45 ms 596 KB Output is correct
24 Correct 46 ms 596 KB Output is correct
25 Correct 71 ms 468 KB Output is correct
26 Correct 277 ms 808 KB Output is correct
27 Correct 277 ms 844 KB Output is correct
28 Execution timed out 1072 ms 2252 KB Time limit exceeded
29 Halted 0 ms 0 KB -