Submission #1857082

---

Source Code Expand

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=1e9+7;
const llint big=1e15+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
int main(void){
	int i,n,q;cin>>n>>q;
	llint gen=0,gu=0;
	vector<llint>a(2*n);for(auto &it:a){cin>>it;}
	vector<llint>b(2*n);for(auto &it:b){cin>>it;}
	multiset<int>aki;
	gen=a[0]+a[2*n-1];
	for(i=1;i<2*n-1;i++){
		gen+=max(a[i],b[i]);
		aki.ins(abs(a[i]-b[i]));
		if(a[i]>b[i]){gu++;}
	}
	while(q--){
		int p,x,y;cin>>p>>x>>y;p--;
		if(p==0||p==2*n-1){gen-=a[p];a[p]=x;b[p]=y;gen+=a[p];}
		else{
			if(a[p]>b[p]){gu++;}
			aki.erase(aki.lower_bound(abs(a[p]-b[p])));
			gen-=max(a[p],b[p]);
			a[p]=x;b[p]=y;
			if(a[p]>b[p]){gu++;}
			aki.ins(abs(a[p]-b[p]));
			gen+=max(a[p],b[p]);
		}
		if(gu%2==0){cout<<gen<<endl;}
		else{cout<<gen-(*aki.begin())<<endl;}
	}
	return 0;
}

Submission Info

Judge Result