Home/ Questions/Q 6865029
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-27T02:59:20+00:00

So I am working on a word problem, and it goes something like this:

  • 0

So I am working on a word problem, and it goes something like this:

! section removed

I am not posting the exact question or diagram just in case someone cannot stop themselves from posting a direct answer.

I am trying to write a program in Java for this, but I can’t really get a grip on how to do this logically. I know I can start of with an array for each square like this:

int square1 = //four sides with each liquid value

but I do not know how to include the unlimited ones (which are diagonal), or how to continue once I figure it out.

Any help with this programming logic is appreciated.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I’d say go through each pipe and record the maximum going through it, which should be the lower of its capacity or the sum of the maxima going into it. The unlimited ones then just take the total going into them (or, at the very beginning, Integer.MAX_VALUE). Or you could use a bool for tracking whether it’s infinite. Or, just for fun, Double.POSITIVE_INFINITY.

    Note that if there are any cycles in the pipes, you may need to cycle through and update a couple times, until you get a steady answer.

    Edit: After looking a bit at the max flow problem linked in a comment and thinking about it, I’m not so sure this is the right way to go, as I don’t think it accounts for splitting current between two outgoing pipes. Perhaps some distant relative of Ohm’s law, adapted for water?

    • 0