oj.uz

답안 #498491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498491 2021-12-25T10:11:04 Z tmn2005 금 캐기 (IZhO14_divide) C++17
0 / 100
 1 ms 332 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b[N],c[N],t[N*4];
map<int,int>dp,pr;

int get(int v,int l,int r,int x){
	if(l == r)
		ret l;
	int m = l + r >> 1;
	
	if(x >= t[v*2])
		ret get(v*2,l,m,x);
	else
		ret get(v*2+1,m+1,r,x);
}
void build(int v,int l,int r,int i,int x){
	if(l == r)
		t[v] = x;
	else{
		int m = l + r >> 1;
		if(i <= m)
			build(v*2,l,m,i,x);
		else
			build(v*2+1,m+1,r,i,x);
		t[v] = min(t[v*2], t[v*2+1]);
	}
}
main(){
	NeedForSpeed
    cin>>n;
    for(int i=1; i<=n; i++){
    	cin>>a[i]>>b[i]>>c[i];
    	
		dp[i] = dp[i-1] + b[i];
		pr[i] = pr[i-1] + c[i];
		build(1,1,n, i,pr[i-1] - a[i]);
	}
	for(int i=1; i<=n; i++){
		int j = get(1,1,i,pr[i] - a[i]);
		//cout<<j<<" "<<i<<endl;
		res = max(res, dp[i] - dp[j-1]);
	}
	cout<<res;
	
	
	
	
	
	
	
	
	
	
	
	
	
	return 0;
}

Compilation message

divide.cpp: In function 'long long int get(long long int, long long int, long long int, long long int)':
divide.cpp:38:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |  int m = l + r >> 1;
      |          ~~^~~
divide.cpp: In function 'void build(long long int, long long int, long long int, long long int, long long int)':
divide.cpp:49:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |   int m = l + r >> 1;
      |           ~~^~~
divide.cpp: At global scope:
divide.cpp:57:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main(){
      | ^~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 300 KB Output isn't correct
5 Halted 0 ms 0 KB -