답안 #681427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681427	2023-01-13T05:22:27 Z	boykut	금 캐기 (IZhO14_divide)	C++14	48 / 100	1000 ms	2640 KB

divide

#include <bits/stdc++.h>

using namespace std;

const int N = 100100;
int x[N], g[N], e[N];
long long pe[N], pg[N];

int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> g[i] >> e[i];
    pg[i] = pg[i-1]+g[i];
    pe[i] = pe[i-1]+e[i];
  }
  long long ans = 0;
  for (int r = 1; r <= n; r++) {
    for (int l = 1; l <= r; l++) {
      if (x[r]-x[l] <= pe[r]-pe[l-1]) {
        ans = max(ans, pg[r] - pg[l-1]);
      }
    }
  }
  cout << ans << "\n";
  return 0;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	0 ms	308 KB	Output is correct
4	Correct	0 ms	312 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	312 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	3 ms	400 KB	Output is correct
19	Correct	2 ms	320 KB	Output is correct
20	Correct	2 ms	324 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	3 ms	316 KB	Output is correct
23	Correct	13 ms	580 KB	Output is correct
24	Correct	14 ms	576 KB	Output is correct

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	0 ms	308 KB	Output is correct
4	Correct	0 ms	312 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	312 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	3 ms	400 KB	Output is correct
19	Correct	2 ms	320 KB	Output is correct
20	Correct	2 ms	324 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	3 ms	316 KB	Output is correct
23	Correct	13 ms	580 KB	Output is correct
24	Correct	14 ms	576 KB	Output is correct
25	Correct	17 ms	468 KB	Output is correct
26	Correct	62 ms	700 KB	Output is correct
27	Correct	63 ms	764 KB	Output is correct
28	Execution timed out	1082 ms	2640 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-