-
Notifications
You must be signed in to change notification settings - Fork 0
/
PAINTBOX.cs
185 lines (169 loc) · 6.16 KB
/
PAINTBOX.cs
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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
// Not Solved : Solved but how?
namespace MMT_Elitmus
{
class PAINTBOX
{
static paintNode[] tree;
static int W;
static string[] vals;
struct paintNode
{
public int ans;
public int maxLeft;
public int maxRight;
public int rightElement;
public int leftElement;
public bool isTrue;
}
static void Main1(string[] args)
{
int t = Convert.ToInt32(Console.ReadLine());
while (t-- > 0)
{
string hj = Console.ReadLine();
string[] nw = hj.Split(' ');
int N = Convert.ToInt32(nw[0]);
W = Convert.ToInt32(nw[1]);
string hjk = Console.ReadLine();
vals = hjk.Split(' ');
int h = (int)Math.Ceiling(Math.Log(N, 2));
int maxSize = 2 * (int)Math.Pow(2, h) - 1;
tree = new paintNode[maxSize];
build(0, 0, N - 1);
// Console.WriteLine(vals.Length);
int q = Convert.ToInt32(Console.ReadLine());
while (q-- > 0)
{
string[] pc = Console.ReadLine().Split(' ');
int p = Convert.ToInt32(pc[0]);
int c = Convert.ToInt32(pc[1]);
if (W == 1)
{
Console.WriteLine(vals.Length);
}
else
{
update(0, 0, N - 1, p - 1, c);
Console.WriteLine(tree[0].ans);
}
}
}
}
static void build(int n, int start, int end)
{
if (start == end)
{
tree[n].maxLeft = 1;
tree[n].maxRight = 1;
tree[n].rightElement = Convert.ToInt32(vals[start]);
tree[n].leftElement = Convert.ToInt32(vals[start]);
if (W == 1)
{
tree[n].ans = 1;
}
tree[n].isTrue = true;
}
else
{
int mid = (start + end) / 2;
build(2 * n + 1, start, mid);
build(2 * n + 2, mid + 1, end);
prepareParentNode(n);
}
}
static void update(int n, int start, int end, int index, int val)
{
if (start == end)
{
tree[n].rightElement = val;
tree[n].leftElement = val;
tree[n].maxLeft = 1;
tree[n].maxRight = 1;
if (W == 1)
{
tree[n].ans = 1;
}
tree[n].isTrue = true;
}
else
{
int mid = (start + end) / 2;
if (index <= mid)
update(2 * n + 1, start, mid, index, val);
else
update(2 * n + 2, mid + 1, end, index, val);
prepareParentNode(n);
}
}
static void prepareParentNode(int n)
{
tree[n].rightElement = tree[2 * n + 2].rightElement;
tree[n].leftElement = tree[2 * n + 1].leftElement;
if (tree[2 * n + 1].rightElement == tree[2 * n + 2].leftElement)
{
if (tree[2 * n + 1].isTrue && tree[2 * n + 2].isTrue)
{
tree[n].maxLeft = tree[2 * n + 1].maxRight + tree[2 * n + 2].maxLeft;
tree[n].maxRight = tree[2 * n + 1].maxLeft + tree[2 * n + 2].maxLeft;
int answ = 0;
if (tree[n].maxLeft >= W)
{
answ = tree[n].maxLeft - W + 1;
}
tree[n].ans = answ;
tree[n].isTrue = true;
}
else
{
if (tree[2 * n + 1].isTrue)
{
tree[n].maxLeft = tree[2 * n + 1].maxLeft + tree[2 * n + 2].maxLeft;
tree[n].maxRight = tree[2 * n + 2].maxRight;
tree[n].isTrue = false;
}
else if (tree[2 * n + 2].isTrue)
{
tree[n].maxRight = tree[2 * n + 2].maxRight + tree[2 * n + 1].maxRight;
tree[n].maxLeft = tree[2 * n + 1].maxLeft;
tree[n].isTrue = false;
}
else
{
tree[n].maxLeft = tree[2 * n + 1].maxLeft;
tree[n].maxRight = tree[2 * n + 2].maxRight;
tree[n].isTrue = false;
}
int ans = tree[2 * n + 1].ans + tree[2 * n + 2].ans;
int temp1 = tree[2 * n + 1].maxRight;
int temp2 = tree[2 * n + 2].maxLeft;
if (temp1 + temp2 >= W)
{
ans = ans + (temp1 + temp2 - W + 1);
}
if (temp1 >= W)
{
ans = ans - (temp1 - W + 1);
}
if (temp2 >= W)
{
ans = ans - (temp2 - W + 1);
}
tree[n].ans = ans;
}
}
else
{
tree[n].maxLeft = tree[2 * n + 1].maxLeft;
tree[n].maxRight = tree[2 * n + 2].maxRight;
tree[n].ans = tree[2 * n + 1].ans + tree[2 * n + 2].ans;
tree[n].isTrue = false;
}
}
}
}