Difference between revisions of "2018-2019 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2018)"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
Line 46: | Line 46: | ||
Solved by Xiejiadong. | Solved by Xiejiadong. | ||
+ | |||
+ | 题意:给出00、01、10、11子序列的个数,构造符合题意的01串。 | ||
+ | |||
+ | 题解:首先根据00和01可以计算出0和1的个数。 | ||
+ | |||
+ | 假设0的个数为$x$,1的个数为$y$,当且仅当$b+c=xy$的时候有解。当然,不存在这样的$x$、$y$也无解。 | ||
+ | |||
+ | 然后就是考虑怎么构造$b$的个数,线吧素偶有的1放在0前面,此时$b=0$,然后暴力的把1移到所有的0后面,每次$b+=x$,最后剩下$b%x$,表示最后一个1前面0的个数。 | ||
+ | |||
+ | 需要注意$a=0$的情况有两种可能,$x=0$或者$x=1$,$d$的情况也是如此。 | ||
+ | |||
+ | 注意特判$a=0,b=0,c=0,d=0$的情况 | ||
=== Problem K === | === Problem K === | ||
Solved by dreamcloud. | Solved by dreamcloud. |
Revision as of 02:49, 6 November 2018
One,Two,Three,AK
Xiejiadong签到失败。
dreamcloud全场最佳。
Problem A
Unsolved.
Problem B
Solved by Xiejiadong.
签到题,题意有毒。
Problem C
Solved by dreamcloud.
Problem D
Solved by dreamcloud.
Problem E
Solved by oxx1108.
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Solved by dreamcloud.
Problem I
Solved by dreamcloud.
Problem J
Solved by Xiejiadong.
题意:给出00、01、10、11子序列的个数,构造符合题意的01串。
题解:首先根据00和01可以计算出0和1的个数。
假设0的个数为$x$,1的个数为$y$,当且仅当$b+c=xy$的时候有解。当然,不存在这样的$x$、$y$也无解。
然后就是考虑怎么构造$b$的个数,线吧素偶有的1放在0前面,此时$b=0$,然后暴力的把1移到所有的0后面,每次$b+=x$,最后剩下$b%x$,表示最后一个1前面0的个数。
需要注意$a=0$的情况有两种可能,$x=0$或者$x=1$,$d$的情况也是如此。
注意特判$a=0,b=0,c=0,d=0$的情况
Problem K
Solved by dreamcloud.