【19.46%】【codeforces 551B】ZgukistringZ
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Professor GukiZ doesn’t accept string as they are. He likes to swap some letters in string to obtain a new one.
GukiZ has strings a, b, and c. He wants to obtain string k by swapping some letters in a, so that k should contain as many non-overlapping substrings equal either to b or c as possible. Substring of string x is a string formed by consecutive segment of characters from x. Two substrings of string x overlap if there is position i in string x occupied by both of them.
GukiZ was disappointed because none of his students managed to solve the problem. Can you help them and find one of possible strings k?
Input
The first line contains string a, the second line contains string b, and the third line contains string c (1 ≤ |a|, |b|, |c| ≤ 105, where |s| denotes the length of string s).
All three strings consist only of lowercase English letters.
It is possible that b and c coincide.
Output
Find one of possible strings k, as described in the problem statement. If there are multiple possible answers, print any of them.
Examples
input
aaa
a
b
output
aaa
input
pozdravstaklenidodiri
niste
dobri
output
nisteaadddiiklooprrvz
input
abbbaaccca
ab
aca
output
ababacabcc
Note
In the third sample, this optimal solutions has three non-overlaping substrings equal to either b or c on positions 1 – 2 (ab), 3 – 4 (ab), 5 – 7 (aca). In this sample, there exist many other optimal solutions, one of them would be acaababbcc.
【题目链接】:http://codeforces.com/contest/551/problem/B
【题解】
题中说a串可以任意交换两个字符。
其实就是说a串可以变成任意的字符;
所以原题意等价于给你a..z的26个字母,每个字母有若干个.
然后问你最多用这些字母组成几个b和c串.
剩余的字母随便输出就好.
可以这样。先全部给b用,全部给c用。
获取b串和c串最多能组成几个.
然后枚举b串组成了几个
再二分c串组成了几个.
l r
m = (l+r)>>1;
显然如果m情况下字母够用则可以增大m.否则减小m
而判断i个b串j个c串是否可以用所给字母表示则可以在O(26)搞出来;
所以复杂度就接近O(NlogN)吧。没问题的。
【完整代码】
#include <bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rei(x) scanf("%d",&x)
#define rel(x) scanf("%I64d",&x)
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
//const int MAXN = x;
const int dx[9] = {0,1,-1,0,0,-1,-1,1,1};
const int dy[9] = {0,0,0,-1,1,-1,1,-1,1};
const double pi = acos(-1.0);
string a,b,c;
map <char,int> dic,dic1,dic2;
int main()
{
//freopen("F:\\rush.txt","r",stdin);
cin >> a;
cin >> b;
cin >> c;
int lena = a.size();
rep1(i,0,lena-1)
dic[a[i]]++;
int lenb = b.size();
rep1(i,0,lenb-1)
dic1[b[i]]++;
int lenc = c.size();
rep1(i,0,lenc-1)
dic2[c[i]]++;
int num1 = 0,num2 = 0;
int mi=21e8;
rep1(i,1,26)
{
char ke = i+'a'-1;
if (dic1[ke] > 0)
mi = min(mi,dic[ke]/dic1[ke]);
}
num1 = mi;
mi=21e8;
rep1(i,1,26)
{
char ke = i+'a'-1;
if (dic2[ke] > 0)
mi = min(mi,dic[ke]/dic2[ke]);
}
num2 = mi;
int ans1 = 0,ans2 = 0,ans = 0;
rep1(i,0,num1)
{
int l = 0,r = num2,j=-1;
while (l <= r)
{
int m = (l+r)>>1;
bool ok = true;
rep1(k,1,26)
{
char ke = k+'a'-1;
int numi = i*dic1[ke]+m*dic2[ke];
if (numi>dic[ke])
{
ok = false;
break;
}
}
if (ok)
{
j = m,l = m+1;
}
else
r = m-1;
}
if (j!=-1 && ans < i+j)
{
ans1 = i;ans2 = j;
ans = i+j;
}
if (j==-1) break;
}
rep1(i,1,26)
{
char ke = i+'a'-1;
int numi = ans1*dic1[ke]+ans2*dic2[ke];
dic[ke]-=numi;
}
string s = "";
rep1(i,1,ans1)
s+=b;
rep1(i,1,ans2)
s+=c;
rep1(i,1,26)
{
char ke = i+'a'-1;
while (dic[ke]>0)
{
dic[ke]--;
s+=ke;
}
}
cout << s<<endl;
return 0;
}
【19.46%】【codeforces 551B】ZgukistringZ的更多相关文章
- 【 BowWow and the Timetable CodeForces - 1204A 】【思维】
题目链接 可以发现 十进制4 对应 二进制100 十进制16 对应 二进制10000 十进制64 对应 二进制1000000 可以发现每多两个零,4的次幂就增加1. 用string读入题目给定的二进制 ...
- 【19.77%】【codeforces 570D】Tree Requests
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【44.19%】【codeforces 608D】Zuma
time limit per test2 seconds memory limit per test512 megabytes inputstandard input outputstandard o ...
- 【codeforces 46C】Hamsters and Tigers
[题目链接]:http://codeforces.com/problemset/problem/46/C [题意] 给你一个长度为n的01串; 让你把所有的0放在一起,把所有的1放在一起; (即0都是 ...
- 【77.78%】【codeforces 625C】K-special Tables
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa ...
- 【30.43%】【codeforces 746C】Tram
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【codeforces 415D】Mashmokh and ACM(普通dp)
[codeforces 415D]Mashmokh and ACM 题意:美丽数列定义:对于数列中的每一个i都满足:arr[i+1]%arr[i]==0 输入n,k(1<=n,k<=200 ...
- 【.NET】传智播客第【19】期就业班视频(高清无加密)
[.NET]传智播客第[19]期就业班视频(高清无加密) 下载地址:http://fu83.cn/thread-85-1-1.html
- 【搜索】【并查集】Codeforces 691D Swaps in Permutation
题目链接: http://codeforces.com/problemset/problem/691/D 题目大意: 给一个1到N的排列,M个操作(1<=N,M<=106),每个操作可以交 ...
随机推荐
- javafx spring
javafx spring http://files.cnblogs.com/files/rojas/airhacks_control.zip
- Javascript 6 种继承
1.原型链继承 // 1.原型链继承的两个问题===>在借用构造函数中可以解决下下面的两个问题//problem: 在创建子类型的实例时,不能向超类型的实例传递参数(在这里就是不能向A()里传递 ...
- HDU 3232 && UVA 12230 (简单期望)
Crossing Rivers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...
- UVa 11015 - 05-2 Rendezvous
題目:有一個班級的學生要一起寫作業,所以他們要到一個統一的地點.現在給你他們各自的位置, 問集合地點定在哪,能够讓全部人走的總路徑長度最小. 分析:圖論.最短路.直接利用Floyd計算最短路,找到和值 ...
- 让人难过的 openssl_pkcs7_encrypt
让人难过的 openssl_pkcs7_encrypt 用PHP.NET的范例,没有加密结果,也没有报错信息,而openssl_pkcs7_sign()函数则返回 error opening inpu ...
- ubuntu-软件解压方法(转载)
一下内容转载自 http://blog.csdn.net/zad522/article/details/2770446 今天用到了ubuntu解压,所以就在网上查找了下方法.自己菜鸟一枚,收录别人的文 ...
- DBLINK做系统集
过度使用DBLINK做系统集成会带来的问题 过度使用DBLINK做系统集成会带来很多问题,问题主要由以下几点: 1. 大量消耗数据库资源: 本地系统每通过DBLINK链接远端系统一次,都会生成一个本地 ...
- 逆波兰法(计算器)程序<无括号版>
涉及队列.栈的运用. Java中队列可以用: Queue<String> q = new LinkedList(); 来声明,其主要的方法有: poll(),peak(),offer(), ...
- Python产生随机数组,测试用
import numpy as np if __name__ == '__main__': a=np.random.randint(0,10,size=[3,3]) print(a) 输出: [ ...
- php高并发秒杀解决方案
版权声明:本文为博主原创文章,未经博主允许不得转载. https://blog.csdn.net/super_runman/article/details/53037151 在秒杀.抢火车票等地方,我 ...