SPOJSolutions/MULTQ3.cpp at master · pranavanurag/SPOJSolutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <stdio.h>

using namespace std;

struct Node
{
	int Rem0, Rem1, Rem2, Lazy;
	Node(int a = 0, int b = 0, int c = 0, int d = 0)
	{Rem0 = a, Rem1 = b, Rem2 = c, Lazy = d;}
};

Node SegTree[400001];
int N, Q;

void UpdateNode(Node& U, int x)
{
	int OldRem0 = U.Rem0, OldRem1 = U.Rem1, OldRem2 = U.Rem2;
	if (x%3 == 1)
		U.Rem1 = OldRem0, U.Rem2 = OldRem1, U.Rem0 = OldRem2;
	else if (x%3 == 2)
		U.Rem1 = OldRem2, U.Rem2 = OldRem0, U.Rem0 = OldRem1;
}

void Merge(Node& Ans, Node& Left, Node& Right)
{
	Ans.Rem0 = Left.Rem0 + Right.Rem0;
	Ans.Rem1 = Left.Rem1 + Right.Rem1;
	Ans.Rem2 = Left.Rem2 + Right.Rem2;
}

void Build(int i, int STx1, int STx2)
{
	if (STx1 > STx2)
		return;
	if (STx1 == STx2)
	{
		SegTree[i] = Node(1, 0, 0, 0);
		return;
	}
	int STxm = (STx1 + STx2)/2;
	Build(2*i, STx1, STxm);
	Build(2*i + 1, STxm + 1, STx2);
	Merge(SegTree[i], SegTree[2*i], SegTree[2*i + 1]);
}

void UpdateRange(int i, int STx1, int STx2, int x1, int x2)
{
	if (SegTree[i].Lazy)
	{
		UpdateNode(SegTree[i], SegTree[i].Lazy);
		if (STx1 != STx2)
		{
			SegTree[2*i].Lazy += SegTree[i].Lazy;
			SegTree[2*i + 1].Lazy += SegTree[i].Lazy;
		}
		SegTree[i].Lazy = 0;
	}
	if (STx1 > STx2 || x1 > x2 || STx1 > x2 || STx2 < x1)
		return;
	if (STx1 >= x1 && STx2 <= x2)
	{
		UpdateNode(SegTree[i], 1);
		if (STx1 != STx2)
		{
			SegTree[2*i].Lazy++;
			SegTree[2*i + 1].Lazy++;
		}
		return;
	}
	int STxm = (STx1 + STx2)/2;
	UpdateRange(2*i, STx1, STxm, x1, x2);
	UpdateRange(2*i + 1, STxm + 1, STx2, x1, x2);
	Merge(SegTree[i], SegTree[2*i], SegTree[2*i + 1]);
}

Node Query(int i, int STx1, int STx2, int x1, int x2)
{
	if (SegTree[i].Lazy)
	{
		UpdateNode(SegTree[i], SegTree[i].Lazy);
		if (STx1 != STx2)
		{
			SegTree[2*i].Lazy += SegTree[i].Lazy;
			SegTree[2*i + 1].Lazy += SegTree[i].Lazy;
		}
		SegTree[i].Lazy = 0;
	}
	if (STx1 > STx2 || x1 > x2 || STx1 > x2 || STx2 < x1)
		return Node();
	if (STx1 >= x1 && STx2 <= x2)
		return SegTree[i];
	int STxm = (STx1 + STx2)/2;
	Node Ans, Left = Query(2*i, STx1, STxm, x1, x2);
	Node Right = Query(2*i + 1, STxm + 1, STx2, x1, x2);
	Merge(Ans, Left, Right);
	return Ans;
}

int main()
{
	scanf("%d %d", &N, &Q);
	Build(1, 1, N);
	while (Q--)
	{
		int A, B, P;
		scanf("%d %d %d", &P, &A, &B);
		A++, B++;
		if (P)
			printf("%d\n", Query(1, 1, N, A, B).Rem0);
		else
			UpdateRange(1, 1, N, A, B);
	}
	return 0;
}