oj.uz

Submission #80967

# Submission time Handle Problem Language Result Execution time Memory
80967 2018-10-23T10:08:08 Z farukkastamonuda Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 4540 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define lo long long 
#define inf 1000000000
#define md 1000000007
#define li 100005
#define mp make_pair
#define pb push_back
using namespace std;
int n,beg;
lo int x[li], g[li], d[li];
lo int cev, sume[li], sumg[li];
bool check(int val){
	if(x[val] - x[beg] <= sume[val] - sume[beg - 1]) return true;
	return false;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	//scanf("%d", &n);
	cin>>n;
	for(int i = 1; i <= n; i ++){
		//scanf("%lld %lld %lld", &x[i], &g[i], &d[i]);
		cin>>x[i]>>g[i]>>d[i];
		sume[i] = sume[i - 1] + d[i];
		sumg[i] = sumg[i - 1] + g[i]; 
	}
	for(int i = 1; i <= n; i ++){
		int bas = i, son = n;
		while(bas <= son){
			int mid = (bas + son) / 2;
			beg = i;
			if(check(mid)) bas = mid + 1;
			else son = son - 1;
		}
		cev = max(cev, sumg[son] - sumg[i - 1]);
	}
	//printf("%lld\n", cev);
	cout<<cev<<endl;
	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 2 ms 696 KB Output is correct
7 Correct 2 ms 712 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 3 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 3 ms 716 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 6 ms 748 KB Output is correct
11 Correct 26 ms 764 KB Output is correct
12 Correct 31 ms 764 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 764 KB Output is correct
2 Correct 5 ms 1020 KB Output is correct
3 Correct 9 ms 1020 KB Output is correct
4 Correct 22 ms 2556 KB Output is correct
5 Correct 25 ms 2556 KB Output is correct
6 Correct 62 ms 4540 KB Output is correct
7 Correct 42 ms 4540 KB Output is correct
8 Correct 40 ms 4540 KB Output is correct
9 Correct 38 ms 4540 KB Output is correct
10 Execution timed out 1077 ms 4540 KB Time limit exceeded
11 Halted 0 ms 0 KB -