Codeforces Round #339 (Div. 1) C. Necklace 构造题
C. Necklace
题目连接:
http://www.codeforces.com/contest/613/problem/C
Description
Ivan wants to make a necklace as a present to his beloved girl. A necklace is a cyclic sequence of beads of different colors. Ivan says that necklace is beautiful relative to the cut point between two adjacent beads, if the chain of beads remaining after this cut is a palindrome (reads the same forward and backward).
Ivan has beads of n colors. He wants to make a necklace, such that it's beautiful relative to as many cuts as possible. He certainly wants to use all the beads. Help him to make the most beautiful necklace.
Input
The first line of the input contains a single number n (1 ≤ n ≤ 26) — the number of colors of beads. The second line contains after n positive integers ai — the quantity of beads of i-th color. It is guaranteed that the sum of ai is at least 2 and does not exceed 100 000.
Output
In the first line print a single number — the maximum number of beautiful cuts that a necklace composed from given beads may have. In the second line print any example of such necklace.
Each color of the beads should be represented by the corresponding lowercase English letter (starting with a). As the necklace is cyclic, print it starting from any point.
Sample Input
3
4 2 1
Sample Output
1
abacaba
Hint
题意
你有n个颜色的珠子,你要把所有珠子都穿成一个圆环
然后你可以从圆环的某一个地方剪开,使得这个链是一个回文串
然后问你怎么样去构造那个圆环,可以使得构成回文串的链最多
题解
考虑对称性,如果答案是ans的话,那么这ans刀一定是等分这个圆环的
每一个块内的珠子数量肯定是相同的
那么显然要满足这两个特性,ans = gcd(a[i])
有两个特殊情况需要考虑
如果存在大于1个颜色的珠子为奇数的话,答案为0,显然
如果有一个颜色的珠子为奇数的话,只要把这个珠子放在中间就好了,相当于把其他的偶数都砍一半,然后去摆放。
代码
#include<bits/stdc++.h>
using namespace std;
int p[30];
int odd = 0;
int gcd(int a,int b)
{
if(b==0)return a;
return gcd(b,a%b);
}
int main()
{
int n;scanf("%d",&n);
int t = 0;
for(int i=0;i<n;i++)
{
scanf("%d",&p[i]);
if(p[i]%2==1)t=i,odd++;
}
if(odd>1)
{
printf("0\n");
for(int i=0;i<n;i++)
for(int j=0;j<p[i];j++)
printf("%c",'a'+i);
printf("\n");
return 0;
}
if(odd==1)
{
int ans = 0;
for(int i=0;i<n;i++)
{
if(i==t)ans=gcd(p[i],ans);
else ans=gcd(p[i]/2,ans);
}
printf("%d\n",ans);
for(int i=0;i<ans;i++)
{
for(int j=0;j<n;j++)
for(int k=0;k<p[j]/ans/2;k++)
printf("%c",'a'+j);
printf("%c",'a'+t);
for(int j=n-1;j>=0;j--)
for(int k=0;k<p[j]/ans/2;k++)
printf("%c",'a'+j);
}
}
else
{
int ans = 0;
for(int i=0;i<n;i++)
ans=gcd(p[i],ans);
printf("%d\n",ans);
for(int i=0;i<ans/2;i++)
{
for(int j=0;j<n;j++)
for(int k=0;k<p[j]/ans;k++)
printf("%c",'a'+j);
for(int j=n-1;j>=0;j--)
for(int k=0;k<p[j]/ans;k++)
printf("%c",'a'+j);
}
}
}
Codeforces Round #339 (Div. 1) C. Necklace 构造题的更多相关文章
- Codeforces Round #524 (Div. 2)(前三题题解)
这场比赛手速场+数学场,像我这样读题都读不大懂的蒟蒻表示呵呵呵. 第四题搞了半天,大概想出来了,但来不及(中途家里网炸了)查错,于是我交了两次丢了100分.幸亏这次没有掉rating. 比赛传送门:h ...
- Educational Codeforces Round 7 D. Optimal Number Permutation 构造题
D. Optimal Number Permutation 题目连接: http://www.codeforces.com/contest/622/problem/D Description You ...
- Codeforces Round #339 (Div.2)
A. Link/Cut Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard in ...
- Codeforces Round #339 (Div. 1) A. Peter and Snow Blower 计算几何
A. Peter and Snow Blower 题目连接: http://www.codeforces.com/contest/613/problem/A Description Peter got ...
- Codeforces Round #339 (Div. 2) B. Gena's Code 水题
B. Gena's Code 题目连接: http://www.codeforces.com/contest/614/problem/B Description It's the year 4527 ...
- Codeforces Round #339 (Div. 2) A. Link/Cut Tree 水题
A. Link/Cut Tree 题目连接: http://www.codeforces.com/contest/614/problem/A Description Programmer Rostis ...
- Codeforces Round #181 (Div. 2) A. Array 构造
A. Array 题目连接: http://www.codeforces.com/contest/300/problem/A Description Vitaly has an array of n ...
- Codeforces Round #306 (Div. 2) ABCDE(构造)
A. Two Substrings 题意:给一个字符串,求是否含有不重叠的子串"AB"和"BA",长度1e5. 题解:看起来很简单,但是一直错,各种考虑不周全, ...
- Codeforces Round #298 (Div. 2) D. Handshakes 构造
D. Handshakes Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/534/problem ...
随机推荐
- flask_返回字节流错误
# flask_返回字节流错误 def export_data(filename, fields, data, names=None, sheet='Sheet1'): # fields 为list ...
- [Leetcode Week12]Unique Paths II
Unique Paths II 题解 原创文章,拒绝转载 题目来源:https://leetcode.com/problems/unique-paths-ii/description/ Descrip ...
- 刷新SqlServer数据库中所有的视图
ALTER PROCEDURE sp_refallview AS --刷新所有视图 DECLARE @ViewName VARCHAR(MAX); DECLARE @i INT; ; DECLARE ...
- python接口自动化13-data和json参数傻傻分不清【转载】
转至博客:上海-悠悠 前言 在发post请求的时候,有时候body部分要传data参数,有时候body部分又要传json参数,那么问题来了:到底什么时候该传json,什么时候该传data? 一.识别j ...
- git+jenkins在windows机器上新建一个slave节点【转载】
转至博客:上海-悠悠 前言 我们在跑自动化项目的时候,希望有单独的测试机能跑自动化项目,并且能集成到jenkins上构建任务.如果公司已经有jenkins环境了,那无需重新搭建. 只需在现有的平台基础 ...
- 通过javascript进行UTF-8编码
通过javascript进行UTF-8编码 javascript的字符集: javascript程序是使用Unicode字符集编写的.Unicode是ASCII和Latin-1的超集,并支持地球上几乎 ...
- Genymotion的2个问题及解决方法
问题一:Unable to connect to your virtual device 解决方法:基本都是内存不够导致的,在virtualbox中调整对应虚拟机的内存,确保任务管理器中的性能一项中剩 ...
- django使用MySQL时部分配置
若是Django中使用MySQL,需要在项目名文件目录下(而不是应用文件)的__init__.py文件中添加: import pymysqlpymysql.install_as_MySQLdb()
- python的ipython manage.py shell 引发的 No module named _argparse
环境是:Centos6.6 ,python 2.6 今晚,shell 中输入: # ipython manage.py shell 报错,说找不到命令: 我当时,觉得,我有可能没有安装ipython ...
- 判断数独是否合法(LintCode)
判断数独是否合法 请判定一个数独是否有效. 该数独可能只填充了部分数字,其中缺少的数字用. 表示. 样例 下列就是一个合法数独的样例. 注意 一个合法的数独(仅部分填充)并不一定是可解的.我们仅需使填 ...