Hello codeforces. Can anyone tell why this approach 217040454 in not working for this problem 1203B - Equal Rectangles?
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Hello codeforces. Can anyone tell why this approach 217040454 in not working for this problem 1203B - Equal Rectangles?
Name |
---|
The problem is in the map ,
Don't use map. It has happened with me too , see here : 212775377
in this part of the code when h[y] does not exist, it inserts {y, 0} into the map. this previous y is later iterated as an x which does not exist in our original array but one which in there in our map. this can be avoided with a continue statement when
cnt = 0
. the time complexity can also be further improved asmax(sides) * min(sides)
is the only area for which we can get an YES value.ac submission using this logic: 217060530
Yeah you are right, thanks you ! I didn't think about that. Now my submission get accepted 217078965