OJ Board

Can someone with an ACCEPTED problem please give me the correct output for this :

50
20 13 18 2 1 2 16 6 4 15 6 5 3 9 2 20 9 5 6 16 15
20 6 10 9 16 10 9 6 1 18 4 16 2 13 17 15 6 12 12 10 19
20 17 6 1 6 7 13 14 4 18 1 10 15 11 19 2 20 19 7 12 16
20 3 7 10 7 4 4 13 7 15 14 5 3 19 6 8 18 18 13 1 ...

These cases do not exist.

I've asserted my program to check for that .

But I still get Wrong Answer anyway ... don't know why (actually, i've got no idea why)

I'm looking for good Inputs !!!!!!!!!! please all you accepted people !

here's my test input

MTA London 4 Fiona Paul Heather Nevil ...

Does anybody have a NICE input for this problem ?

I'm tired of getting non-sense WAs

I've tried everything I could think of .. but still WA

Could be that also, but the values in question are around 10 (like 7 and 5). My min function is the following :

Fixed and ACCEPTED =P

thanks junjieliang !!!!!!!!!

but , this brought some curiosity to me ... the only thing I changed was :

j = (min(f, t)*2) - 1;

into :

j = min(f, t);

and after all calculations ..

j = j*2-1

what possible difference can it make ?

Ok, let me start with the INPUT / OUTPUT for this problem.

For the following Input :

10
1 2 3 4 5 4 3 2 1 10
19
1 2 3 2 1 2 3 4 3 2 1 5 4 1 2 3 2 2 1
5
1 2 3 4 5
19
1 2 3 7 8 2 3 4 3 2 1 5 4 1 2 3 2 2 1
1
1
1
5
22
1 2 3 2 8 9 10 2 3 4 3 2 1 5 4 1 2 3 6 2 2 1
7
1 4 2 3 2 4 1
4
1 3 6 5
20
13 7 5 ...

I did a O(n*m) where m is the largest increasing subsequence size. And it passed time okay, but I'm getting WA.

Is there any trick input ? Could somebody throw in some INPUTs with correct OUTPUTs ?

Thanks !

That's a good question for Revilla

if you handle the I/O above, then your program is handling correctly disconnected graphs, don't worry about that, your problem may be elsewhere ...

Here's what you're looking for :

6
sugarloaf
maracana
copacabana
ipanema
corcovado
lapa
7
ipanema copacabana
copacabana sugarloaf
ipanema sugarloaf
maracana lapa
sugarloaf maracana
corcovado sugarloaf
lapa corcovado
5
guanabarabay
downtown
botanicgarden
colombo
sambodromo
4
guanabarabay ...

How does the input with n = 0 looks like ?
or something else ?

And what's the expected output for that ?

my (WA) program outputs this :

I'm still trying to understand the problem statement. During the contest I was convinced that once I played mission X, I couldn't play any mission < X anymore. But now it's explained that I can if I restart the game. Ok.

Now I try to figure out some strange things:

- What's the use of the mission ...

kmhasan,

My problem is ACCEPTED but I'd like to bring something into discussion here

From what I understand of the problem statement, if i have two edges AB, that means I have 2 different ways to get to B, from A. That said, different paths should receive different numbers.

As any ordering ...

Alright :-)
My problem was not sorting the ones who submitted but didn't score.

Here's a test case for you :

1

38 1 0 C
48 1 1 R
83 1 2 E
89 9 3 R
7 5 4 R
68 1 5 U
61 1 6 U
27 1 7 R
21 7 8 R
55 2 9 I
54 1 10 U
69 1 11 C
59 2 12 I
43 3 13 I
7 9 14 R
84 6 15 R
52 8 16 C
32 7 17 C
87 7 18 U
44 1 ...

I getting WA with this problem, and I've tested it in every possible way i've foreseen :-(

Could somebody put in some test data ?

My test is :


I 5 6
L 2 3 A
S one.bmp
F 3 3 J
V 2 3 4 W
H 3 4 2 Z
S two.bmp
I 50 50
C
F 10 10 B
S TESTE0.KAR
H 1 10 2 X
S TESTE1.KAR
V 5 1 10 X
S TESTE.FUL
F 5 2 U ...