# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
If I remember corretly, the mentioned problem from Run Twice contest appeared at Petrozavodsk summer camp 2022. My solution is to check whether the input graph has a $$$4$$$-clique: a random graph should not have it.
Nice! This solution feels a bit borderline to me: the graph has 1% of all edges when m=5000, so roughly speaking the probability of having a 4-clique is C(1000,4)*0.01^6 ~= 1000^4/24/100^6 = 1/24, so it might or might not appear in the ~100 testcases, not all of which have m=5000.