#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define dbg(x) cerr << #x << " " << x << "\n"
struct node_t {
int sum_max;
int sum;
};
class segtree {
public:
vector <node_t> seg;
int n;
segtree (int n) {
this->n = n;
seg.resize (1 + 4 * n);
}
node_t combine (node_t lnode, node_t rnode) {
return {
max (lnode.sum_max, lnode.sum + rnode.sum_max),
lnode.sum + rnode.sum
};
}
void update (int node, int lb, int rb, int pos, int val) {
if (lb == rb) {
seg[node] = {max (0, val), val};
return;
}
int mid = (lb + rb) / 2, lnode = node * 2, rnode = node * 2 + 1;
if (pos <= mid)
update (lnode, lb, mid, pos, val);
else
update (rnode, mid + 1, rb, pos, val);
seg[node] = combine (seg[lnode], seg[rnode]);
}
node_t query (int node, int lb, int rb, int ql, int qr) {
if (ql <= lb && rb <= qr) {
return seg[node];
}
int mid = (lb + rb) / 2, lnode = node * 2, rnode = node * 2 + 1;
node_t ans = {0, 0};
if (ql <= mid)
ans = combine (ans, query (lnode, lb, mid, ql, qr));
if (qr > mid)
ans = combine (ans, query (rnode, mid + 1, rb, ql, qr));
return ans;
}
};
class fenwick {
public:
vector <int> aib;
int n;
fenwick (int n) {
this->n = n;
aib.resize (1 + n);
}
void upd (int pos, int val) {
while (pos <= n) {
aib[pos] += val;
pos += pos & -pos;
}
}
int qry (int pos) {
int ans = 0;
while (pos > 0) {
ans += aib[pos];
pos -= pos & -pos;
}
return ans;
}
int qry (int l, int r) {
return qry (r) - qry (l - 1);
}
int kth (int k) {
int ans = 0;
for (int step = (1 << 20); step > 0; step /= 2)
if (ans + step <= n && aib[ans + step] < k) {
ans += step;
k -= aib[ans];
}
return ans + 1;
}
};
const int MAX_N = 25e4;
vector <pair <int, int>> qry[1 + MAX_N], upd_seg[1 + MAX_N], upd_fen[1 + MAX_N]; /// first-> pos, second-> value
int group[1 + MAX_N];
int sol[1 + MAX_N];
int main () {
ios::sync_with_stdio (false);
cin.tie (0); cout.tie (0);
int n, m, q;
cin >> n >> m >> q;
for (int i = 1; i <= q; i++) {
int type;
cin >> type;
if (type == 1) {
int l, r, c, k;
cin >> l >> r >> c >> k;
group[i] = c;
upd_seg[l].push_back ({i, k});
if (r < n)
upd_seg[r + 1].push_back ({i, 0});
upd_fen[l].push_back ({i, k});
if (r < n)
upd_fen[r + 1].push_back ({i, -k});
}
else if (type == 2) {
int l, r, k;
cin >> l >> r >> k;
upd_seg[l].push_back ({i, -k});
if (r < n)
upd_seg[r + 1].push_back ({i, 0});
}
else {
int a, b;
cin >> a >> b;
qry[a].push_back ({i, b});
}
}
segtree balance (q);
fenwick all (q);
for (int i = 0; i <= q; i++)
sol[i] = -1;
for (int i = 1; i <= n; i++) {
for (auto it : upd_seg[i])
balance.update (1, 1, q, it.first, it.second);
for (auto it : upd_fen[i])
all.upd (it.first, it.second);
for (auto it : qry[i]) {
int best = balance.query (1, 1, n, 1, it.first).sum_max;
if (best >= it.second) {
sol[it.first] = group[all.kth (all.qry (it.first) - (best - it.second))];
}
else {
sol[it.first] = 0;
}
}
}
for (int i = 1; i <= q; i++)
if (sol[i] >= 0)
cout << sol[i] << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
18068 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
18068 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
96 ms |
25244 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
84 ms |
29088 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
18068 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
30 ms |
20812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
18068 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
18068 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
