Search found 8 matches

by Sotek
Tue May 22, 2007 12:01 am
Forum: Volume 112 (11200-11299)
Topic: 11202 - The least possible effort
Replies: 8
Views: 4610

Thank you very much, finally I got AC with your input :)
by Sotek
Mon May 21, 2007 10:09 pm
Forum: Volume 112 (11200-11299)
Topic: 11202 - The least possible effort
Replies: 8
Views: 4610

Could ne1 give me some input ? my program seems to be ok but i can't get AC.

Please ne1 who got AC could post me the output for this input ?

8
6 1
6 2
7 7
8 4
9 9
10 10
11 11
12 6

Thank you in advance :)
by Sotek
Thu Jun 15, 2006 11:09 pm
Forum: Volume 7 (700-799)
Topic: 762 - We Ship Cheap
Replies: 51
Views: 19816

I got runtime error until I tried this input:

Code: Select all

1
AA BB
AA CC
the node CC doesn's exists so mi program looked for this and didn't find it.
if start node or end nod doesn's exists print No route :)

I hope it can help you to get AC :)
by Sotek
Sun Jun 11, 2006 5:48 pm
Forum: Volume 110 (11000-11099)
Topic: 11043 - Fast and Easy Data Compressor
Replies: 5
Views: 2122

The problem with signed char is due to a special spanish character used in the input whose value is greater than 127.

This is the character: Image
by Sotek
Sun Jun 11, 2006 5:29 pm
Forum: Algorithms
Topic: Gettin Memory Limit with BFS
Replies: 4
Views: 1574

ok shamim, thank you :)
by Sotek
Sun Jun 11, 2006 5:26 pm
Forum: Volume 7 (700-799)
Topic: 704 - Colour Hash
Replies: 23
Views: 13256

704

I'm trying to solve 704 but I'm gettin time limit. I'm using an iterative backtracking but I think I cannot optimize it more. Do you have any idea about solving this problem ? any other way ? Thank you in advance :) This is my code: #include <stdio.h> #include <string.h> /* Final state of the proble...
by Sotek
Thu Jun 08, 2006 12:25 am
Forum: Algorithms
Topic: Gettin Memory Limit with BFS
Replies: 4
Views: 1574

I've found the problem.
The queue got very big very soon because I did not check to expand a node just if it wasn't expanded previously.

Jus added this:

bool expandedNodes = new bool[n];

:)

Thank you for helping me asif_rahman0!
by Sotek
Mon Jun 05, 2006 12:10 am
Forum: Algorithms
Topic: Gettin Memory Limit with BFS
Replies: 4
Views: 1574

Gettin Memory Limit with BFS

First of all sorry about mi English cause is not very good :) I'm trying to solve the problem called "The mysterious X network", you can see it here: http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=3502 I'm using BFS but the judge doesn't accept the problem because of the memory us...

Go to advanced search