http://codeforces.net/gym/100134
though there are 345 test cases, I think there are a lot of holes in test cases,maybe it is a little boring to write n^2 brute force but sweepline algorithm is also not interesting....
# | 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 | 170 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 154 |
7 | Dominater069 | 154 |
9 | awoo | 153 |
10 | luogu_official | 152 |
O(n^2) Accepted gym 100134 K Kingdom Reunion1
http://codeforces.net/gym/100134
though there are 345 test cases, I think there are a lot of holes in test cases,maybe it is a little boring to write n^2 brute force but sweepline algorithm is also not interesting....
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | Los_Angelos_Laycurse | 2015-08-17 08:08:00 | 36 | Tiny change: 'though the' -> 'http://codeforces.net/gym/100134\n\nthough the' | ||
en1 | Los_Angelos_Laycurse | 2015-08-17 08:07:33 | 229 | Initial revision (published) |
Name |
---|