Submission #3313588

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
 
#define mod 1000000007
#define FOR(x,to) for(int x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define long long long
inline int rei(){int x;cin>>x;return x;}
inline long rel(){long x;cin>>x;return x;}
inline string res(){string x;cin>>x;return x;}
//------------------------------------------------------- 
long A[200000];
long B[200000];
void Calc(){
	int N = rei()*2;
	int Q = rei();
	for(int i=0;i<N;i++){
		A[i] = rel();
	}
	for(int i=0;i<N;i++){
		B[i] = rel();
	}
	priority_queue<long,vector<long>,greater<long>> Abigger;
	priority_queue<long,vector<long>,greater<long>> Abiggerdelete;
	priority_queue<long,vector<long>,greater<long>> Bbigger;
	priority_queue<long,vector<long>,greater<long>> Bbiggerdelete;
	int Anum = 0;
	int Bnum = 0;
	long sum = A[0] + A[N-1];
	for(int i=1;i<N-1;i++){
		if(A[i] >= B[i]){
			Abigger.push(A[i]-B[i]);
			Anum++;
			sum += A[i];
		}
		else{
			Bbigger.push(B[i]-A[i]);
			Bnum++;
			sum += B[i];
		}
	}
	for(int query=0;query<Q;query++){
		int p = rei()-1;
		if(p == 0 || p == N-1){
			sum -= A[p];
		}
		else{
			if(A[p] >= B[p]){
				sum -= A[p];
				Abiggerdelete.push(A[p]-B[p]);
				Anum--;
			}
			else{
				sum -= B[p];
				Bbiggerdelete.push(B[p]-A[p]);
				Bnum--;
			}
		}
		A[p] = rel();
		B[p] = rel();
		if(p == 0 || p == N-1){
			sum += A[p];
		}
		else{
			if(A[p] >= B[p]){
				Abigger.push(A[p]-B[p]);
				Anum++;
				sum += A[p];
			}
			else{
				Bbigger.push(B[p]-A[p]);
				Bnum++;
				sum += B[p];
			}
		}
		long ans = sum;
		if(Anum % 2){
			while(!Abiggerdelete.empty() && Abigger.top() == Abiggerdelete.top()){
				Abigger.pop();
				Abiggerdelete.pop();
			}
			while(!Bbiggerdelete.empty() && Bbigger.top() == Bbiggerdelete.top()){
				Bbigger.pop();
				Bbiggerdelete.pop();
			}
			ans -= min(Abigger.top(),Bbigger.top());
		}
		cout << ans << endl;
	}
}
int main(int argc,char** argv){
	ios::sync_with_stdio(false), cin.tie(0);
	cout.tie(0); Calc(); return 0;
}

Submission Info

Judge Result