Can anyone explain why my code 188948183 for 1775B - Садовник и массив is TLE? Doesn't it work for O(∑k[i])?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Can anyone explain why my code 188948183 for 1775B - Садовник и массив is TLE? Doesn't it work for O(∑k[i])?
Название |
---|
vector a[100005]; and int k[114514]; causes tle because n <= 1e5 so you are doing 2e5 * 1e5 operations
I have corrected it: https://codeforces.com/contest/1775/submission/188960544. Yes, your code indeed works in $$$O(\sum k_i)$$$, but there are too many minor issues in your code:
cin.tie(0) -> sync_with_stdio(0)
. That is the key reason.#define int long long
I know many people like this, butlong long
is slower than int. Here,int
is enough. I once get TLE usinglong long
, and get AC usingint
.if(s[a[i][j]]==1) { f=1; }
: I suggest you to add a break:if(s[a[i][j]]==1) { f=1; break; }
. This optimization also works forif(f == 0) {ans = "Yes\n";}
.Thanks for giving me a chance to improve my debugging ability.