OJ Board

Could anyone post some inputs and outputs for this problem ?
By the way my program gives

6760

as output for the input above.
Thanks ...

INPUT :

6 3
5
6
12
19
20
27

1 1
1

2 1
0
10000
4 3
1
2
3
4

3 3
1
2
3

5 2
1
2
3
4
5

5 2
-5
-4
-3
-2
-1

5 1
1
2
3
4
5
0 0

OUTPUT :

Chain 1
Depot 1 at restaurant 2 serves restaurants 1 to 3
Depot 2 at restaurant 4 serves restaurants 5 to 6
Depot 3 at restaurant 6 serves restaurant 6
Total ...

Some I/Os generated with my Accepted code:

INPUT:

4383
886
2777
1915
2793
3335
386
492
1649
1421
2362
27
3690
59
2763
3926
540
3426
4172
736
211
368
2567
1429
782
1530
2862
123
4067
3135
3929
4802
4022
3058
3069
3167
1393
3456
11
3042
1229
2373
4421
4919
3784
3537
198
4324
3315
4370
1413
3526 ...

I've tried this problem but I've got WA, if someone please could post more inputs / outputs for this problem it would be great ...

I've tried the followings ...

INPUT :

12
165
1 2 3 2 1 1 5 1 1 1 1 10 1 4 4 41 4 4 1 43 4 4 4 41 4 4 42 4 4 1 13 1 1 1 2 3 2 1 11 1 1 1 1 1 19 1 4 4 41 4 4 1 4 34 ...

I'm not pretty sure I did this problem about 1 year and 6 months ago, if I can help you with i/o's or something please tell me.

They did help, thanks a lot ! I've got Acc. I was misunderstanding the problem.

I've got accepted, thanks for your help :D

I've got Accepted a few days ago ... , anyways the I/Os I posted are correct, I hope they help someone...

hi there again, I've been testing my program ... but still no clue of what is wrong,

These are some of the inputs/ outputs I've got ...

INPUTS

5 5
O....
....*
*...*
*..**
*.***

5 5
O....
*.*..
*....
*..**
*.**X

1 5
O***X

1 1
O

1 1
*

1 1
#

1 1
X

2 1
X
O

2 1
X
*
2 1
X
X

2 1
*
*

3 1
X
O ...

hi there!

I've passed your I/Os but I think the last input is invalid because it has more characters than the actually especified. Does this especial case in the judge exist ?

Now I'm doing the problem like a DP TSP...

I don't know what is wrong hehehe, do you know more special cases ?
thanks...

hi if someone could help me with MORE I/O, i'll apreciate it ...

I have some I/O I think they're right ...

INPUTS ...

15

20
101
207
155
143
512
335
108
977
567
201
188
311
112
0

6
200
200
400
400
0

1
200
100
0

1
100
200
0

1
100
100
0

1
10
20
30
40
50
0

50
2500
3000
1000
1000
1500
700 ...

I've found my mistake, and got Accepted ...

hi there could anyone tell me wich is the output for :

5
1 1 3 1 0.2
2 2 4 2 0
3 3 6 3 0.7
5 4 6 4 0.6
7 5 8 5 0.1


is ...

10
-inf 1.000 1.000
1.000 2.000 0.200
2.000 3.000 0.000
3.000 3.000 0.000
3.000 4.000 0.000
4.000 5.000 0.700
5.000 6.000 0.420
6.000 7.000 1.000
7.000 8.000 0.100
8.000 ...

I think it is a tsp problem, am I wrong ?
I just measured the distance between the initial point, and the treasures's points, and the from each point to each other point ...

then I just did a backtracking to know how many treasures can I reach before any machine could reach it.

If a machine can ...

avoid ... And just write ..