제출 #434777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434777		leaked	Sjeckanje (COCI21_sjeckanje)	C++14	0 / 110	1 ms	204 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define f first
#define s second
#define endl '\n'
#define vec vector
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define m_p make_pair
#define sz(x) (int)x.size()
#define pw(x) (1LL<<x)

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

auto rng=bind(uniform_int_distribution<int>(0,25),mt19937(time(0)));

template<class T>bool umin(T &a,const T &b) {return (a>b?a=b,1:0);}
template<class T>bool umax(T &a,const T &b) {return (a<b?a=b,1:0);}

template<class T> using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf=1e18;
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,q;
    cin>>n>>q;
    vec<ll>a(n);
    for(auto &z : a)
        cin>>z;
    while(q--){
        int l,r,x;
        cin>>l>>r>>x;--l;--r;
        for(int i=l;i<=r;i++) a[i]+=x;
        ll last=-inf;
        ll ans=0;
        for(int i=0;i<n;i++){
            if(last==-inf) last=a[i];
            else{
                if(a[i]!=last){
                    ans+=abs(a[i]-last);
                    last=-inf;
                }
            }
        }
        cout<<ans<<endl;
    }
    return  0;
}
/*

*/

• Subtask 1: 0 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 55