Codeforces Round #326 (Div. 1)A. Duff and Weight Lifting

最新推荐文章于 2022-08-21 01:05:54 发布

Folieshell

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量502

点赞数 1

分类专栏： acm

本文链接：https://blog.csdn.net/Folieshell/article/details/51531064

版权

acm 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

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.

$\text{[math]}$

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.

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

题意：
达夫每天练习举重，教练给了她n个重量值为2^wi哑铃让她举，每次达夫可以举起满足2^a1+2^a2+…+2^ak=2^x的重量并将这些哑铃扔掉，问达夫最少几次完成教练的任务

思路：

用数组记录2^n的个数，然后求a[n]=a[n-1]/2+a[n],当a[n]%2==1时记录一次（为举不了的部分）

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int max_i=10000010;
int a[max_i];
int main()
{
    memset(a,0,sizeof(a));
    int t;
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        int temp;
        scanf("%d",&temp);
        a[temp]++;
    }
    int ans=a[0]%2;
    for(int i=1;i<max_i;i++)
    {
        a[i]=a[i-1]/2+a[i];
        if(a[i]%2==1)
            ans++;
    }
    printf("%d\n",ans);
    return 0;
}