My code for Enumerate Palindromes passes all the cases.
But it has a fatal bug and should tle.
What is it?
What it should be?
Generator for failing case
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 162 |
4 | nor | 153 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 150 |
8 | atcoder_official | 145 |
8 | Petr | 145 |
10 | pajenegod | 144 |
My code for Enumerate Palindromes passes all the cases.
But it has a fatal bug and should tle.
r = i + res[i];
b = i;
if (i + res[i] > r) {
r = i + res[i];
b = i;
}
ll n = 1e5;
string s = "";
for (ll i = 0; i < n; i++) {
s += 'j';
s += 'k';
}
cout << s <<"\n";
Название |
---|
Auto comment: topic has been updated by Misa-Misa (previous revision, new revision, compare).