hi!i was solving this problem.it's strange that this submission1 got TLE while when i used set instead of visited array to keep track of colors the same code got AC.My AC code.Can someone please explain me why??
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
hi!i was solving this problem.it's strange that this submission1 got TLE while when i used set instead of visited array to keep track of colors the same code got AC.My AC code.Can someone please explain me why??
Name |
---|
Each time when you create an array it takes O(size) time. So your algorithm in worst case will create 100000 elements array 100000 times what is too much. If you create set it is empty so it takes O(1) time and O(log n) for each operation.
thanks so much...i didn't know about this :)