[BZOJ 3995] [SDOI2015] 道路修建 【线段树维护连通性】

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

inline void Read(int &Num)
{
	char c = getchar();
	bool Neg = false;
	while (c < ‘0‘ || c > ‘9‘)
	{
		if (c == ‘-‘) Neg = true;
		c = getchar();
	}
	Num = c - ‘0‘; c = getchar();
	while (c >= ‘0‘ && c <= ‘9‘)
	{
		Num = Num * 10 + c - ‘0‘;
		c = getchar();
	}
	if (Neg) Num = -Num;
}

inline int gmin(int a, int b) {return a < b ? a : b;}
inline int gmax(int a, int b) {return a > b ? a : b;}

const int MaxN = 60000 + 5, INF = 999999999;
const int Magic[20][5] = {
	{1, 1, 1}, {1, 2, 2}, {1, 3, 3}, {1, 4, 4},
	{1, 5, 5}, {2, 1, 2}, {2, 3, 2}, {2, 5, 4},
	{3, 1, 3}, {3, 3, 3}, {3, 5, 5}, {4, 1, 4},
	{4, 2, 2}, {4, 4, 4}, {5, 1, 5}, {5, 2, 3},
	{5, 4, 5}
};

int n, m;
int A[MaxN][3];

struct ES
{
	int X[6];
} T[MaxN * 4];

ES operator + (ES e1, ES e2)
{
	ES ret;
	for (int i = 1; i <= 5; ++i) ret.X[i] = INF;
	for (int i = 0; i < 17; ++i)
		ret.X[Magic[i][2]] = gmin(ret.X[Magic[i][2]], e1.X[Magic[i][0]] + e2.X[Magic[i][1]]);
	return ret;
}

ES Calc(int s)
{
	ES ret;
	ret.X[1] = A[s][1] + A[s][2];
	ret.X[2] = A[s][1] + A[s][2] + A[s][0] + A[s + 1][0] - gmax(gmax(A[s][1], A[s][2]), gmax(A[s][0], A[s + 1][0]));
	ret.X[3] = A[s + 1][0] + gmin(A[s][1], A[s][2]);
	ret.X[4] = A[s][0] + gmin(A[s][1], A[s][2]);
	ret.X[5] = gmin(A[s][1], A[s][2]);
	return ret;
}

void Build(int x, int s, int t)
{
	if (s == t) 
	{
		T[x] = Calc(s);
		return;
	}
	int m = (s + t) >> 1;
	Build(x << 1, s, m);
	Build(x << 1 | 1, m + 1, t);
	T[x] = T[x << 1] + T[x << 1 | 1];
}

void Change(int x, int s, int t, int Pos)
{
	if (s == t)
	{
		T[x] = Calc(s);
		return;
	}
	int m = (s + t) >> 1;
	if (Pos <= m) Change(x << 1, s, m, Pos);
	else Change(x << 1 | 1, m + 1, t, Pos);
	T[x] = T[x << 1] + T[x << 1 | 1];
}

ES Get(int x, int s, int t, int l, int r)
{
	if (l <= s && r >= t) return T[x];
	int m = (s + t) >> 1;
	ES ret;
	if (r <= m) ret = Get(x << 1, s, m, l, r);
	else if (l >= m + 1) ret = Get(x << 1 | 1, m + 1, t, l, r);
	else ret = Get(x << 1, s, m, l, r) + Get(x << 1 | 1, m + 1, t, l, r);
	return ret;
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n - 1; ++i) Read(A[i][1]);
	for (int i = 1; i <= n - 1; ++i) Read(A[i][2]);
	for (int i = 1; i <= n; ++i) Read(A[i][0]);
	Build(1, 1, n - 1);
	char Str[3];
	ES Ans;
	int x, y, xx, yy, Num, l, r; 
	for (int i = 1; i <= m; ++i)
	{
		scanf("%s", Str);
		if (Str[0] == ‘C‘)
		{
			Read(x); Read(y); Read(xx); Read(yy); Read(Num);
			if (x == xx)
			{
				A[gmin(y, yy)][x] = Num;
				Change(1, 1, n - 1, gmin(y, yy));
			}
			else
			{
				A[y][0] = Num;
				if (y != 1) Change(1, 1, n - 1, y - 1);
				if (y != n) Change(1, 1, n - 1, y);
			}
		}
		else
		{
			Read(l); Read(r);
			if (l == r) printf("%d\n", A[l][0]);
			else
			{
				Ans = Get(1, 1, n - 1, l, r - 1);
				printf("%d\n", Ans.X[2]);
			}
		}
	}
	return 0;
}