I tried but I'm not understanding why.
Submission : 136141445
Problem : 1598C - Delete Two Elements
If there is a better solution, feel free to explain. :)
I tried but I'm not understanding why.
Submission : 136141445
Problem : 1598C - Delete Two Elements
If there is a better solution, feel free to explain. :)
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 144 |
Name |
---|
std::count
's complexity is linear so your time complexity is $$$O(n^2)$$$. Use a map instead.Thank you for your reply. What will be the time complexity if I use a map? Will it be _O(NlogN)?
Yes, it would be $$$O(n log n)$$$. You can use hashmap(
unordered_map
in C++), and your code run in $$$O(n)$$$ in average, but it is not guaranteed.