Блог пользователя tanakh

Автор tanakh, 16 лет назад, По-английски
A. Shortest path of the king

It is very easy problem, but I wrote wrong direction and got 1 WA. Kanashisu...

B. Lorry

It is very easy problem too, but I confused the output specification. There's no example that has multiple vehicles numbers of output. I got many WAs. I was sad. I submitted many solutions that make small changes. Eventually I found the other mistake.

C. Tic-tac-toe

It is very easy problem too, but I miss a situation that fast won and first's move and vice versa are illegal. What a pity!

D. Least Cost Bracket Sequence

I complete to implement a divide and conqueror algorithm after the end, but I got TLE. I don't know a collect algorithm yet...
  • Проголосовать: нравится
  • +1
  • Проголосовать: не нравится

16 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится
Hello. Tanakh-san. I saw your tweet. Nice to meet you here. Is this another contest site, like Topcoder? Then I want to join here too! Language skill (Programming && English) is very important for me and you! Let's Keep Challenging!
16 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится
For problem D - I tried to solve it with Dynamic programming - it's time complexity is O(N^2), but with a very low constant (optimised it very heavily), but still got TLE. Just curious, what time complexity has your divide and conquer solution?
16 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится
I thought my algorithm works with O(nlogn), but it is misconception. It's complexity really is O(n^2logn).