codeforces D. Triangle Coloring

最新推荐文章于 2024-05-31 18:03:22 发布

xiuxing05

最新推荐文章于 2024-05-31 18:03:22 发布

阅读量113

点赞数

分类专栏： codeforces 文章标签：算法 c++

本文链接：https://blog.csdn.net/xiuxing05/article/details/129106867

版权

一、题目：

You are given an undirected graph consisting of n� vertices and n� edges, where n� is divisible by 66. Each edge has a weight, which is a positive (greater than zero) integer.

The graph has the following structure: it is split into n3�3 triples of vertices, the first triple consisting of vertices 1,2,31,2,3, the second triple consisting of vertices 4,5,64,5,6, and so on. Every pair of vertices from the same triple is connected by an edge. There are no edges between vertices from different triples.

You have to paint the vertices of this graph into two colors, red and blue. Each vertex should have exactly one color, there should be exactly n2�2 red vertices and n2�2 blue vertices. The coloring is called valid if it meets these constraints.

The weight of the coloring is the sum of weights of edges connecting two vertices with different colors.

Let W� be the maximum possible weight of