oj.uz

Submission #985513

# Submission time Handle Problem Language Result Execution time Memory
985513 2024-05-18T02:36:37 Z blackavar Sjeckanje (COCI21_sjeckanje) C++14
55 / 110
 2000 ms 13332 KB 
#include <bits/stdc++.h>
using namespace std;

long long n, a[1000005], d[1000005], q, dp[1000005];

struct Node{

};

void build(long long id, long long l, long long r) {

}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i < n; i++) d[i] = a[i] - a[i + 1];
    dp[0] = 0;
    while (q--) {
        long long l, r, x;
        cin >> l >> r >> x;
        d[l - 1] -= x;
        d[r] += x;
        d[0] = d[1];
        for (int i = 1; i < n; i++) {
            if (d[i] * d[i - 1] > 0) dp[i] = dp[i - 1] + abs(d[i]);
            else dp[i] = max(dp[i - 1], dp[i - 2] + abs(d[i]));
        }
        cout << dp[n - 1] << "\n";
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4568 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4568 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 16 ms 4700 KB Output is correct
8 Correct 16 ms 4700 KB Output is correct
9 Correct 18 ms 4680 KB Output is correct
10 Correct 16 ms 4700 KB Output is correct
11 Correct 16 ms 4708 KB Output is correct
12 Correct 18 ms 4700 KB Output is correct

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4568 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 16 ms 4700 KB Output is correct
8 Correct 16 ms 4700 KB Output is correct
9 Correct 18 ms 4680 KB Output is correct
10 Correct 16 ms 4700 KB Output is correct
11 Correct 16 ms 4708 KB Output is correct
12 Correct 18 ms 4700 KB Output is correct
13 Execution timed out 2035 ms 13332 KB Time limit exceeded
14 Halted 0 ms 0 KB -