I have been solving [Stone Age Problem](https://codeforces.me/contest/1679/problem/B) and something caught my attention, what is the real complexity for map.clear and unordered_map.clear ↵
↵
The same code using map.clear passes but unorder_map.clear however cppreference says both are linear, so what is the real complexity.↵
↵
- [157206280](https://codeforces.me/contest/1679/submission/157206280) map.clear AC ↵
- [157206382](https://codeforces.me/contest/1679/submission/157206382) unordered.clear TLE↵
↵
UPD1: I have proved that isn't related with collision because I haven tested initiating a new one instead of cleaning and it passes. [AC](https://codeforces.me/contest/1679/submission/157228654)↵
↵
↵
The same code using map.clear passes but unorder_map.clear however cppreference says both are linear, so what is the real complexity.↵
↵
- [157206280](https://codeforces.me/contest/1679/submission/157206280) map.clear AC ↵
- [157206382](https://codeforces.me/contest/1679/submission/157206382) unordered.clear TLE↵
↵
UPD1: I have proved that isn't related with collision because I haven tested initiating a new one instead of cleaning and it passes. [AC](https://codeforces.me/contest/1679/submission/157228654)↵
↵
