Codeforces Round #418 (Div. 2) A+B(思维）

A. An abandoned sentiment from past
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A few years ago, Hitagi encountered a giant crab, who stole the whole of her body weight. Ever since, she tried to avoid contact with others, for fear that this secret might be noticed.

To get rid of the oddity and recover her weight, a special integer sequence is needed. Hitagi’s sequence has been broken for a long time, but now Kaiki provides an opportunity.

Hitagi’s sequence a has a length of n. Lost elements in it are denoted by zeros. Kaiki provides another sequence b, whose length k equals the number of lost elements in a (i.e. the number of zeros). Hitagi is to replace each zero in a with an element from b so that each element in b should be used exactly once. Hitagi knows, however, that, apart from 0, no integer occurs in a and b more than once in total.

If the resulting sequence is not an increasing sequence, then it has the power to recover Hitagi from the oddity. You are to determine whether this is possible, or Kaiki’s sequence is just another fake. In other words, you should detect whether it is possible to replace each zero in a with an integer from b so that each integer from b is used exactly once, and the resulting sequence is not increasing.

Input
The first line of input contains two space-separated positive integers n (2 ≤ n ≤ 100) and k (1 ≤ k ≤ n) — the lengths of sequence a and b respectively.

The second line contains n space-separated integers a1, a2, …, an (0 ≤ ai ≤ 200) — Hitagi’s broken sequence with exactly k zero elements.

The third line contains k space-separated integers b1, b2, …, bk (1 ≤ bi ≤ 200) — the elements to fill into Hitagi’s sequence.

Input guarantees that apart from 0, no integer occurs in a and b more than once in total.

Output
Output “Yes” if it’s possible to replace zeros in a with elements in b and make the resulting sequence not increasing, and “No” otherwise.

Examples
input
4 2
11 0 0 14
5 4
output
Yes
input
6 1
2 3 0 8 9 10
5
output
No
input
4 1
8 94 0 4
89
output
Yes
input
7 7
0 0 0 0 0 0 0
1 2 3 4 5 6 7
output
Yes
Note
In the first sample:

Sequence a is 11, 0, 0, 14.
Two of the elements are lost, and the candidates in b are 5 and 4.
There are two possible resulting sequences: 11, 5, 4, 14 and 11, 4, 5, 14, both of which fulfill the requirements. Thus the answer is “Yes”.
In the second sample, the only possible resulting sequence is 2, 3, 5, 8, 9, 10, which is an increasing sequence and therefore invalid.
题意：将b数组的数插入a中为0的地方。如果可以不构成递增序列输出Yes，否则输出No。
题解：将b数组降序插入a中，判断即可。
代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+10;
const int mod=1e7+9;
int a[N],b[N];
int main()
{
    std::ios::sync_with_stdio(false);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=k;i++)
        cin>>b[i];
        sort(b+1,b+1+k);
        reverse(b+1,b+1+k);
        int cnt=1;
        bool flag=false;
        for(int i=1;i<=n;i++)
        {
            if(a[i]==0)
            {

                a[i]=b[cnt++];
            }
        }
        for(int i=2;i<=n;i++)
        {
            if(a[i]<a[i-1])
                flag=true;
            if(flag) break;
        }
        if(flag)
        {
            cout<<"Yes"<<endl;
        }
        else
            cout<<"No"<<endl;

    return 0;
}

B. An express train to reveries
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Sengoku still remembers the mysterious “colourful meteoroids” she discovered with Lala-chan when they were little. In particular, one of the nights impressed her deeply, giving her the illusion that all her fancies would be realized.

On that night, Sengoku constructed a permutation p1, p2, …, pn of integers from 1 to n inclusive, with each integer representing a colour, wishing for the colours to see in the coming meteor outburst. Two incredible outbursts then arrived, each with n meteorids, colours of which being integer sequences a1, a2, …, an and b1, b2, …, bn respectively. Meteoroids’ colours were also between 1 and n inclusive, and the two sequences were not identical, that is, at least one i (1 ≤ i ≤ n) exists, such that ai ≠ bi holds.

Well, she almost had it all — each of the sequences a and b matched exactly n - 1 elements in Sengoku’s permutation. In other words, there is exactly one i (1 ≤ i ≤ n) such that ai ≠ pi, and exactly one j (1 ≤ j ≤ n) such that bj ≠ pj.

For now, Sengoku is able to recover the actual colour sequences a and b through astronomical records, but her wishes have been long forgotten. You are to reconstruct any possible permutation Sengoku could have had on that night.

Input
The first line of input contains a positive integer n (2 ≤ n ≤ 1 000) — the length of Sengoku’s permutation, being the length of both meteor outbursts at the same time.

The second line contains n space-separated integers a1, a2, …, an (1 ≤ ai ≤ n) — the sequence of colours in the first meteor outburst.

The third line contains n space-separated integers b1, b2, …, bn (1 ≤ bi ≤ n) — the sequence of colours in the second meteor outburst. At least one i (1 ≤ i ≤ n) exists, such that ai ≠ bi holds.

Output
Output n space-separated integers p1, p2, …, pn, denoting a possible permutation Sengoku could have had. If there are more than one possible answer, output any one of them.

Input guarantees that such permutation exists.

Examples
input
5
1 2 3 4 3
1 2 5 4 5
output
1 2 5 4 3
input
5
4 4 2 3 1
5 4 5 3 1
output
5 4 2 3 1
input
4
1 1 3 4
1 4 3 4
output
1 2 3 4
Note
In the first sample, both 1, 2, 5, 4, 3 and 1, 2, 3, 4, 5 are acceptable outputs.

In the second sample, 5, 4, 2, 3, 1 is the only permutation to satisfy the constraints.
题意 ：给两个n个数的排列a和b 保证两个排列至少有一个i使ai！=bi 求一个排列p使得对于a和b均满足存在一个数j使得ai！=pi bj！=pj。
题解：分析出a，b数组最多有两个不一样的位置。然后暴力判断即可。
代码：
代码略渣。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+10;
const int mod=1e7+9;
int a[N],b[N];
int ans[N];
int vis[N];
int main()
{
    std::ios::sync_with_stdio(false);
    int n,k;
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    for(int i=1;i<=n;i++)
        cin>>b[i];
    int g[3]; 
    int ce=0;
    int c[5];
    int ge=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==b[i])
            vis[a[i]]=1,ans[i]=a[i];
        else
        g[ce++]=i;
    }
     for(int i=1;i<=n;i++)
    {
        if(!vis[i])
            c[ge++]=i;
    }
    if(ce==1)
    {
        ans[g[0]]=c[0];
    }
    else
    {

        ans[g[0]]=c[0];
        ans[g[1]]=c[1];
        int q,w;
        q=w=0;
        for(int i=1;i<=n;i++)
        {
            if(ans[i]!=a[i])q++;
            if(ans[i]!=b[i])w++;
        }
        if(q!=1||w!=1)
        swap(ans[g[0]],ans[g[1]]);
    }
    for(int i=1;i<=n;i++)
        cout<<ans[i]<<" ";
}