Submission #2559084

---

Source Code Expand

// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int N, Q;
 
signed main() {
    cin >> N >> Q;

    int L = 2*N;
    vector<int> A(L), B(L);
    for(int i=0; i<L; i++) cin >> A[i];
    for(int i=0; i<L; i++) cin >> B[i];

    int base = A[0] + A[L-1];
    int asum = accumulate(A.begin(), A.end(), 0LL);

    set< pair<int, int> > S;

    // B - A >= 0 全部取った時の和
    int cur_max = 0;
    for(int i=1; i<L-1; i++) {
        int diff = B[i] - A[i];
        if(diff >= 0) {
            S.insert(make_pair(i, diff));
            cur_max += diff;
        }
    }

    for(int i=0; i<Q; i++) {
        int p, x, y; cin >> p >> x >> y; p--;
        asum -= A[p];

        if(p != 0 && p != L-1) {
            pair<int, int> elem = make_pair(p, B[p] - A[p]);
            if(S.count(elem)) {
                S.erase(elem);
                cur_max -= B[p] - A[p];
            }
        }

        A[p] = x, B[p] = y;
        asum += A[p];

        if(p != 0 && p != L-1) {
            pair<int, int> n_elem = make_pair(p, B[p] - A[p]);
            if(n_elem.second >= 0) {
                S.insert(n_elem);
                cur_max += n_elem.second;
            }
        }

        int sz = S.size(), tmp_max = cur_max;
        for(auto it=S.begin(); it!=S.end(); it++) {
            if(sz % 2 == 0) break;
            sz--;
            tmp_max -= it -> second;
        }

        // printf("asum = %lld, tmp_max = %lld\n", asum, tmp_max);
        cout << asum + tmp_max << endl;
    }
    return 0;
}

Submission Info

Judge Result