Codeforces/codeforces/1203/E.cpp at master · Intruderp/Codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include<bits/stdc++.h>
#define vi vector<int>
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define  loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
    int n,x;
    cin>>n;
    vi v(150001,0);
    loop(i,0,n)
    {
        cin>>x;
        v[x]++;
    }
    loop(i,0,150002)
    {
        if(v[i]==1)
        {
            if(i-1>0 && v[i-1]==0)
            {
                v[i]=0;
                v[i-1]=1;
            }
            continue;
        }
        if(v[i]==2)
        {
            if(i-1>0 && v[i-1]==0)
            v[i-1]=1;
            else
            v[i+1]++;
            continue;
        }
        if(v[i]>2)
        {
            if(i-1>0 && v[i-1]==0)
            v[i-1]++,v[i+1]++;
            else
            {
                v[i+1]+=1;
                // if(v[i+1]==2)
                // i++;
            }
        }
    }
    int ans=0;
    loop(i,0,150002)
    ans+=(v[i]!=0);
    cout<<ans;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //test
    solve();
    return 0;
}