Submission #1240923

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240923		hainam2k9	Sjeckanje (COCI21_sjeckanje)	C++20	0 / 110	0 ms	320 KiB

Main

#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 2e5+5;
const string NAME = "";
struct Node{
    ll l,r,sum[2][2];
}sgt[MAXN<<2];
int n,q,a[MAXN];
inline void Merge(Node& rs, const Node& l, const Node& r){
    for(int i = 0; i<2; ++i)
        for(int j = 0; j<2; ++j)
            rs.sum[i][j]=0;
    rs.l=l.l, rs.r=r.r;
    if(rs.l*rs.r>=0){
        rs.sum[0][0]=l.sum[0][1]+r.sum[1][0];
        rs.sum[0][1]=l.sum[0][1]+r.sum[1][1];
        rs.sum[1][0]=l.sum[1][1]+r.sum[1][0];
        rs.sum[1][1]=l.sum[1][1]+r.sum[1][1];
    }else{
        rs.sum[0][0]=max(l.sum[0][1]+r.sum[0][0],l.sum[0][0]+r.sum[1][0]);
        rs.sum[0][1]=max(l.sum[0][1]+r.sum[0][1],l.sum[0][0]+r.sum[1][1]);
        rs.sum[1][0]=max(l.sum[1][0]+r.sum[1][0],l.sum[1][1]+r.sum[0][0]);
        rs.sum[1][1]=max(l.sum[1][0]+r.sum[1][1],l.sum[1][1]+r.sum[0][1]);
    }
    rs.sum[0][1]=max(rs.sum[0][1],rs.sum[0][0]);
    rs.sum[1][0]=max(rs.sum[1][0],rs.sum[0][0]);
    rs.sum[1][1]=max({rs.sum[1][1],rs.sum[0][1],rs.sum[1][0]});
}
void update(int id, int l, int r, int pos, int val){
    if(pos<l||r<pos||pos>n||pos<2) return;
    if(l==r){
        sgt[id].l=sgt[id].r+=val;
        sgt[id].sum[1][1]=abs(sgt[id].l);
        return;
    }
    int mid=(l+r)>>1;
    update(id<<1,l,mid,pos,val);
    update(id<<1|1,mid+1,r,pos,val);
    Merge(sgt[id],sgt[id<<1],sgt[id<<1|1]);
}
int main()
{
    tt;
    if(fopen((NAME + ".INP").c_str(), "r")) fo;
    cin >> n >> q;
    for(int i = 1; i<=n; ++i){
        cin >> a[i];
        if(i>1) update(1,2,n,i,a[i]-a[i-1]);
    }
    while(q--){
        int l,r,x;
        cin >> l >> r >> x;
        update(1,2,n,l,x), update(1,2,n,r+1,-x);
        cout << sgt[1].sum[1][1] << "\n";
    }
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:3:19: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    3 | #define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
      |            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:61:45: note: in expansion of macro 'fo'
   61 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~
Main.cpp:3:63: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    3 | #define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
      |                                                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:61:45: note: in expansion of macro 'fo'
   61 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~

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