103 - Stacking Boxes

Moderator: Board moderators

--X--
New poster
Posts: 1
Joined: Mon Apr 08, 2002 4:28 am
Contact:

103 - Stacking Boxes

Does anyone have an insight into some trick the judges input may have. The problem is a straightforward longest path algorithm, which makes me wonder why I keep getting WA.

Thnx for any help
FireDragon
New poster
Posts: 4
Joined: Fri Apr 05, 2002 2:00 am
Location: HeBei,China
Your algorithm is the same as mine----1)Sort the boxes' dimensions 2)Get the longest path.And My solution was accepted two days ago.
Goodluck.
chang
New poster
Posts: 16
Joined: Wed Jan 16, 2002 2:00 am

It was my mistake:when the maximum no of box is 1... I printed 0 wronlgly...
Did u check this input....
hsihsiwu
New poster
Posts: 9
Joined: Fri Apr 12, 2002 2:27 am
If input is 6 1, what is answer?
C8H10N4O2
Experienced poster
Posts: 137
Joined: Wed Feb 27, 2002 2:00 am
If input is

Code: Select all

``````6 1
``````
Output should be

Code: Select all

``````1
1
``````
hsihsiwu
New poster
Posts: 9
Joined: Fri Apr 12, 2002 2:27 am
Thanks. I got it.
ositruc
New poster
Posts: 1
Joined: Fri May 24, 2002 4:36 am
Location: University of Alberta

103 - Why does it time out?

My program seems to work for any test case I give it, within the boundaries specified by the problem statement. However when I submit my code the online-judge times out. Does anyone have any idea what input they are using that could time out my program?
"Arrrrr! I'm a pirate!"
-Pirate.
New poster
Posts: 1
Joined: Wed May 29, 2002 3:34 am
Contact:

103 yellow check mark???

What exactly does the yellow check mark mean next to the problem? Apparently it's affecting my program because it works for every test case I use, but got wrong answer from the judge. Does any know any special things in the input?

--Matthew
ftomi
Learning poster
Posts: 64
Joined: Sun Jan 06, 2002 2:00 am
Location: Hungary
Contact:
The yellow colour means a special correction program for that problem. It's because there are more solution.
Melon Melon
New poster
Posts: 17
Joined: Fri May 31, 2002 6:30 pm
Contact:

Question on 103

[c]
Would anyone give me hints on solving question 103??
I have that a silly way to do it, but don't know how to continue it or my way is wrong.
I first sort the dimensions of each box and then try to find out each boxes which can hold the next box......but if I do in this way, the codes will be very complicated.
cyfra
Experienced poster
Posts: 144
Joined: Thu Nov 22, 2001 2:00 am
Location: Gdynia, Poland

Hi!

Hi!

Yes of course you have good idea....

Just try to look at this problem as a graph...
( But you will not have to implement it )
so there is a line beetween two boxes if you can put one into another..

This graph is one-way graph and it has no cycles...

So now you have only to count the longest path in such a graph...
Which is quite easy...

So don't worry that your program will be very complicated..
It only has to work

Good Luck

PS.

Next time try not to use table for C code for normal writing..
Melon Melon
New poster
Posts: 17
Joined: Fri May 31, 2002 6:30 pm
Contact:

Thanks a lot!!! ^^

Ths!!Ths!!
obayashi
New poster
Posts: 33
Joined: Thu Jun 20, 2002 1:18 pm

...

maybe u use brute force to search for the result.

post yr code here pls...
Time makes a fool of memory
And yet my memories still shine
Revenger
Experienced poster
Posts: 132
Joined: Sun Apr 14, 2002 12:27 pm
Location: Russia

103 DP

You must use DP or DFS to solve this problem. If realy want help then post your source code.
dawynn
New poster
Posts: 47
Joined: Fri Jun 21, 2002 3:08 pm
Does anyone have any suggestions on tricky cases to try?