My friend, if f(n) = O(1) then f(n) = O(n lg n) I said no more than. ty :)
2010/5/11 Mikhail Dektyarev <mihail.dektya...@googlemail.com> > No. If you have restrictions for all numbers it the task, then you can > solve this in O(1) - simple busting all strings with length <= N and > checking if they are correct output) > > On Tue, May 11, 2010 at 6:47 PM, Lucas Thom <thx...@gmail.com> wrote: > >> Write your algorithm to run in at most O (n lg k) and you will not have >> problems. >> >> =) >> >> 2010/5/11 ijacek <ondrej.prec...@gmail.com> >> >> Ok, then go and buy better HW. Maybe it will be sufficient >>> for the next round, but what then? I quess that intel and amd >>> are not fast enough to offer better cpus till end of the contest. >>> >>> Do you understand, that it's just coincidence that your solution >>> finished in 8:05? It depends on input you received. >>> Next time it will be probably 5, 10 or maybe 1 hour. >>> The point is that you don't know how long will it take and if you >>> have bad algorithm it can easily increase to several hours. >>> >>> Or maybe, if you buy cluster of 100 PCs, then you can be >>> sure. And 1000 will be even better :-) >>> >>> >>> On May 11, 10:27 am, retseta <rets...@gmail.com> wrote: >>> > I don't agree, on large file type computer(his speed) very important, >>> > i solved the problem on 8 min 5 seconds if my PC be faster, i resolved >>> > problem in time >>> > >>> > -- >>> > You received this message because you are subscribed to the Google >>> Groups "google-codejam" group. >>> > To post to this group, send email to google-c...@googlegroups.com. >>> > To unsubscribe from this group, send email to >>> google-code+unsubscr...@googlegroups.com<google-code%2bunsubscr...@googlegroups.com> >>> . >>> > For more options, visit this group athttp:// >>> groups.google.com/group/google-code?hl=en. >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "google-codejam" group. >>> To post to this group, send email to google-c...@googlegroups.com. >>> To unsubscribe from this group, send email to >>> google-code+unsubscr...@googlegroups.com<google-code%2bunsubscr...@googlegroups.com> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/google-code?hl=en. >>> >>> >> >> >> -- >> Lucas Thom Ramos >> CCOMP - UFES >> thx...@gmail.com >> (27) 8801-5899 >> (27) 3337-5641 >> >> -- >> You received this message because you are subscribed to the Google Groups >> "google-codejam" group. >> To post to this group, send email to google-c...@googlegroups.com. >> To unsubscribe from this group, send email to >> google-code+unsubscr...@googlegroups.com<google-code%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/google-code?hl=en. >> > > > > -- > Best regards, Дектярев Михаил > > -- > You received this message because you are subscribed to the Google Groups > "google-codejam" group. > To post to this group, send email to google-c...@googlegroups.com. > To unsubscribe from this group, send email to > google-code+unsubscr...@googlegroups.com<google-code%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/google-code?hl=en. > -- Lucas Thom Ramos CCOMP - UFES thx...@gmail.com (27) 8801-5899 (27) 3337-5641 -- You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-c...@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/google-code?hl=en.
