OJ Board

SyFy

Got AC.
Input:

0
AA BB

1
AA BB
CC BB

1
AA BB
GG PP

2
AA BB
BB CC
GG GG

4
AB JK
PO LK
QW PO
LK AB
AB PO

output (with all needed newlines):

Code: Select all

No route

No route

No route



AB LK
LK PO

good luck!

SyFy

yep. but its very sad when you get WA and dont know whats wrong: algo or output.

brianfry713 wrote:Yes it matters how many newlines you print. Don't count on ever getting PE. On a lot of problems extra or missing whitespace will give you WA.

SyFy

last line of output should be an empty line

SyFy

this test helped me:

input:

Code: Select all

2 2
10 15
5 15

output:

Code: Select all

1
1

or

Code: Select all

1
2

SyFy

got ac with FW ... but before that got 4 WAs 'cause I forgot to print \n\n after each line of output.
it should be something like this: out.printf("Case 1: The longest path from 1 has length 2, finishing at 4.\n\n");

good luck!

SyFy

My AC program gives another output :

Code: Select all

suneast wrote:faint
I think the judge's data have changed....
Code: Select all
5 1 6
1 4 5
6 3 9
2 6 8
6 1 7




5 1 6
1 4 5
6 3 9
2 6 8
6 1 7
and the output should be
Code: Select all
22
0
0
0
22
hope I am help to you all

SyFy

does it matter for instance if I will print 2 newlines ? and how can I know that when I am getting WAs in JAVA its not PE ?

brianfry713 wrote:You should print a newline at the end of the last line on most problems.

SyFy

OMG! :lol: Solved it with JAVA in 0.892.

But its really frustrating... had this code first:

if(i != t - 1)
out.printf("Case #%d: %d %d\n", i + 1, totalCost + (long)used.cardinality() * a, used.cardinality());
else out.printf("Case #%d: %d %d", i + 1, totalCost + (long)used.cardinality() * a ...

SyFy

Thx.
Solved this task, but I really... really... really HATE such problems with such output :D

After Getting More PE ..finally Got It Accepted..... :D
What I did is
You just have to print an extra space after each pair of concurrent events.Look at the example(Lets denote space as 'X')

CaseX1 ...

SyFy

this should help others

input:

Code: Select all

1

5
# $
A 0
D #
* B
@ F

3
A D
h &
0 8

output:

Code: Select all

NO

good luck!

SyFy

Solved this problem with DSU + Kruskal + Floyed... is it ok?
Accepted JAVA 0.640

pls tell me how to solve this problem using only Floyed algo.

Thx.

SyFy

:D nice problem! Solved it with Dijkstra + Java in 1.020

Used priority queue and stored in it three values (toNodeId, ch, len), where:
toNodeId - node id to which this edge goes
ch - first character of the word "on" this edge
len - current path len

the main problem I think was to guess the way to ...

SyFy

Hello!
Can somebody provide me tricky testcases pls... I am getting WA, but checked my code many times - nothing. Checked with extra '\n', without '\n', path generation - its all ok. :roll:

Link to ideone.com code and here:

got AC... dont know what was wrong... rewrote my code from scratch and ...

OJ Board

Search found 13 matches

Re: 762 - We Ship Cheap

Re: 11733 - Airports

Re: 825 - Walking on the Safe Side

Re: 103 problem ...

Re: 10000 - Longest Path

Re: 10308 - Roads in the North

Re: 11733 - Airports

Re: 11733 - Airports

Re: 334 - Identifying Concurrent Events.. PE!!

Re: 869 - Airline Comparison

Re: 10048 - Audiophobia

Re: 11492 - Babel

Re: 341 Non-Stop Travel