Search found 53 matches

by Imti
Sat Jan 28, 2012 5:54 pm
Forum: Volume 105 (10500-10599)
Topic: 10578 - The Game of 31
Replies: 11
Views: 4741

Re: 10578 - The Game of 31

Hi guys! i dont know how optime my search in this problem, some hint ? I used Dynamic programming to solve this problem.Think a dp table of size [31][4][4][4][4][4][4] is within memory constraint of this problem.Just make best strategy at each recursion for each player and meomrize this for future ...
by Imti
Mon Nov 28, 2011 9:18 pm
Forum: Volume 113 (11300-11399)
Topic: 11367 - Full Tank?
Replies: 13
Views: 7756

Re: 11367 - Full tank?

Well,Here's how 170 comes 1)Fill tank with 9 unit from city 0 and go to city 1 which costs 9 unit of fuel(9*10=90) 2)From station 1 take 8 unit of fuel and go to station 2 which costs 1 unit of fuel(8*10=70) 3)Go from station 2 to destination 3 which needs 7 unit of of fuel .so here u don't need any...
by Imti
Wed Nov 16, 2011 11:17 am
Forum: Volume 105 (10500-10599)
Topic: 10510 - Cactus
Replies: 31
Views: 22298

Re: 10510 - Cactus

Just check whether graph is strongly connected and then check whether graph have any cross or forward edge.If first one is 'yes' and second one is 'no' then the graph is cactus otherwise not.no need to check something else.Here's some case. 2 5 7 0 1 1 2 2 0 2 3 3 2 2 4 4 2 5 8 0 1 1 2 2 0 2 3 3 2 2...
by Imti
Tue Nov 15, 2011 12:06 am
Forum: Volume 109 (10900-10999)
Topic: 10938 - Flea circus
Replies: 14
Views: 7725

Re: 10938 - Flea circus

LCA for this problem?! I just used normal bfs to solve that and nothing else is needed. Just use one flea's location as source and another flea's location as destination. Then find the path between them. If path length+1 odd then they will jump between two node forever otherwise they will meet.Now,J...
by Imti
Sun Nov 13, 2011 12:03 am
Forum: Volume 114 (11400-11499)
Topic: 11413 - Fill the Containers
Replies: 13
Views: 6455

Re: 11413 - Fill the Containers

I would like to tell respective authority of this problem to add some more data set in input file.It missed some input like: 5 1 2 3 5 4 output should be 5 but previous accepted code gave 4.after fixing that I got accepted which means absence of data set like that.For those who getting WA Try This I...
by Imti
Mon Oct 31, 2011 11:58 pm
Forum: Volume 8 (800-899)
Topic: 869 - Airline Comparison
Replies: 7
Views: 4723

Re: 869 - Airline Comparison

I don't understand why the cities are not case sensitive as problem description didn't cleared it.
How to get that point 'case insensitive' from this problem?
by Imti
Sun Oct 30, 2011 12:13 am
Forum: Volume 102 (10200-10299)
Topic: 10226 - Hardwood Species
Replies: 121
Views: 36759

Re: 10226 - Hardwood Species

@plamplam
ur exact about my fault.I overlooked a blank space character .after fixing it I got accepted.BTW,thanks for ur reply.In fact I forgot about this problem and ur post made me give a look back at it.... :D
by Imti
Wed Oct 12, 2011 1:01 pm
Forum: Volume 118 (11800-11899)
Topic: 11813 - Shopping
Replies: 6
Views: 2079

11813 - Shopping

I tried this with BFS+Bit-masking.But getting TLE.Same result for Dijkstra+bit-masking too.
whats the correct approach to solve it?
by Imti
Tue Sep 20, 2011 8:39 pm
Forum: Volume 5 (500-599)
Topic: 590 - Always on the run
Replies: 12
Views: 6462

Re: 590 can you give me a tiny hint

To:bourne
If You didn't get it accepted yet ..then it's for u...
long long dp[11][31]; //dp[city][day]
day could be as large as 1000 ..so you should increase size of 2nd dimension of your array..I was also getting WA for this reason..:)
by Imti
Sun Sep 18, 2011 8:03 am
Forum: Volume 104 (10400-10499)
Topic: 10480 - Sabotage
Replies: 8
Views: 5521

Re: 10480 - Sabotage

Data set for this problem is weak,I think.As,The Graph is undirected. Output for following should be: 7 7 1 4 2 4 5 5 5 2 2 1 7 3 7 5 3 4 6 3 6 2 3 0 0 My latest accepted approach Outputs: 1 4 1 7 But my another accepted(Not supposed to get accepted :D) outputs: 1 4 5 4 5 2 which is definitely wrong.
by Imti
Fri Sep 16, 2011 12:22 pm
Forum: Volume 5 (500-599)
Topic: 563 - Crimewave
Replies: 42
Views: 17103

Re: 563 - Crimewave

I don't know whether you got accepted it..However you could reduce number of iterations in following portion. You don't need to look over all the node's possible to find adjacent of current node rather you should look up only four node up, down,left ,right of current node..this should avoid TLE...:)...
by Imti
Sat Sep 03, 2011 1:03 pm
Forum: Volume 109 (10900-10999)
Topic: 10917 - Walk Through the Forest
Replies: 19
Views: 9970

Re: 10917 - A Walk Through the Forest

I Tried many Test-cases compared with UVA toolkit's output and it passed all.
I counted path as sclo said and as aninnda implemented...could not figure out reason behind WA...please help anyone....here is my code

Code: Select all


//Cut After Getting Accepted...

by Imti
Fri Sep 02, 2011 5:11 pm
Forum: Volume 109 (10900-10999)
Topic: 10912 - Simple Minded Hashing
Replies: 24
Views: 14561

Re: 10912 - Simple Minded Hashing

Even My O(n^3) solution was giving TLE and was really irritated with this...at last I found memset() is too slow for this problem..manual assigning gives me accepted... :) Try these Input: 13 170 8 100 26 351 16 200 5 2 23 323 14 156 12 12 0 0 Output: Case 1: 201413 Case 2: 61890 Case 3: 1 Case 4: 1...
by Imti
Wed Aug 17, 2011 10:34 pm
Forum: Volume 113 (11300-11399)
Topic: 11386 - Triples
Replies: 23
Views: 8398

Re: 11386 - Triples

I was Trying it with nlogn+n+n^2logn algorithm..but was getting TLE ..What I was doing is: 1)First,I sorted data 2)Then used Grouping Idea.By O(n) loop I made separate list of unique elements with their frequency 3)Then two nested loop: for(i=1;i<=n;i++) for(j=i+1;j<=n;j++) result+=Binary_search(a[i...
by Imti
Tue Aug 16, 2011 7:44 pm
Forum: Volume 112 (11200-11299)
Topic: 11283 - Playing Boggle
Replies: 19
Views: 7907

Re: 11283 - Playing Boggle

I was really tired of this problem..was getting WA repeatedly...Let me show what was giving me WA: I was taking Input Like Below: scanf("%d",&kase); getchar(); while(kase--) { getchar(); for(i=0;i<4;i++) gets(grid[i]); scanf("%d",&n); getchar(); while(n--) { gets(word); //rest of the code here } } A...

Go to advanced search