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:
juver
|
13 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
|
13 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
|
13 years ago,
#
^
|
0
Your code is obviously TLE.
→
Reply
|