oj.uz

Submission #37772

# Submission time Handle Problem Language Result Execution time Memory
37772 2017-12-28T05:32:05 Z Just_Solve_The_Problem Divide and conquer (IZhO14_divide) C++11
17 / 100
 69 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];

main () {
    int n; scanf ("%d", &n);
    ll ans = 0;
    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];
    }
    int l = 1;
    int r = 1;
    do {
//        cout << l << ' ' << r << endl;
        if (pd[r] - pd[l - 1] >= x[r] - x[l]) {
            ans = max(ans, pg[r] - pg[l - 1]);
            if (l > 1 && pd[r] - pd[l - 2] >= x[r] - x[l - 1]) {
                l--;
            } else {
                if (r == n) {
                    break;
                }
                r++;
            }
        } else {
            l++;
        }
        r = min(r, n);
        l = min(l, r + 1);
    } while (r != n || l != n);
    cout << ans;
}

Compilation message

divide.cpp:12:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
divide.cpp: In function 'int main()':
divide.cpp:13:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int n; scanf ("%d", &n);
                            ^
divide.cpp:16: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

# Verdict Execution time Memory 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
0 / 31.0

# Verdict Execution time Memory 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 -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5920 KB Output is correct
2 Correct 0 ms 5920 KB Output is correct
3 Correct 3 ms 5920 KB Output is correct
4 Correct 19 ms 5920 KB Output is correct
5 Correct 26 ms 5920 KB Output is correct
6 Correct 69 ms 5920 KB Output is correct
7 Correct 39 ms 5920 KB Output is correct
8 Correct 43 ms 5920 KB Output is correct
9 Correct 43 ms 5920 KB Output is correct
10 Incorrect 29 ms 5920 KB Output isn't correct
11 Halted 0 ms 0 KB -