oj.uz

답안 #37823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
37823 2017-12-28T08:22:19 Z Just_Solve_The_Problem 금 캐기 (IZhO14_divide) C++11
48 / 100
 143 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];
int n;
ll ans = 0;

bool check (int l, int r) {
    return x[r] - x[l] <= pd[r] - pd[l - 1];
}

void slow () {
    for (int i = 1; i <= min(n, 10000); i++) {
        if (pg[n] - pg[i - 1] <= ans) continue;
        for (int j = i; j <= min(n, 10000); j++) {
            if (check(i, j)) {
                ans = max(ans, pg[j] - pg[i - 1]);
            }
        }
    }
}

void fast () {
    int l = 1;
    int r = 1;
    do {
//        cout << l << ' ' << r << endl;
        if (check(l, r)) {
            ans = max(ans, pg[r] - pg[l - 1]);
            if (l > 1 && check(l - 1, r)) {
                l--;
            } else {
                if (r == n) {
                    break;
                }
                r++;
            }
        } else {
            l++;
        }
        r = min(r, n);
        l = min(l, r + 1);
    } while (r != n || l != n);

    l = n;
    r = n;
    do {
        if (check(l, r)) {
            ans = max(ans, pg[r] - pg[l - 1]);
            if (r < n && check(l, r + 1)) {
                r++;
            } else {
                if (l == 1) {
                    break;
                }
                l--;
            }
        } else {
            r--;
        }
        l = max(l, 1);
        r = max(l, r);
    } while (r != 1 || l != 1);
}

main () {
    scanf ("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf ("%lld %lld %lld", x + i, g + i, d + i);
        ans = max(ans, g[i]);
    }
    for (int i = 1; i <= n; i++) {
        pg[i] = pg[i - 1] + g[i];
        pd[i] = pd[i - 1] + d[i];
    }
    slow();
    fast();
    cout << ans;
}

Compilation message

divide.cpp:72:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
divide.cpp: In function 'int main()':
divide.cpp:73:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d", &n);
                     ^
divide.cpp:75:54: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%lld %lld %lld", x + i, g + i, d + i);
                                                      ^

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 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 Correct 0 ms 5920 KB Output is correct
5 Correct 0 ms 5920 KB Output is correct
6 Correct 0 ms 5920 KB Output is correct
7 Correct 0 ms 5920 KB Output is correct
8 Correct 0 ms 5920 KB Output is correct
9 Correct 0 ms 5920 KB Output is correct
10 Correct 0 ms 5920 KB Output is correct
11 Correct 0 ms 5920 KB Output is correct
12 Correct 0 ms 5920 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 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 Correct 0 ms 5920 KB Output is correct
5 Correct 0 ms 5920 KB Output is correct
6 Correct 0 ms 5920 KB Output is correct
7 Correct 0 ms 5920 KB Output is correct
8 Correct 0 ms 5920 KB Output is correct
9 Correct 0 ms 5920 KB Output is correct
10 Correct 3 ms 5920 KB Output is correct
11 Correct 9 ms 5920 KB Output is correct
12 Correct 13 ms 5920 KB Output is correct

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5920 KB Output is correct
2 Correct 3 ms 5920 KB Output is correct
3 Correct 3 ms 5920 KB Output is correct
4 Correct 109 ms 5920 KB Output is correct
5 Correct 106 ms 5920 KB Output is correct
6 Correct 143 ms 5920 KB Output is correct
7 Correct 129 ms 5920 KB Output is correct
8 Correct 126 ms 5920 KB Output is correct
9 Correct 116 ms 5920 KB Output is correct
10 Incorrect 89 ms 5920 KB Output isn't correct
11 Halted 0 ms 0 KB -