oj.uz

Submission #37816

# Submission time Handle Problem Language Result Execution time Memory
37816 2017-12-28T07:19:41 Z Just_Solve_The_Problem Divide and conquer (IZhO14_divide) C++11
48 / 100
 1000 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;
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (pg[n] - pg[i - 1] <= ans) continue;
        for (int j = i; j <= n; j++) {
            if (check(i, j)) {
                ans = max(ans, pg[j] - pg[i - 1]);
            }
                cnt++;
        }
        if (cnt > 9e8) break;
    }
    cout << ans;
}

Compilation message

divide.cpp:16:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
divide.cpp: In function 'int main()':
divide.cpp:17: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:19: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
31.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 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 13 ms 5920 KB Output is correct
12 Correct 16 ms 5920 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory 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 19 ms 5920 KB Output is correct
5 Correct 19 ms 5920 KB Output is correct
6 Correct 43 ms 5920 KB Output is correct
7 Correct 43 ms 5920 KB Output is correct
8 Correct 53 ms 5920 KB Output is correct
9 Correct 43 ms 5920 KB Output is correct
10 Execution timed out 1000 ms 5920 KB Execution timed out
11 Halted 0 ms 0 KB -