Codeforces Round #545 (Div. 2) D. Camp Schedule（KMP next数组使用）

time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp’s schedule. After some continuous discussion, they came up with a schedule s, which can be represented as a binary string, in which the i-th symbol is ‘1’ if students will write the contest in the i-th day and ‘0’ if they will have a day off.

At the last moment Gleb said that the camp will be the most productive if it runs with the schedule t (which can be described in the same format as schedule s). Since the number of days in the current may be different from number of days in schedule t, Gleb required that the camp’s schedule must be altered so that the number of occurrences of t in it as a substring is maximum possible. At the same time, the number of contest days and days off shouldn’t change, only their order may change.

Could you rearrange the schedule in the best possible way?

Input
The first line contains string s (1⩽|s|⩽500000), denoting the current project of the camp’s schedule.

The second line contains string t (1⩽|t|⩽500000), denoting the optimal schedule according to Gleb.

Strings s and t contain characters ‘0’ and ‘1’ only.

Output
In the only line print the schedule having the largest number of substrings equal to t. Printed schedule should consist of characters ‘0’ and ‘1’ only and the number of zeros should be equal to the number of zeros in s and the number of ones should be equal to the number of ones in s.

In case there multiple optimal schedules, print any of them.

Examples
inputCopy
101101
110
outputCopy
110110
inputCopy
10010110
100011
outputCopy
01100011
inputCopy
10
11100
outputCopy
01
Note
In the first example there are two occurrences, one starting from first position and one starting from fourth position.

In the second example there is only one occurrence, which starts from third position. Note, that the answer is not unique. For example, if we move the first day (which is a day off) to the last position, the number of occurrences of t wouldn’t change.

In the third example it’s impossible to make even a single occurrence.

分析：
题意给定两个字符串s1,s2 使得s1的组成尽可能与s2一致
容易想到字符串匹配处理，考察next数组的理解
顺便复习一遍kmp数组
根据需要讲next数值依次顺延回溯

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long long LL;
const int maxnnn=0x3f3f3f3f;
struct node {
    LL x,y;
} ppppos[100050];

bool cmp(ll a,ll b) {
    return a>b;
}


int nex[100100];
int ls,lt;
void get_next(string s) {
    int i=0;
    int j=-1;
    nex[0]=-1;
    while(i<s.length()) {
        if(j==-1||s[i]==s[j]) {
            nex[++i]=++j;
        } else
            j=nex[j];
    }
}

int main() {
    string s,t;
    cin>>s>>t;

    get_next(t);
    ls=0;
    lt=0;
    for(int i=0; i<s.length(); i++) {
        if(s[i]=='0')
            lt++;
        else
            ls++;
    }
    int cnt=0;
    string ans;
    while(lt&&ls) {
        if(t[cnt]=='1') {
            if(ls) {
                ls--;
                ans+='1';
            } else
                break;

        } else {
            if(lt) {
                lt--;
                ans+='0';
            } else
                break;

        }
        cnt++;
        if(cnt==t.length())
            cnt=nex[cnt];//需要考虑到首位共享情况产生所以直接next
    }
    while(ls--)
        ans+='1';
    while(lt--)
        ans+='0';

    cout<<ans<<endl;

    return 0;
}