oj.uz

답안 #671475

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671475 2022-12-13T05:48:35 Z smartmonky 금 캐기 (IZhO14_divide) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
  
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
 
const int N = 100001;
int f[N],s[N], pos[N];
int n;
main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
		int a, b, c;
		cin >> a >>b >> c;
		pos[i] = a;
		f[i] = b + f[i - 1];
		s[i] = c + s[i - 1];
	}
	int ans = 0;
	for(int i = 1; i <= n; i++){
		int l = i, r = n + 1;
		while(l <= r){
			int mid = (l + r) >> 1;
			if(s[mid] - s[i - 1] >= abs(pos[i] - pos[mid])){
				ans = max(ans, f[r] - f[i - 1]);
				l = mid + 1;
			}else
				r = mid - 1;
		}
		if(s[r] - s[i - 1] >= abs(pos[i] - pos[r]))
		ans = max(ans, f[r] - f[i - 1]);
		//cout << l <<" ";
	}
	//ans = max(get(n,n).g, ans);
	cout << ans;
}

Compilation message

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

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -