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

Danica Porobic Nice problem, but too big time limit... [9] // Задача 1323. Одноклассники 25 июл 2004 23:58

1 second is just enough.

Yoyo Re: Nice problem, but too big time limit... [1] // Задача 1323. Одноклассники 4 сен 2004 22:25

Any hints?

Dmitry 'Diman_YES' Kovalioff Just brute force :) (-) // Задача 1323. Одноклассники 5 сен 2004 12:43

Aleksey (BMSTU IU7) Re: Nice problem, but too big time limit... [5] // Задача 1323. Одноклассники 30 сен 2004 01:20

just 0.1 sec.

Neumann How can you do it so fast? [4] // Задача 1323. Одноклассники 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?

Lifanov Re: How can you do it so fast? [3] // Задача 1323. Одноклассники 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.

Ilya Rasenstein (Lyceum #40) Re: How can you do it so fast? [2] // Задача 1323. Одноклассники 6 май 2007 14:35

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

SPIRiT Re: How can you do it so fast? [1] // Задача 1323. Одноклассники 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'?

hoan Re: How can you do it so fast? // Задача 1323. Одноклассники 8 дек 2010 19:28

the last can be change.

Jane Soboleva (SumNU) Re: Nice problem, but too big time limit... // Задача 1323. Одноклассники 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. Одноклассники