#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], ans[maxn];
vector<pair<ll, pair<ll, ll> > > midl[maxn], quer;
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) {
tour[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) {
breturn tour[x];
}
tour[x * 2] += tour[x];
tour[x * 2 + 1] += tour[x];
tour[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) {
done = true;
for(ll i = 0; i < 2 * bn; i++) tour[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]);
if(x >= 1e9) break;
}
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 midl[mid].push_back({y, {le, re}}), done = false;
}
midl[i].clear();
midl[i].shrink_to_fit();
}
}
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:50: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]
50 | for(ll j = 0; j < midl[i].size(); j++) {
| ~~^~~~~~~~~~~~~~~~
met.cpp:53: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]
53 | for(ll k = 0; k < v[y].size(); k++) {
| ~~^~~~~~~~~~~~~
met.cpp:60:10: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
60 | if(x < p[y]) le = mid + 1;
| ~~^~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
14572 KB |
Output is correct |
| 2 |
Correct |
17 ms |
14572 KB |
Output is correct |
| 3 |
Correct |
17 ms |
14572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
14572 KB |
Output is correct |
| 2 |
Correct |
15 ms |
14572 KB |
Output is correct |
| 3 |
Correct |
17 ms |
14572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
484 ms |
18824 KB |
Output is correct |
| 2 |
Correct |
609 ms |
21472 KB |
Output is correct |
| 3 |
Correct |
568 ms |
19680 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
543 ms |
19460 KB |
Output is correct |
| 2 |
Correct |
554 ms |
19428 KB |
Output is correct |
| 3 |
Correct |
672 ms |
21472 KB |
Output is correct |
| 4 |
Correct |
194 ms |
18100 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
310 ms |
18688 KB |
Output is correct |
| 2 |
Correct |
417 ms |
21272 KB |
Output is correct |
| 3 |
Correct |
190 ms |
16740 KB |
Output is correct |
| 4 |
Correct |
533 ms |
20212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
516 ms |
18272 KB |
Output is correct |
| 2 |
Correct |
523 ms |
19544 KB |
Output is correct |
| 3 |
Correct |
480 ms |
18476 KB |
Output is correct |
| 4 |
Correct |
627 ms |
21140 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4840 ms |
52856 KB |
Output is correct |
| 2 |
Correct |
2051 ms |
40744 KB |
Output is correct |
| 3 |
Correct |
1012 ms |
22864 KB |
Output is correct |
| 4 |
Execution timed out |
6081 ms |
61724 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4610 ms |
53412 KB |
Output is correct |
| 2 |
Correct |
1558 ms |
39248 KB |
Output is correct |
| 3 |
Correct |
905 ms |
23132 KB |
Output is correct |
| 4 |
Execution timed out |
6049 ms |
63568 KB |
Time limit exceeded |
