Search found 85 matches

by Igor9669
Sat Nov 13, 2010 8:22 am
Forum: Volume 105 (10500-10599)
Topic: 10509 - R U Kidding Mr. Feynman?
Replies: 41
Views: 13203

Re: 10509 - R U Kidding Mr. Feynman?

all of you try this test:

Code: Select all

1000000.0
0
And you will see where is you mistake!
by Igor9669
Thu Oct 07, 2010 3:22 pm
Forum: Volume 118 (11800-11899)
Topic: 11851 - Celebrity Split
Replies: 9
Views: 2845

Re: 11851 - Celebrity Split

Divide into to 2 groups by n/2 elements each and find for each group a solution with your O(3^n) algo! I have not yet tried this problem but I think it will be right idea!
by Igor9669
Thu Oct 07, 2010 12:32 pm
Forum: Volume 118 (11800-11899)
Topic: 11852 - Knight's Trip
Replies: 7
Views: 3335

Re: 11852 - Knight's Trip

You could find it here: http://uvatoolkit.com/material.php
by Igor9669
Thu Oct 07, 2010 8:39 am
Forum: Volume 118 (11800-11899)
Topic: 11858 - Frosh Week
Replies: 20
Views: 3382

Re: 11858 - Frosh Week

My problem was that I used an array of size 1000000 when I increase it I got Ac! Try this!
by Igor9669
Mon Oct 04, 2010 8:29 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

I just find a mistake in your code)))
look for your inner loop!!!!
by Igor9669
Mon Oct 04, 2010 8:16 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

not a counter, I use it for the lenght of the string which make this hash!
Then sort and it easy to find the answer! So the complexity is O(n*(n-1)/2)*logN or O(n^2logN)
by Igor9669
Mon Oct 04, 2010 8:13 pm
Forum: Volume 118 (11800-11899)
Topic: 11857 - Driving Range
Replies: 21
Views: 7603

Re: 11857 - Driving Range

Yes of course read about Kruskal algorithm!
Here you find a data that needed!
by Igor9669
Mon Oct 04, 2010 3:29 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

)) map is also a good choice, but I use an array with type of pair<long long,int>!
by Igor9669
Mon Oct 04, 2010 3:24 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

sorry,maxes I mean!
No I don't use map!
by Igor9669
Mon Oct 04, 2010 3:14 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

Yes,it was something likes yours!
try to increase the size of array m!
by Igor9669
Mon Oct 04, 2010 2:52 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

But I could explain my idea here if you want???
by Igor9669
Mon Oct 04, 2010 2:51 pm
Forum: Volume 118 (11800-11899)
Topic: 11833 - Route Change
Replies: 13
Views: 3881

Re: 11833 - Route Change

There is a service route which start at 0 and ends in (C-1) and the path is 0->1 then 1->2 .......x->(c-1)
So if you reach some city in this path you should follow only this path to reach (c-1)!
by Igor9669
Mon Oct 04, 2010 2:44 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

Sorry,but I don't save the codes of Ac problems in my computer((
by Igor9669
Mon Oct 04, 2010 2:39 pm
Forum: Volume 118 (11800-11899)
Topic: 11857 - Driving Range
Replies: 21
Views: 7603

Re: 11857 - Driving Range

Solve,solve and solve......
by Igor9669
Mon Oct 04, 2010 2:36 pm
Forum: Volume 118 (11800-11899)
Topic: 11855 - Buzzwords
Replies: 21
Views: 5291

Re: 11855 - Buzzwords

Of cousre it will,but this is not a problem it works like you get it by module!

Go to advanced search