# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
37795 | 2017-12-28T06:32:24 Z | Just_Solve_The_Problem | 금 캐기 (IZhO14_divide) | C++11 | 63 ms | 5920 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long const int N = (int)1e5 + 7; ll x[N], g[N], d[N]; ll pg[N], pd[N]; bool check (int l, int r) { return x[r] - x[l] <= pd[r] - pd[l - 1]; } main () { int n; scanf ("%d", &n); for (int i = 1; i <= n; i++) { scanf ("%lld %lld %lld", x + i, g + i, d + i); } for (int i = 1; i <= n; i++) { pg[i] = pg[i - 1] + g[i]; pd[i] = pd[i - 1] + d[i]; } ll ans = 0; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { if (pg[n] - pg[i - 1] <= ans || x[n] - x[i] > pd[n] - pd[i - 1]) break; if (check(i, j)) { ans = max(ans, pg[j] - pg[i - 1]); } } } cout << ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5920 KB | Output is correct |
2 | Correct | 0 ms | 5920 KB | Output is correct |
3 | Correct | 0 ms | 5920 KB | Output is correct |
4 | Incorrect | 0 ms | 5920 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5920 KB | Output is correct |
2 | Correct | 0 ms | 5920 KB | Output is correct |
3 | Incorrect | 0 ms | 5920 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5920 KB | Output is correct |
2 | Correct | 3 ms | 5920 KB | Output is correct |
3 | Correct | 6 ms | 5920 KB | Output is correct |
4 | Correct | 13 ms | 5920 KB | Output is correct |
5 | Correct | 26 ms | 5920 KB | Output is correct |
6 | Correct | 63 ms | 5920 KB | Output is correct |
7 | Correct | 43 ms | 5920 KB | Output is correct |
8 | Correct | 39 ms | 5920 KB | Output is correct |
9 | Correct | 33 ms | 5920 KB | Output is correct |
10 | Incorrect | 39 ms | 5920 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |