|
|
rt judgement is not stable,sometimes submit AC sometimes submit TLE... 800*800*400 random can AC Can this problem be solved better than O(N^3)? This problem is supposed to be solved in O(n^3) with small constant factor by author Actually, O(N^2 log N) of geometry + O(N^3) of bit operations. This may give you an idea of the solution. Переведите пожалуйста условия на русский. А то мой знания английского не позволяет понять его полностью. Use a translator, study English. C'est la vie - starting from quarterfinals, all ACM championships are organized in English... Anyone with a an idea for a test that can fix this? |
|
|
