• Codeforce 814A


    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 brespectively.

    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.

    题解:实际上如果m>1的或就直接输出yes,不要想太多,因为已经保证每个数字只出现一遍,而如果m>1的话,b中的数就必定有大小关系,所以直接输出yes。

    这样一来m就只能为1了,把b放进a判断一下是否递增就可以了。

     1 #include <iostream>
     2 #include <algorithm>
     3 #include <cstring>
     4 #include <cstdio>
     5 #include <vector>
     6 #include <cstdlib>
     7 #include <iomanip>
     8 #include <cmath>
     9 #include <ctime>
    10 #include <map>
    11 #include <set>
    12 using namespace std;
    13 #define lowbit(x) (x&(-x))
    14 #define max(x,y) (x>y?x:y)
    15 #define min(x,y) (x<y?x:y)
    16 #define MAX 100000000000000000
    17 #define MOD 1000000007
    18 #define pi acos(-1.0)
    19 #define ei exp(1)
    20 #define PI 3.141592653589793238462
    21 #define INF 0x3f3f3f3f3f
    22 #define mem(a) (memset(a,0,sizeof(a)))
    23 typedef long long ll;
    24 const int N=205;
    25 const int mod=1e9+7;
    26 int a[201],b[201];
    27 int n,m,cnt;
    28 int main()
    29 {
    30     int i,j;
    31     scanf("%d%d",&n,&m);
    32     for(i=1;i<=n;i++){
    33         scanf("%d",&a[i]);
    34         if(a[i]==0)cnt=i;
    35     }
    36     for(i=1;i<=m;i++)
    37         scanf("%d",&b[i]);
    38     if(m>1){
    39         cout<<"Yes";
    40         return 0;
    41     }
    42     i=cnt;
    43     a[i]=b[1];
    44     for(i=2;i<=n;i++){
    45         if(a[i]<a[i-1]){
    46             cout<<"Yes";
    47             return 0;
    48         }
    49     }
    50     cout<<"No";
    51     return 0;
    52 }
  • 相关阅读:
    js 运动框架
    js 去掉字符中两边的空格
    js 去掉字符中所有空格
    vue移动端webview视频轻应用
    vue绑定v-modal布尔值到checkbox后异步,部分手机更新不及时问题
    使用原生js的scrollTop,刷新进入页面定位到某一个dom元素
    会议管理项目总结
    ionic1上拉刷新,下拉加载,安卓问题解决
    jquery $(document).ready() 与window.onload的区别
    vue2+express4图片上传
  • 原文地址:https://www.cnblogs.com/wydxry/p/7263501.html
Copyright © 2020-2023  润新知