oj.uz

Submission #498681

# Submission time Handle Problem Language Result Execution time Memory
498681 2021-12-26T06:32:13 Z Aktan Divide and conquer (IZhO14_divide) C++17
100 / 100
 154 ms 9104 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define ft first
#define sc second
using namespace std;
const int mod=1e9+7,INF=1e17;

int a[100005],b[100005],c[100005],g[100000],pr[100005],d[400005];
void update(int v,int l,int r,int pos,int x){
	if(l==r){
		d[v]=x;
		return;
	}
	int m=(l+r)>>1;
	if(pos<=m){
		update((v<<1),l,m,pos,x);
	}
	else{
		update((v<<1)+1,m+1,r,pos,x);
	}
	d[v]=max(d[v<<1],d[(v<<1)+1]);
}
int fun(int v,int l,int r,int x){
	if(l==r){
		return l;
	}
	int m=(l+r)>>1;
	if(d[(v<<1)+1]>=x)return fun((v<<1)+1,m+1,r,x);
	return fun((v<<1),l,m,x);
}
main(){
   int n;
   cin >> n;
   for(int i=1;i<=n;i++){
   	cin >> a[i] >> b[i] >> c[i];
   	pr[i]+=pr[i-1]+c[i];
   	g[i]+=g[i-1]+b[i];
   	update(1,1,n,i,pr[i]-a[i]);
   }
   int ans=0;
   for(int i=1;i<=n;i++){
   	int j=fun(1,1,n,pr[i-1]-a[i]);
   	ans=max(ans,g[j]-g[i-1]);
   }
   cout << ans;
}

Compilation message

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

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 440 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 7 ms 752 KB Output is correct
24 Correct 9 ms 692 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 440 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 7 ms 752 KB Output is correct
24 Correct 9 ms 692 KB Output is correct
25 Correct 5 ms 716 KB Output is correct
26 Correct 9 ms 1072 KB Output is correct
27 Correct 15 ms 1100 KB Output is correct
28 Correct 57 ms 4184 KB Output is correct
29 Correct 98 ms 4504 KB Output is correct
30 Correct 147 ms 9104 KB Output is correct
31 Correct 114 ms 7952 KB Output is correct
32 Correct 141 ms 8048 KB Output is correct
33 Correct 96 ms 7796 KB Output is correct
34 Correct 99 ms 7876 KB Output is correct
35 Correct 122 ms 8268 KB Output is correct
36 Correct 154 ms 8516 KB Output is correct