Обсуждение @ 1323. Одноклассники @ Timus Online Judge

Nice problem, but too big time limit...

Послано Danica Porobic 25 июл 2004 23:58

1 second is just enough.

Re: Nice problem, but too big time limit...

Послано Yoyo 4 сен 2004 22:25

Any hints?

Just brute force :) (-)

Послано Dmitry 'Diman_YES' Kovalioff 5 сен 2004 12:43

Re: Nice problem, but too big time limit...

Послано Aleksey (BMSTU IU7) 30 сен 2004 01:20

just 0.1 sec.

How can you do it so fast?

Послано Neumann 5 фев 2005 10:32

Because of enough time,I used dfs in 0.9sec.
But I think bfs+binary will much faster...

What is your algo?

Re: How can you do it so fast?

Послано Lifanov 9 сен 2005 12:35

I used dfs and get AC with 2.1 sec.
Then i use simple optimization and get Ac with 0.17 sec? It's very simple.

Re: How can you do it so fast?

Послано Ilya Rasenstein (Lyceum #40) 6 май 2007 14:35

there is a simple dp-on-subsets solution...

Re: How can you do it so fast?

Послано SPIRiT 21 июн 2007 02:08

I tried to solve it with dp-on-subsets but WA at test 7. Any hints? Also, when I use stricmp in C++, I get CE. Is this function illegal?
Also, are the names unique in case-sensitive sense, or case insensitive? Does the last line in file always contain word 'Tanya'?

Re: How can you do it so fast?

Послано hoan 8 дек 2010 19:28

the last can be change.

Re: Nice problem, but too big time limit...

Послано Jane Soboleva (SumNU) 3 мар 2016 06:58

AC with the help of "if currentTime - startTime > 3.98 then exit"~
Without this limitation, it works almost full 40 seconds on test with maxed N and M.
I feel too lazy to think of effecient ways when i see such a generous time limit...

Обсуждение задачи 1323. Одноклассники