Submission #395051

#TimeUsernameProblemLanguageResultExecution timeMemory
395051rocks03Sjeckanje (COCI21_sjeckanje)C++14
0 / 110
1 ms332 KiB
#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; } ll get(){ ll ans = 0; int i = 0; while(i < N){ int j = i; while(j < N && a[i] == a[j]) j++; if(j == N) break; ans += abs(a[i] - a[j]); i = 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); cout << get() << "\n"; } } int main(){ ios_base::sync_with_stdio(false), cin.tie(nullptr); solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...