OJ Board

JohnTortugo

A few inputs:

Input:

6 1 2 3 5 4
6 1 5 3 2 4
1000 3000 2000 4000 6000 5000 7000
1000 2000 3000 6000 7000 5000 4000
1000 2000 3000 4000 5000 6000 7000 8000 9000 10000
1000 2000 3000 4000 5000 6000 7000 8000 9000 10000
7000 8000 9000 9500 3000
7000 8000 3000 9500 9000

Output:

Code: Select all

JohnTortugo

Anyone have more test cases?

brianfry713, my code passes all your test cases but gets WA from the judge =( , do you have any input with corner case?

JohnTortugo

I've coded it using STL Queue for DFS and it pass easy...

Also I think there isn't a test with no route, anyway my program prints 0x3f3f3f3f in decimal

Good luck, John.

JohnTortugo

Hi, I know its too late, but I'll apreciate if somebody can give me the correct output for the input case below

:

Code: Select all

3
5 6D 7D 8D 9D AH
5 6D 7D 8D 9D AH
5 6D 7D 8D 9D AH
5
5 6D 7D 8D 9D AH
5 6D 7D 8D 9D AH
5 6D 7D 8D 9D AH
4 6D 7D 8D AH
4 6D 7D 8D AH
0

Thank you very much.
John.

JohnTortugo

Hi.

Chirag, how are you doing that?

JohnTortugo

I was using texto = gets(), with texto being char[10000] and was getting wrong answer... after I switch it for c = getchar(), i got AC.

JohnTortugo

Hi all. I'm trying to solve this problem using Floyd Warshall... but I'm getting lots of wrong answers... I think the problem isn't with the floyd... but perhaps with the input.... I would apreciate if someone could give me some hint or input case that my program fails... below is my code. #include ...

JohnTortugo

Thanks mf and maxdiver, these links point me for what I was looking for.

JohnTortugo

How many different graphs are with V vertex? The graph should be: Directed, connected, with no self-loops and no "parallel-edges" (namely the same start-point and end-point). I'm trying to solve this problem for a long long time... I really would appreciate if someone can point me some hin...

JohnTortugo

Hi all.

thanks LIMON. I found my error, it was a "\n" at the end of output. I used only strcasecmp....

But now I'm confused... this shouldn't be a Presentation Error (the "\n" at the end)?

thanks. John.

JohnTortugo

No one know what is wrong with my code? I think it's a little mistake...

Thanks.

JohnTortugo

Hi guys, i'm getting lots of W.A in this problem, i really dont know what's wrong with my code. I'll be glad by any help. Thanks in advance. #include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> #include <inttypes.h> #include <ctype.h> #include <algorithm> #include <map> #incl...

JohnTortugo

Hello there! I'm trying the following algorithm: 1. Create a directed graph, using city names as vertices and travel time as edges. I ignore all travels that satisfies this condition: (dep > 6 && dep < 18) OR (dep+tt > 30). 2. Do Dijkstra algoritm. I'm using a stl map to lookup what's the ci...

JohnTortugo

Hello there. I'm getting W.A in this problem, can someone give me some test cases? below is my code. Thanks for any help. #include <iostream> #include <math.h> using namespace std; int main(void) { long long int n; long long int sq; long long int i=0, c=0; while (cin >> n && n >= 0) { if (i)...

JohnTortugo

Ok. Now it runs in 1.5s

Thanks anyway.

OJ Board

Search found 18 matches

Re: 548 getting TLE

Re: 11800 - Determine The Shape

Re: 10653 - Bombs! NO they are Mines!!

Re: 11035 - Card Hands

Re: 11569 - Lovely Hint

Re: 10082 - WERTYU

Re: 436 - Arbitrage - Clarify please

Re: How many graphs?

How many graphs?

Re: 10194 - Football (aka Soccer)

Re: 10194 - Football (aka Soccer)

Re: 10194 - Football (aka Soccer)

Re: 10187 - From Dusk till Dawn

Re: 10392 - Factoring Large Numbers

Re: 11462 - Ages Sort