Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 39 views

    Printed Circuit Board: BOI 2010 Tartu Estonia Day: 1 Task: PCB Language: ENG

    Uploaded by

    DEVIL ADMIN
    The document describes the problem of minimizing the number of layers needed in a printed circuit board (PCB) to accommodate all required conductors. Conductors cannot cross between layers without causing shorts. The input specifies the endpoints of each conductor on a board, and the program must output the minimum number of layers needed. An example with one possible solution in a single layer and another requiring two layers are provided.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    Printed Circuit Board: BOI 2010 Tartu Estonia Day: 1 Task: PCB Language: ENG

    Uploaded by

    DEVIL ADMIN
    39 views1 page
    The document describes the problem of minimizing the number of layers needed in a printed circuit board (PCB) to accommodate all required conductors. Conductors cannot cross between layers without causing shorts. The input specifies the endpoints of each conductor on a board, and the program must output the minimum number of layers needed. An example with one possible solution in a single layer and another requiring two layers are provided.

    Original Description:

    Original Title

    pcb.eng

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the problem of minimizing the number of layers needed in a printed circuit board (PCB) to accommodate all required conductors. Conductors cannot cross between layers without causing shorts. The input specifies the endpoints of each conductor on a board, and the program must output the minimum number of layers needed. An example with one possible solution in a single layer and another requiring two layers are provided.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    39 views1 page

    Printed Circuit Board: BOI 2010 Tartu Estonia Day: 1 Task: PCB Language: ENG

    Uploaded by

    DEVIL ADMIN
    The document describes the problem of minimizing the number of layers needed in a printed circuit board (PCB) to accommodate all required conductors. Conductors cannot cross between layers without causing shorts. The input specifies the endpoints of each conductor on a board, and the program must output the minimum number of layers needed. An example with one possible solution in a single layer and another requiring two layers are provided.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    BOI

    2010 Day: 1
    Tartu Task: pcb
    Estonia Language: ENG

    Printed Circuit Board

    In a printed circuit board, conductive wires are laid on a non-conductive board. Because the
    conductors in the same layer cannot cross without creating short-circuits, boards with conductors
    divided into several layers separated by non-conductive board material are used in more complex
    cases. However, boards with more layers are more expensive. So, manufacturers try to allocate
    the required conductors to layers in a way that minimizes the number of layers needed.
    In this task we look at boards where each conductor is connecting two ports located on opposite
    edges of the board and seek to minimize the cost of such a board.
    Consider, for example, the board shown on the left on the figure below. If one conductor has
    to connect A to B and another D to C, this could be achieved in a single layer, as shown in the
    middle on the figure. But a conductor connecting A to C and another connecting D to B could
    not be laid out in the same layer, as can be seen on the right on the figure.

    B C B C B C

    A D A D A D

    Write a program that is given the locations of the endpoints of the N conductors on a W × H
    board and determines the minimal number of layers needed to accommodate all of them.
    It may be assumed the width of the conductors is very small compared to the distances between
    the ports. That is, between any two conductors, there is always enough room for a third one.
    Input. The first line of the text file pcb.in contains N (1 ≤ N ≤ 105 ), the number of connectors.
    Each of the following N lines contains two integers, Xi1 and Xi2 (0 ≤ Xij ≤ 106 ), separated by
    a space, meaning that the i-th conductor has to connect the points (Xi1 , 0) and (Xi2 , H). It
    may be assumed that all the 2 · N endpoints given in the input are distinct.
    Output. The first and only line of the text file pcb.out should contain a single integer, the
    minimal number of layers needed to accommodate all the required conductors.
    Sample. pcb.in pcb.out
    2 1
    1 1
    3 3
    Sample. pcb.in pcb.out
    2 2
    1 3
    3 1

    1/1

    You might also like