답안 #671503

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671503	2022-12-13T06:08:57 Z	smartmonky	금 캐기 (IZhO14_divide)	C++14	17 / 100	1 ms	340 KB

divide

#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()
#define int long long
using namespace std;
 
const int N = 500001;
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;
		while(l <= r){
			int mid = (l + r) >> 1;
			if(s[mid] - s[i - 1] >= abs(pos[i] - pos[mid])){
				ans = max(ans, f[mid] - f[i - 1]);
				l = mid + 1;
			}else
				r = mid - 1;
		}
		for(int mid = max(i, r - 1); mid <= min(n, r + 2); mid++)
			if(s[mid] - s[i - 1] >= abs(pos[i] - pos[mid])){
				ans = max(ans, f[mid] - f[i - 1]);
			}
	}
	//ans = max(get(n,n).g, ans);
	cout << ans;
}

Compilation message

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

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct

Subtask #2

0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-