#include<bits/stdc++.h>
#define breturn return
#define ll long long
using namespace std;
const int maxn = 300001;
ll n, m, o[maxn], p[maxn], a, b, c, q, bn, tour[1048600], laz[1048600], ans[maxn];
vector<pair<ll, pair<ll, ll> > > midl[maxn], quer;
vector<pair<ll, pair<ll, pair<ll, ll> > > > nx;
vector<ll> v[maxn];
bool done;
void upd(ll ax, ll bx, ll val, ll x = 1, ll l = 0, ll r = bn - 1) {
if(ax > r or bx < l) breturn;
if(l >= ax and r <= bx) {
laz[x] += val;
breturn;
}
ll mid = (l + r)/2;
upd(ax, bx, val, x * 2, l, mid);
upd(ax, bx, val, x * 2 + 1, mid + 1, r);
}
ll query(ll ax, ll bx, ll x = 1, ll l = 0, ll r = bn - 1) {
if(ax > r or bx < l) breturn 0;;
if(l >= ax and r <= bx) {
tour[x] += laz[x];
laz[x] = 0;
breturn tour[x];
}
laz[x * 2] += laz[x];
laz[x * 2 + 1] += laz[x];
laz[x] = 0;
ll mid = (l + r)/2;
breturn query(ax, bx, x * 2, l, mid) + query(ax, bx, x * 2 + 1, mid + 1, r);
}
int main() {
cin >> n >> m;
for(int i = 0; i < m; i++ ) cin >> a, v[a - 1].push_back(i);
for(ll i = 0; i < n; i++) cin >> p[i];
cin >> q;
bn = (1 << ((ll)log2(m - 1 + (m == 1)) + 1));
for(ll i = 0; i < q; i++) {
cin >> a >> b >> c;
quer.push_back({c, {a - 1, b - 1}});
}
for(ll i = 0; i < n; i++) midl[(int)(q/2)].push_back({i, {0, q}});
while(!done) {
for(ll i = 0; i < 2 * bn; i++) tour[i] = 0, laz[i] = 0;
for(ll i = 0; i < q; i++) {
if(quer[i].second.first > quer[i].second.second) {
upd(0, quer[i].second.second, quer[i].first);
upd(quer[i].second.first, m - 1, quer[i].first);
} else upd(quer[i].second.first, quer[i].second.second, quer[i].first);
for(ll j = 0; j < midl[i].size(); j++) {
ll y = midl[i][j].first;
unsigned ll x = 0;
for(ll k = 0; k < v[y].size(); k++) x += query(v[y][k], v[y][k]);
ll le = midl[i][j].second.first;
ll re = midl[i][j].second.second;
ll mid = (le + re)/2;
if(x < p[y]) le = mid + 1;
else re = mid;
mid = (le + re)/2;
if(le == re) ans[y] = le;
else nx.push_back({mid, {y, {le, re}}});
}
while(midl[i].size()) midl[i].pop_back();
}
done = !(nx.size());
for(ll j = 0; j < nx.size(); j++) midl[nx[j].first].push_back(nx[j].second);
nx.clear();
}
for(ll i = 0; i < n; i++) {
if(ans[i] == q) cout << "NIE\n";
else cout << ans[i] + 1 << '\n';
}
}
Compilation message
met.cpp: In function 'int main()':
met.cpp:52:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for(ll j = 0; j < midl[i].size(); j++) {
| ~~^~~~~~~~~~~~~~~~
met.cpp:55:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | for(ll k = 0; k < v[y].size(); k++) x += query(v[y][k], v[y][k]);
| ~~^~~~~~~~~~~~~
met.cpp:59:10: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
59 | if(x < p[y]) le = mid + 1;
| ~~^~~~~~
met.cpp:68:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, std::pair<long long int, long long int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
68 | for(ll j = 0; j < nx.size(); j++) midl[nx[j].first].push_back(nx[j].second);
| ~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
14572 KB |
Output is correct |
| 2 |
Correct |
15 ms |
14700 KB |
Output is correct |
| 3 |
Correct |
15 ms |
14572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
14700 KB |
Output is correct |
| 2 |
Correct |
15 ms |
14572 KB |
Output is correct |
| 3 |
Correct |
16 ms |
14828 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
460 ms |
20740 KB |
Output is correct |
| 2 |
Correct |
623 ms |
29924 KB |
Output is correct |
| 3 |
Correct |
570 ms |
25252 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
548 ms |
23524 KB |
Output is correct |
| 2 |
Correct |
561 ms |
23668 KB |
Output is correct |
| 3 |
Correct |
642 ms |
30268 KB |
Output is correct |
| 4 |
Correct |
172 ms |
23468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
317 ms |
21216 KB |
Output is correct |
| 2 |
Correct |
432 ms |
30168 KB |
Output is correct |
| 3 |
Correct |
218 ms |
16100 KB |
Output is correct |
| 4 |
Correct |
538 ms |
27212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
549 ms |
18400 KB |
Output is correct |
| 2 |
Correct |
562 ms |
23772 KB |
Output is correct |
| 3 |
Correct |
478 ms |
19296 KB |
Output is correct |
| 4 |
Correct |
603 ms |
32296 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2027 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2599 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
