Search found 10 matches

by Santiago Zanella
Fri May 30, 2003 2:46 am
Forum: Other words
Topic: Submit - o -matic problems...
Replies: 1
Views: 812

The judge seems to be down

It's not that the reason because your submissions aren't been judged.
It seems that the judge is down, maybe Runtime Error(SIGSEV) =)
Look at the status:

15765507 -- Received -:--.--- -- 16132 JAVA 3645 -
by Santiago Zanella
Thu Nov 07, 2002 3:45 am
Forum: Volume 103 (10300-10399)
Topic: 10374 - Election
Replies: 44
Views: 15774

There is no trick.
I think I can hardly help you posting some input/output sets here.
If your algorithm manage ties correctly, the only thing left to do is to check input reading and reinitialization after each case. Remember you should be careful if you're mixing scanf and gets.
by Santiago Zanella
Thu Nov 07, 2002 3:28 am
Forum: Volume 103 (10300-10399)
Topic: 10369 - Arctic Network
Replies: 45
Views: 24934

Kruskal

I rewrote my implementation of the Union-Find data structure used by Kruskal Algorithm and I finally got Accepted. I was using a quite quick implementation with path-compression an union by rank, but although I remember testing it throughly it was somewhat faulty. As you say, there is absolutely no ...
by Santiago Zanella
Wed Nov 06, 2002 12:08 am
Forum: Volume 103 (10300-10399)
Topic: 10369 - Arctic Network
Replies: 45
Views: 24934

As likhan asks, why searching the MST of the graph doesn't solve this problem?
Maybe we misunderstood the problem... Could you give me some reason because it won't work?
by Santiago Zanella
Thu Oct 24, 2002 5:46 am
Forum: Volume 103 (10300-10399)
Topic: 10369 - Arctic Network
Replies: 45
Views: 24934

10369 - Arctic Network

I first compute the distance and add a corresponding edge between each pair of outposts. That is, I construct an undirected graph where edge weights are those distances. Then I apply Kruskal algorithm until P-S edges are added and print the weight of the last edge added. With this approach I get WA....
by Santiago Zanella
Thu Oct 24, 2002 3:27 am
Forum: Volume 103 (10300-10399)
Topic: 10368 - Euclid's Game
Replies: 14
Views: 6097

Did you try drawing a decision tree? If you didn
by Santiago Zanella
Fri Oct 11, 2002 5:44 am
Forum: Volume 8 (800-899)
Topic: 815 - Flooded!
Replies: 20
Views: 10504

Thank you cytse!
There was a little big error that wasn't shown in my test cases.
by Santiago Zanella
Thu Oct 10, 2002 2:07 am
Forum: Volume 8 (800-899)
Topic: 815 - Flooded!
Replies: 20
Views: 10504

Help checking solution

I wonder if someone that have already solved this problem could help me. There must be some tricky input or something wrong with my solution. Any help is welcome. [c] #include <stdio.h> #include <search.h> #include <math.h> /* Although the statement says that m and n will be less than 30, they can a...
by Santiago Zanella
Thu Oct 10, 2002 2:06 am
Forum: Volume 8 (800-899)
Topic: 815 - Flooded!
Replies: 20
Views: 10504

Posts can't be deleted but edited? uh
by Santiago Zanella
Tue Oct 01, 2002 11:49 pm
Forum: Volume 8 (800-899)
Topic: 847 - A Multiplication Game
Replies: 41
Views: 21272

Presentation Error

If I follow exactly the output specification of the statement I get a PE. The output is in fact pretty simple: Each line of input contains one integer number n. For each line of input output one line either Stan wins. or Ollie wins. I tried removing the dot at the end of each line and also removing ...

Go to advanced search