Can anyone explain why my code 188948183 for 1775B - Садовник и массив is TLE? Doesn't it work for O(∑k[i])?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Can anyone explain why my code 188948183 for 1775B - Садовник и массив is TLE? Doesn't it work for O(∑k[i])?
Name |
---|
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.net/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.