Codeforces Round #326 (Div. 1)A. Duff and Weight Lifting
2016-05-29 11:58
381 查看
A. 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.
Examples
input
output
input
output
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
=a[n-1]/2+a
,当a
%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;
}
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.
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
=a[n-1]/2+a
,当a
%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;
}
相关文章推荐
- Problem 1004: 蛤玮打扫教室(区间覆盖端点记录)
- LightOJ 1213 Fantasy of a Summation(快速幂)
- 预警,迅雷离线服务器上的IntelliJ IDEA最新版被污染
- centos6.5 下安装nmap,sqlmap
- jquery强化教程2016第1节-编写第一个JQuery程序
- CodeForces 3D Least Cost Bracket Sequence (贪心+优先队列)
- JavaScript的常用内置类
- 算法和结构化数据初识
- JS报错:Uncaught SyntaxError: Unexpected identifier
- 第4章第2节 二叉树的基本操作(递归实现)
- 利用广播接受者监听用户短信
- LightOJ 1214 Large Division(大整数取模)
- Android开发技术点
- CentOS 7 minimal 版本安装后网络配置
- C++基础<01>—C++初识
- 一道关于重载的例子
- POJ 1742 Coins
- 在dev环境访问self assigned的https服务器,报Trust Anchor not found for Android SSL Connection
- LightOJ 1220 Mysterious Bacteria(满足a^p = n的最大p)
- Fraction to Recurring Decimal