could anyone tell me why i am getting tle on test case 41? my solution is of o(nlogn) {if i am not wrong} . and by seeing constraints it should pass the testcases?. anyone?
sumbission link :- https://codeforces.me/contest/1902/submission/256209886
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3892 |
| 2 | jiangly | 3797 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3588 |
| 6 | ecnerwala | 3557 |
| 7 | Ormlis | 3532 |
| 8 | Benq | 3468 |
| 9 | Radewoosh | 3463 |
| 10 | Um_nik | 3450 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 2 | Qingyu | 159 |
| 3 | -is-this-fft- | 158 |
| 3 | atcoder_official | 158 |
| 5 | Dominater069 | 155 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 150 |
| 9 | awoo | 148 |
| 10 | maomao90 | 145 |
→ Find user
→ Recent actions
Is there any way to tell the no of subsequences of a given string with all unique elements.. I had used recursion but gets TLE. anyone have any optimal answer?
Is anyone have recursive dp solution of div2 892D?
In codeforces Educational Codeforces Round 123, C question (Increase Subarray Sum) , problem link :- https://codeforces.me/contest/1644/problem/C . i was getting TLE when i was using maps for hashing , but when i use vector for hashing for same code the solution got accepted . can anyone tell me why??
Hi, everyone. I am getting TLE in test case 11 in Codeforces Round 888 (Div. 3) E (Nastya and Potions) . i have applied recursion to get solution for each potions. can i anyone tell me how can i fix this error??
sumbission link:- https://codeforces.me/contest/1851/submission/215759218
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/26/2025 00:15:26 (h2).
Desktop version, switch to mobile version.
Supported by
