##### Canadian Computing Competition: 2010 Stage 1, Senior #4

You are running a farm which has () animals. You went to the store and bought pre-made pens that will house your animals. Pens satisfy the following conditions:

- pens have between and edges;
- an edge that is specified by two pens connects the two pens;
- an edge that is specified only once connects that pen to the outside;
- there is exactly one animal in each pen and no animals outside the pens, initially.

The animals, however, have a game they like to play called "Escape from the pen." They assign a cost to each edge of the pen, and they determine the minimum cost for all of the animals to meet in the same area by trampling over the edge of various pens. The animals may meet inside a particular pen or outside of all the pens. Also note that once an edge has been trampled, any animal may pass over it without incurring any cost.

You will be given a description of the pens, along with the placement of animals, and you are to figure out what the smallest cost is to move all the animals into the same area.

#### Input Specification

The first line of input will be the integer , the number of pens. On the next lines, there will be a description of each pen, with one description per line. The description is composed of three components, with each component separated by one space, as follows:

- the first component is an integer (), which describes the number of edges for this particular pen ;
- the second component is a sequence of integers describing the corners of each pen, where each integer is less than or equal to ;
- the third component is a sequence of integers describing the cost of each edge, where each integer is less than or equal to .

For the corner and edge cost description, the descriptions are given in cyclical order. For example, the following description of a pen

means that there are three corners, and thus, three edges, where the edge has cost , the edge has cost and the edge has cost . Note: at least 20% of the marks for this question have and no pen will have more than four edges in these cases.

**Note: Due to the official test data being weak, additional test data worth 50 marks has been uploaded. Credit goes to ** for noticing the issue and to for helping sanity check and add data.

#### Output Specification

On one line, output the minimal cost that will allow all the animals to gather in one pen or outside all of the pens.

#### Sample Input

```
4
3 1 2 3 7 4 6
4 1 2 4 5 7 7 2 6
4 4 7 6 5 4 8 9 2
5 3 2 4 7 8 4 7 4 7 7
```

#### Output for Sample Input

`10`

#### Explanation of Output for Sample Input

The diagram below explains the input data:

where the circled numbers are the corners, and the numbers in *italics* are the edge costs. Notice that if the edges , and are removed, all the animals can meet in the pen which has five sides.

## Comments

Are we finding a minimal spanning tree of the dual of the multigraph the pens form? If so, we can use Kruskal's or other algorithms.

Have they added new test cases? Could've sworn I AC'd this.

Edit: nvm can't read

Why are we allowing the animals to do this again?

This comment is hidden due to too much negative feedback. Click here to view it.

This comment is hidden due to too much negative feedback. Click here to view it.

There are likely two things going on here.

Firstly, people are much more likely to complain about the input format of S5 than of S4, and in fact the comment pointing out some unexpected issues with the input is upvoted precisely because it's addressing a huge pain point of the problem. The input format of S4 is actually not that unreasonable, expressing pens by their vertices. It might not be desirable once you have a way to solve the problem, but in comparison to S5, it's really not that bad. The input format of S5 could have been avoided by expressing the tree in a more modern format, with labeled vertices connected by edges instead of the provided string representation, and I think many people would therefore claim that figuring out how to handle the S5 input is harder than figuring out how to handle the S4 input.

Secondly, I think a lot of people who are working their way up to solving this problem would disagree with the assessment that handling the input is the hardest part of the problem. This problem isn't actually substantially easier if the input is given in a different format, you still need to actually come up with an algorithm to find the minimum cost, and a lot of people are likely to find that much harder than figuring out how to handle the input. Complaining about the input format of S4 as the hardest part of the problem comes off as implicitly bragging that the algorithmic component of the problem is trivial in comparison to handling the input, and is likely to garner downvotes as a consequence.

This comment is hidden due to too much negative feedback. Click here to view it.

I can assure you that chika knows how to solve this problem (and there are also other sources where this problem exists). While they often prefer to post anonymously, they are a fairly well respected person internationally in the competitive programming community and their comments are not something that should be immediately dismissed.

i study the code from 'aurpine', and find out that his/her code cannot run the sample input/output correctly! because the graphs in all of the test data are NOT connected, but the graph in sample input is connected. can u fix that?

Passed all test cases but not SAMPLE explanation request

In the sample all the pens were together in one group. It just so happened that in all of the test cases the pens were in two or more different clusters.

Can costs be negative?

The question doesn't say that the cost has to be positive

No. I highly doubt that.

I don’t understand what this means, what would a sample input of a pen connected to the outside be?

means that if you see the specific edge in the input only once that means it must connect the pen to the outside (i.e you don't see the edge again in another pen's description)

Lol Bryan didn't know you're moved to Thornhill S.S., welcome aboard, we meet Thursdays

LOL, i m in Thornhill S.S. virtually :)

Image link is broken.

Fixed.