Codeforces 588 C. Duff and Weight Lifting

C. Duff and Weight Lifting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently, Duff has been practicing weight lifting. As a hard practice, Malek gave her a task. He gave her a sequence of weights. Weight of i-th of them is 2wi pounds. In each step, Duff can lift some of the remaining weights and throw them away. She does this until there's no more weight left. Malek asked her to minimize the number of steps.

Duff is a competitive programming fan. That's why in each step, she can only lift and throw away a sequence of weights 2a1, ..., 2ak if and only if there exists a non-negative integer x such that 2a1 + 2a2 + ... + 2ak = 2x, i. e. the sum of those numbers is a power of two.

Duff is a competitive programming fan, but not a programmer. That's why she asked for your help. Help her minimize the number of steps.

Input

The first line of input contains integer n (1 ≤ n ≤ 106), the number of weights.

The second line contains n integers w1, ..., wn separated by spaces (0 ≤ wi ≤ 106 for each 1 ≤ i ≤ n), the powers of two forming the weights values.

Output

Print the minimum number of steps in a single line.

Sample test(s)

input

5
1 1 2 3 3

output

2

input

4
0 1 2 3

output

4

Note

In the first sample case: One optimal way would be to throw away the first three in the first step and the rest in the second step. Also, it's not possible to do it in one step because their sum is not a power of two.

In the second sample case: The only optimal way is to throw away one weight in each step. It's not possible to do it in less than 4 steps because there's no subset of weights with more than one weight and sum equal to a power of two.

还得多练啊。。。。。。

题目大意：

给你一个数 m，然后有 m 个数x，将2^x加起来所组成的也是2^y，求最少能组成几部分

样例解释：

5

1 1 2 3 3

2 + 2 +4 +8 == 16

2^3 == 8

所以只有2部分。。。

解题思路:

把输入的 x 的个数求出来，用一个数组保存，然后只需要从 0 到 10^6 + 30（为什么是30呢，因为10^6有20个2，所以开大点。。。）

进行循环，如果个 x 数是奇数就 ans++，否则的话就 arr[i] += arr[i-1]/2;

上代码:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;

#define MM(a) memset(a,0,sizeof(a))

typedef long long LL;
typedef unsigned long long ULL;
const int maxn = 1e6+30;///
const int mod = 1000000007;
const double eps = 1e0-7;
int arr[maxn];
int main()
{
    int m, x;
    int ans = 0;
    MM(arr);
    scanf("%d",&m);
    while(m--)
        scanf("%d",&x), arr[x]++;
    ///sort(arr, arr+m);
    for(int i=1; i<maxn; i++)
    {
        if(arr[i-1] & 1)
            ans++;
        arr[i] += arr[i-1]/2;
    }
    printf("%d\n",ans);
    return 0;
}