//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound
using namespace std;
typedef long long ll;
typedef long long i64;
//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 3e5 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }
ll zxc = 1, n, m, q, a[N];
i64 t[4 * N], uv[4 * N];
ll l[N], r[N], x[N];
ll p[N], cur[N], lw[N], hg[N];
vector<ll> v[N], vq[N];
void recalc(ll v) {
t[v] = t[left(v)] + t[right(v)];
}
void push(ll v, ll tl, ll tr) {
if (!uv[v]) return;
if (tl < tr) {
uv[left(v)] += uv[v];
uv[right(v)] += uv[v];
}
t[v] += uv[v] * 1ll * (tr - tl + 1);
uv[v] = 0;
}
ll get(ll v, ll tl, ll tr, ll l, ll r) {
push(v, tl, tr);
if(l <= tl && tr <= r) return t[v];
if(tr < l || r < tl) return 0;
ll tm = (tl + tr) / 2;
return get(left(v), tl, tm, l, r) + get(right(v), tm + 1, tr, l, r);
}
void upd(ll v, ll tl, ll tr, ll ql, ll qr, ll val) {
push(v, tl, tr);
if (tr < ql || qr < tl) return;
if (ql <= tl && tr <= qr) {
uv[v] += val;
push(v, tl, tr);
return;
}
int mid = (tl + tr) / 2;
upd(left(v), tl, mid, ql, qr, val);
upd(right(v), mid + 1, tr, ql, qr, val);
recalc(v);
}
void solve() {
cin >> n >> m;
for(ll i = 1; i <= m; i++) {
cin >> p[i];
v[p[i]].pb(i);
}
for(ll i = 1; i <= n; i++) {
cin >> a[i];
}
cin >> q;
for(ll i = 1; i <= n; i++)
lw[i] = 1, hg[i] = q + 1;
for(ll i = 1; i <= q; i++) {
cin >> l[i] >> r[i] >> x[i];
}
ll ok = 1;
while(ok) {
ok = 0;
// cout << "OK\n";
memset(t, 0, sizeof(t));
memset(uv, 0, sizeof(uv));
for (int i = 1; i <= n; i++) {
vq[i].clear();
}
for(ll i = 1; i <= n; i++) {
if(lw[i] != hg[i])
vq[(lw[i] + hg[i]) / 2].pb(i);
}
for(ll i = 1; i <= q; i++) {
if(l[i] <= r[i])
upd(1, 1, m, l[i], r[i], x[i]);
else upd(1, 1, m, l[i], m, x[i]), upd(1, 1, m, 1, r[i], x[i]);
for (auto id : vq[i]) {
ok = 1;
ll id = id;
i64 sum = 0;
for(ll x : v[id]) {
sum += get(1, 1, m, x, x);
if (sum >= a[id]) break;
}
if(sum >= a[id]) hg[id] = i;
else lw[id] = i + 1;
}
}
}
for(ll i = 1; i <= n; i++) {
cout << (lw[i] <= q ? to_string(lw[i]) : "NIE") << "\n";
}
}
int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
cin.tie(0);
/*
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
*/
// cin >> zxc;
while(zxc--) {
solve();
}
return 0;
}
Compilation message
met.cpp: In function 'void solve()':
met.cpp:119:20: error: redeclaration of 'll id'
119 | ll id = id;
| ^~
met.cpp:117:23: note: 'long long int id' previously declared here
117 | for (auto id : vq[i]) {
| ^~
met.cpp:117:23: warning: unused variable 'id' [-Wunused-variable]
