zoukankan      html  css  js  c++  java
  • 二进制

    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.

    题意:输入n,然后n个数,统计 2^a1 + 2^a2 + ... + 2^ak = 2^x

    能化为多少个这样的x。

    #include <iostream>
    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #include <cmath>
    
    using namespace std;
    const int maxn=1e6+30;
    int a[maxn];
    
    int main()
    {
        int n,x,sum=0;
        memset(a,0,sizeof(a));
        cin>>n;
        while(n--)
        {
            scanf("%d",&x);
            a[x]++;
        }
        for(int i=0;i<maxn;i++)
        {
            int t=a[i]/2;
            a[i]=a[i]%2;
            a[i+1]+=t;
            if(a[i]&1) sum++;
        }
        cout<<sum<<endl;
    }
  • 相关阅读:
    Spring MVC注解中@PathVariable和@RequestParam的区别
    Spring MVC请求流程
    eclipse-web项目目录结构
    数论基础------质数板
    线性DP基础--acwing---动态规划
    背包基础
    ----------动态规划分界线----------
    2020牛客暑期多校训练营(第三场)
    区间选点-贪心-acwing
    2020牛客暑期多校训练营(第二场)
  • 原文地址:https://www.cnblogs.com/chen9510/p/4907604.html
Copyright © 2011-2022 走看看