The problems you can download here and you can test your solution in the ACM ICPC Live Archive.
The official scoreboards are located here.
Problems solved:
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
juver
|
14 years ago,
#
|
+1
Hi.
I'm wondering about you solution for problem A. Cause it has worst complexity O(n*m), both of n and m up to 105. Did you solve it onsite?
→
Reply
|
vudduu
|
14 years ago,
#
^
|
0
Unfortunately not resolved onsite, but i like the implementation of LCA for this problem.
I was thinking about attending to all queries at the same time.
→
Reply
|
juver
|
14 years ago,
#
^
|
0
Your code is obviously TLE.
→
Reply
|
Name |
---|