oj.uz

Submission #395044

# Submission time Handle Problem Language Result Execution time Memory
395044 2021-04-27T16:30:25 Z rocks03 Sjeckanje (COCI21_sjeckanje) C++14
15 / 110
 2000 ms 716 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int N, Q;
vector<ll> a;

void update(int l, int r, ll k){
    rep(i, l, r + 1) a[i] += k;
}

vector<ll> memo;
ll f(int i){
    if(i == N) return 0;
    ll& ans = memo[i];
    if(ans != -1) return ans;
    ans = f(i + 1);
    ll mn = a[i], mx = a[i];
    rep(j, i + 1, N){
        mn = min(mn, a[j]); mx = max(mx, a[j]);
        ans = max(ans, mx - mn + f(j + 1));
    }
    return ans;
}

void solve(){
    cin >> N >> Q;
    a = vector<ll>(N);
    rep(i, 0, N) cin >> a[i];
    rep(q, 0, Q){
        int l, r; ll k;
        cin >> l >> r >> k;
        --l, --r;
        update(l, r, k);
        memo = vector<ll>(N, -1);
        cout << f(0) << "\n";
    }
}
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 332 KB Output is correct
2 Correct 34 ms 332 KB Output is correct
3 Correct 31 ms 332 KB Output is correct
4 Correct 32 ms 332 KB Output is correct
5 Correct 33 ms 340 KB Output is correct
6 Correct 32 ms 332 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 332 KB Output is correct
2 Correct 34 ms 332 KB Output is correct
3 Correct 31 ms 332 KB Output is correct
4 Correct 32 ms 332 KB Output is correct
5 Correct 33 ms 340 KB Output is correct
6 Correct 32 ms 332 KB Output is correct
7 Execution timed out 2078 ms 716 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 332 KB Output is correct
2 Correct 34 ms 332 KB Output is correct
3 Correct 31 ms 332 KB Output is correct
4 Correct 32 ms 332 KB Output is correct
5 Correct 33 ms 340 KB Output is correct
6 Correct 32 ms 332 KB Output is correct
7 Execution timed out 2078 ms 716 KB Time limit exceeded
8 Halted 0 ms 0 KB -