Search found 13 matches

by SyFy
Fri Jul 20, 2012 8:54 pm
Forum: Volume 7 (700-799)
Topic: 762 - We Ship Cheap
Replies: 51
Views: 20174

Re: 762 - We Ship Cheap

Got AC.
Input:

Code: Select all

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! :D
by SyFy
Mon Jul 02, 2012 11:42 pm
Forum: Volume 117 (11700-11799)
Topic: 11733 - Airports
Replies: 23
Views: 7450

Re: 11733 - Airports

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.
by SyFy
Mon Jul 02, 2012 10:28 pm
Forum: Volume 8 (800-899)
Topic: 825 - Walking on the Safe Side
Replies: 38
Views: 20421

Re: 825 - Walking on the Safe Side

last line of output should be an empty line :evil:
by SyFy
Sun Jul 01, 2012 6:10 pm
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 19876

Re: 103 problem ...

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
by SyFy
Sun Jul 01, 2012 5:14 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 36351

Re: 10000 - Longest Path

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! :D
by SyFy
Sat Jun 30, 2012 7:00 pm
Forum: Volume 103 (10300-10399)
Topic: 10308 - Roads in the North
Replies: 30
Views: 9750

Re: 10308 - Roads in the North

My AC program gives another output :

Code: Select all

22
0
0
22
suneast wrote:faint :o
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 :wink:
by SyFy
Sat Jun 30, 2012 12:51 am
Forum: Volume 117 (11700-11799)
Topic: 11733 - Airports
Replies: 23
Views: 7450

Re: 11733 - Airports

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 ? :roll:
brianfry713 wrote:You should print a newline at the end of the last line on most problems.
by SyFy
Fri Jun 29, 2012 4:50 pm
Forum: Volume 117 (11700-11799)
Topic: 11733 - Airports
Replies: 23
Views: 7450

Re: 11733 - Airports

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, used.ca...
by SyFy
Thu Jun 28, 2012 11:57 pm
Forum: Bugs and suggestions
Topic: 334 - Identifying Concurrent Events.. PE!!
Replies: 10
Views: 10072

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

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,X2Xconc...
by SyFy
Thu Jun 28, 2012 2:34 pm
Forum: Volume 8 (800-899)
Topic: 869 - Airline Comparison
Replies: 7
Views: 4953

Re: 869 - Airline Comparison

:D 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!
by SyFy
Wed Jun 27, 2012 2:47 pm
Forum: Volume 100 (10000-10099)
Topic: 10048 - Audiophobia
Replies: 27
Views: 9593

Re: 10048 - Audiophobia

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. :D

Thx.
by SyFy
Thu Jun 21, 2012 6:16 pm
Forum: Volume 114 (11400-11499)
Topic: 11492 - Babel
Replies: 18
Views: 10509

Re: 11492 - Babel

: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 st...
by SyFy
Wed Jun 20, 2012 11:32 pm
Forum: Volume 3 (300-399)
Topic: 341 - Non-Stop Travel
Replies: 38
Views: 11585

Re: 341 Non-Stop Travel

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 AC.

Go to advanced search