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
| #include <cstdio>
#include <vector>
using namespace std;
typedef __int128 LL;
template <class Type>
void read(Type &x)
{
char c;
bool flag = false;
while ((c = getchar()) < '0' || c > '9')
c == '-' && (flag = true);
x = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 3) + (x << 1) + c - '0';
flag && (x = ~x + 1);
}
template <class Type>
void write(Type x)
{
x < 0 && (putchar('-'), x = ~x + 1);
x > 9 && (write(x / 10), 0);
putchar(x % 10 + '0');
}
const int N = 3e5 + 10;
bool vis[N];
int n, m, q, w[N], ans[N];
LL tr[N];
vector<int> g[N];
struct Node
{
int l, r, v;
} h[N];
void modify(int x, int k)
{
for (; x <= m; x += x & -x)
tr[x] += k;
}
LL query(int x)
{
LL res = 0;
for (; x; x -= x & -x)
res += tr[x];
return res;
}
void solve(int l, int r, vector<int> &p)
{
if (p.empty())
return;
if (l == r)
{
for (int i : p)
ans[i] = l;
return;
}
int mid = l + r >> 1;
vector<int> L, R;
for (int i = l; i <= mid; i++)
{
modify(h[i].l, h[i].v);
modify(h[i].r + 1, -h[i].v);
h[i].l > h[i].r && (modify(1, h[i].v), 0);
}
for (int i : p)
{
LL t = 0;
for (int j : g[i])
t += query(j);
if (t >= w[i])
{
vis[i] = true;
L.push_back(i);
}
else
{
w[i] -= t;
R.push_back(i);
}
}
for (int i = l; i <= mid; i++)
{
modify(h[i].l, -h[i].v);
modify(h[i].r + 1, h[i].v);
h[i].l > h[i].r && (modify(1, -h[i].v), 0);
}
solve(l, mid, L), solve(mid + 1, r, R);
}
int main()
{
read(n), read(m);
for (int i = 1, a; i <= m; i++)
{
read(a);
g[a].push_back(i);
}
for (int i = 1; i <= n; i++)
read(w[i]);
read(q);
for (int i = 1; i <= q; i++)
read(h[i].l), read(h[i].r), read(h[i].v);
vector<int> p;
for (int i = 1; i <= n; i++)
p.push_back(i);
solve(1, q + 1, p);
for (int i = 1; i <= n; i++)
vis[i] ? write(ans[i]), puts("") : puts("NIE");
return 0;
}
|