답안 #344715

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344715	2021-01-06T10:27:56 Z	bachaquer	금 캐기 (IZhO14_divide)	C++14	48 / 100	1000 ms	2540 KB

divide

#include <bits/stdc++.h>
 
#define ll long long
#define pb push_back
 
using namespace std;
 
ll n, x, g, d;
 
int main() {
    cin >> n;
    ll prefd[n], prefg[n], xx[n];
    for (int i = 0; i < n; i++) {
        cin >> x >> g >> d;
        xx[i] = x;
        if (i == 0) {
            prefg[i] = g;
            prefd[i] = d;
        }
        else {
            prefd[i] = prefd[i - 1] + d;
            prefg[i] = prefg[i - 1] + g;
        }
    }
    ll mx = 0;
    for (int i = 0; i < n; i++) {
        for (int j = n - 1; j >= i; j--) {
            if (i == 0){
                if (xx[j] - xx[i] <= prefd[j]) {
                    mx = max(mx, prefg[j]);
                }
            } else if (xx[j] - xx[i] <= prefd[j] - prefd[i - 1]) {
                mx = max(mx, prefg[j] - prefg[i - 1]);
            }
        }
    }
    cout << mx;
    return 0;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 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	368 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	1 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	368 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	372 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	2 ms	364 KB	Output is correct
17	Correct	2 ms	364 KB	Output is correct
18	Correct	3 ms	364 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	5 ms	364 KB	Output is correct
22	Correct	5 ms	364 KB	Output is correct
23	Correct	25 ms	492 KB	Output is correct
24	Correct	25 ms	492 KB	Output is correct

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 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	368 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	372 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	2 ms	364 KB	Output is correct
17	Correct	2 ms	364 KB	Output is correct
18	Correct	3 ms	364 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	5 ms	364 KB	Output is correct
22	Correct	5 ms	364 KB	Output is correct
23	Correct	25 ms	492 KB	Output is correct
24	Correct	25 ms	492 KB	Output is correct
25	Correct	21 ms	492 KB	Output is correct
26	Correct	72 ms	620 KB	Output is correct
27	Correct	77 ms	748 KB	Output is correct
28	Execution timed out	1092 ms	2540 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-