zoukankan      html  css  js  c++  java
  • A. An abandoned sentiment from past (Round 418)

    A. An abandoned sentiment from past
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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 kequals 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 aand 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.

     hint: 有一个序列,其中有n个零,然后给你n个非零的数,问你能不能把这些非0的数放进去使得这是一个非递增序列,冷静分析一下,当n大于等于2的时候,肯定能得到所求答案。

    所以只需要判断一下n=1的情况就可以了

    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<string>
    #include<vector>
    #include<stack>
    #include<queue>
    #include<stdlib.h>
    using namespace std;
    typedef long long ll;
    
    //找规律
    int a[120], b[120];
    int main(){
        int n, k;
        cin >> n >> k;
        if(k >= 2){
            for(int i = 0; i < n; i++) cin >> a[i];
            for(int i = 0; i < k; i++) cin >> b[i];
            cout << "Yes
    " << endl;
        }else{
            int index, x;
            for(int i = 0; i < n; i++){
                cin >> a[i];
                if(a[i] == 0) index = i;
            }
            cin >> x;
            a[index] = x;
            int flag = 0;
            for(int i = 1; i < n; i++){
                if(a[i] < a[i-1]){
                    flag = 1;
                    break;
                }
            }
            if(!flag) cout << "No" << endl;
            else cout << "Yes" << endl;
        }
        return 0;
    }
  • 相关阅读:
    二分查找
    Linux下查找目录中所有文件中含有某个字符串,并且只打印出文件名
    编码规范
    Cookie和Session的选择,以及如何解决分布式系统下各个服务器之间Session不统一的问题
    Mac VMware Fusion 11.5 虚拟机带密钥
    快速排序
    python装饰器
    商品详情页
    hadoop跑wordcount报expected org.apache.hadoop.io.Text, received org.apache.hadoop.io.LongWritable
    CentOS7设置共享文件夹不显示问题
  • 原文地址:https://www.cnblogs.com/ledoc/p/7086832.html
Copyright © 2011-2022 走看看