답안 #525369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525369	2022-02-11T13:38:41 Z	Dilshod_Imomov	금 캐기 (IZhO14_divide)	C++17	48 / 100	1000 ms	2496 KB

divide

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second

using namespace std;

const int N = 1e5 + 7;
const int mod = 1e9 + 7;
// const int INF = 1e18;

int x[N], g[N], d[N];

int32_t main() {
   speed;
   int n;
   cin >> n;
   for ( int i = 1; i <= n; i++ ) {
      cin >> x[i] >> g[i] >> d[i];
      d[i] += d[i - 1];
   }
   int mx = 0;
   for ( int i = 1; i <= n; i++ ) {
      int sum = 0;
      for ( int j = i; j <= n; j++ ) {
         sum += g[j];
         if ( d[j] - d[i - 1] >= x[j] - x[i] ) {
            mx = max( mx, sum );
         }
      }
   }
   cout << mx;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

31.0 / 31.0

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

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	360 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	2 ms	324 KB	Output is correct
22	Correct	3 ms	332 KB	Output is correct
23	Correct	11 ms	556 KB	Output is correct
24	Correct	13 ms	560 KB	Output is correct
25	Correct	15 ms	508 KB	Output is correct
26	Correct	53 ms	660 KB	Output is correct
27	Correct	55 ms	732 KB	Output is correct
28	Execution timed out	1020 ms	2496 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-