zoukankan      html  css  js  c++  java
  • A. Mahmoud and Ehab and the MEX

    A. Mahmoud and Ehab and the MEX
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Dr. Evil kidnapped Mahmoud and Ehab in the evil land because of their performance in the Evil Olympiad in Informatics (EOI). He decided to give them some problems to let them go.

    Dr. Evil is interested in sets, He has a set of n integers. Dr. Evil calls a set of integers evil if the MEX of it is exactly x. the MEX of a set of integers is the minimum non-negative integer that doesn't exist in it. For example, the MEX of the set {0, 2, 4} is 1 and the MEX of the set {1, 2, 3} is 0 .

    Dr. Evil is going to make his set evil. To do this he can perform some operations. During each operation he can add some non-negative integer to his set or erase some element from it. What is the minimal number of operations Dr. Evil has to perform to make his set evil?

    Input

    The first line contains two integers n and x (1 ≤ n ≤ 100, 0 ≤ x ≤ 100) — the size of the set Dr. Evil owns, and the desired MEX.

    The second line contains n distinct non-negative integers not exceeding 100 that represent the set.

    Output

    The only line should contain one integer — the minimal number of operations Dr. Evil should perform.

    Examples
    Input
    5 3
    0 4 5 6 7
    Output
    2
    Input
    1 0
    0
    Output
    1
    Input
    5 0
    1 2 3 4 5
    Output
    0
    Note

    For the first test case Dr. Evil should add 1 and 2 to the set performing 2 operations.

    For the second test case Dr. Evil should erase 0 from the set. After that, the set becomes empty, so the MEX of it is 0.

    In the third test case the set is already evil.

    弄一个标记数组,然后合适补位就行了.

     1 #include <bits/stdc++.h>
     2 #define N 105
     3 using namespace std;
     4 int n,x;
     5 int k[N],m[N];
     6 int main(){
     7     cin>>n>>x;
     8     for(int i=0;i<n;i++){
     9       cin>>k[i];
    10       m[k[i]]=1;
    11     }
    12     int cnt=0;
    13     if(m[x]==1){
    14       cnt++;
    15     }
    16     for(int i=0;i<x;i++){
    17       if(m[i]==0)
    18         cnt++;
    19     }
    20     cout<<cnt<<endl;
    21   return 0;
    22 }
  • 相关阅读:
    datatable里的元素
    ajax
    myeclipse编译项目Webcontent下不生成classes文件
    oracle忘记密码
    zuul的多版本配置
    ribbon灰度发布极简方式
    ribbon灰度发布
    使用网关zuul完成灰度发布
    mybatis-generator代码生成器使用(二)
    mybatis-generator代码生成器使用(一)
  • 原文地址:https://www.cnblogs.com/zllwxm123/p/7562377.html
Copyright © 2011-2022 走看看