My code gives runtime error for some testcases of this Problem.
My Solution
But when I add integer 0, n times in the multiset at the beginning, my code gets accepted. Why?
Added Part
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
My code gives runtime error for some testcases of this Problem.
void solve() {
int n, x, q;
cin >> n >> x >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] -= i;
}
map<int, int> f;
for (int i = 0; i < x; i++) {
f[a[i]]++;
}
multiset<int, greater<int>> mt;
for (auto it : f) {
mt.insert(it.second);
}
vector<int> ans(n - x + 1);
ans[0] = x - *mt.begin();
for (int i = x; i < n; i++) {
int cur = i;
int beg = i - x;
mt.erase(mt.find(f[a[beg]]));
f[a[beg]]--;
mt.insert(f[a[beg]]);
mt.erase(mt.find(f[a[cur]]));
f[a[cur]]++;
mt.insert(f[a[cur]]);
ans[beg] = x - *mt.begin();
}
while (q--) {
int l, r;
cin >> l >> r;
cout << ans[l - 1] << "\n";
}
}
But when I add integer 0, n times in the multiset at the beginning, my code gets accepted. Why?
multiset<int, greater<int>> mt;
for(int i = 1; i <= n; i++) {
mt.insert(0);
}
Name |
---|
check if element exists before deleting
Thanks! it worked. I always thought that erase function is capable of handling such case.