Question : RRFRNDS I used brute force to solve this and was expecting a TLE but got a WA instead Somebody provide me some hints to solve this
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
Name |
---|
You can find editorial at codechef. Editorial link has to be under the statement as i remember.
Let's call list[i] is all friend of user[i], after that, we check all pair (i, j), if currently i and j is not friend and exists an user in list[i] is also friend of j, then pair (i, j) is valid, we increase the answer to 1.
That's an O(N^3) implementation and will time out