welcome: please sign in

Upload page content

You can upload content for the page named below. If you change the page name, you can also upload content for another page. If the page name is empty, we derive the page name from the file name.

File to load page content from
Page name
Comment

location: ProblemsDescription / PartnerUnitsPolynomial

Partner Units Polynomial

Problem description

Partner unit problem describes a people counting system.

The problem includes three types of components, namely a door sensor, a zone and a communication unit. The problem requirements are:

  1. Each zone as well as each door sensor must be connected to exactly one unit;
  2. Each unit can control at most two door sensors and at most two zones;
  3. If a unit controls a door sensor that contributes to a zone controlled by another unit, then the two units must be connected directly, i.e. one unit becomes a partner unit of the other and vice versa;
  4. Each unit can have at most maxPU partner units which is constant for each problem instance.

The solution of the partner unit problem is defined as follows:

Input format

Output format

Example

Author(s)