답안 #344576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344576	2021-01-06T06:09:07 Z	mansur	금 캐기 (IZhO14_divide)	C++14	48 / 100	1000 ms	1260 KB

divide

#include<bits/stdc++.h>
using namespace std;

#define all(a) a.begin(),a.end()
#define ll long long
#define pb push_back
#define nl '\n'
#define popb pop_back()
#define sz size()
#define ld long double
#define ull unsigned long long
#define F first
#define S second
#define fix fixed<<setprecision
#define pii pair<int,int>
#define E exit (0)
#define int1 long long
const int inf=1e9;
int n,x[100001],g[100001],d[100001];
int main() {
	//freopen("planting.in","r",stdin);
	//freopen("planting.out","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for (int i=1;i<=n;i++) {
	 	cin>>x[i]>>g[i]>>d[i];
	}
	ll mx=0;
	for (int i=1;i<=n;i++) {
		ll gold=0,energy=0;
		for (int j=i;j<=n;j++) {
			energy+=d[j];
			gold+=g[j];
			if (x[j]-x[i]<=energy) {
				mx=max(mx,gold);
			}
		}
	}
	cout<<mx;
}
                                	

Subtask #1

17.0 / 17.0

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

Subtask #2

31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	2 ms	364 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	3 ms	364 KB	Output is correct
22	Correct	4 ms	364 KB	Output is correct
23	Correct	22 ms	364 KB	Output is correct
24	Correct	21 ms	364 KB	Output is correct

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	2 ms	364 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	3 ms	364 KB	Output is correct
22	Correct	4 ms	364 KB	Output is correct
23	Correct	22 ms	364 KB	Output is correct
24	Correct	21 ms	364 KB	Output is correct
25	Correct	24 ms	364 KB	Output is correct
26	Correct	79 ms	492 KB	Output is correct
27	Correct	84 ms	748 KB	Output is correct
28	Execution timed out	1072 ms	1260 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-