Difference between revisions of "2019 Multi-University,Nowcoder Day 6"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
Line 25: | Line 25: | ||
Solved by Xiejiadong. 04:17:25 (+) | Solved by Xiejiadong. 04:17:25 (+) | ||
+ | 题解:构造一个图,与它的补图同构。 | ||
+ | |||
+ | 题解:考虑对点的数量按照奇偶分类。 | ||
+ | |||
+ | 偶数个点,分成两类,其中一类变成团,然后团之间奇偶相同的点连边。 | ||
+ | |||
+ | 奇数个点,拿出其中一个点,剩下的点按照偶数的连边,多的一个点像其中的一类点,全部连边。 | ||
== Problem F == | == Problem F == |
Revision as of 11:59, 3 August 2019
Problem A
Solved by Kilo_5723. 00:09:05 (+)
Problem B
Solved by Xiejiadong. 01:01:25 (+1)
题意:IP v6 二进制转十进制,每一段的前缀 $0$ 可以省略,连续的大于等于两段 $0$ 可以用 :: 表示,求最短的表示方式,最短的情况下保证字典序最小。
题解:直接讨论有点麻烦还可能容易锅,把所有连续的大于等于两段 $0$ 可以用 :: 表示的可行方案都处理出来。
然后排序就好了。
Problem C
Unsolved. (-1)
Problem D
Solved by Weaver_zhu && Kilo_5723. 01:56:52 (+2)
Problem E
Solved by Xiejiadong. 04:17:25 (+)
题解:构造一个图,与它的补图同构。
题解:考虑对点的数量按照奇偶分类。
偶数个点,分成两类,其中一类变成团,然后团之间奇偶相同的点连边。
奇数个点,拿出其中一个点,剩下的点按照偶数的连边,多的一个点像其中的一类点,全部连边。
Problem F
Unsolved.
Problem G
Upsolved by Weaver_zhu. (-20)
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Solved by Kilo_5723. 00:51:40 (+)