题意:
N<=105种价值的物品,物品有两个属性,一个是价值(以2ai次方表示),一个是数量xi.为了公平起见,求出物品分配的最小差(二进制表示)
分析:
贪心,先将物品合并,然后从大到小能平分就平分,如果不能那么答案一定是这不能平分的最大的2x−剩下所有的2x′和,x′<x
因为2n>2n−1+2n−2+...+20
做的过程由于合并了, 我们要记录进位, 进位的 1 是可分的, 原来的1 才是不可分的.
做减法的时候我们把 2x表示成(2x−1)+1 , 直观上就是 111...111x个+1,然后减减减,ans[0]=1啦,所以最后再判断下进位,输出的时候注意前导0
代码:
//
// Created by TaoSama on 2015-10-07
// Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define pr(x) cout << #x << " = " << x << " "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
typedef long long LL;
int n;
LL cnt[N], ans[N];
bool carry[N];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
// freopen("out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
int t; scanf("%d", &t);
int kase = 0;
while(t--) {
scanf("%d", &n);
memset(cnt, 0, sizeof cnt);
memset(ans, 0, sizeof ans);
memset(carry, 0, sizeof carry);
int Max = -1;
for(int i = 1; i <= n; ++i) {
int x, c; scanf("%d%d", &x, &c);
Max = max(Max, x);
cnt[x] += c;
}
for(int i = 0; i <= Max; ++i) {
if(cnt[i] < 2) continue;
cnt[i + 1] += cnt[i] / 2;
cnt[i] %= 2;
carry[i + 1] = true;
}
int idx = -1;
for(int i = Max; ~i; --i) {
if(cnt[i] == 1 && !carry[i]) {
idx = i;
break;
}
}
printf("Case #%d: ", ++kase);
if(idx == -1) {
puts("0");
continue;
}
ans[idx] = 0;
ans[0] = 1; //let 2^max = 1 + 11...111(max-1 in total)
for(int i = idx - 1; ~i; --i)
ans[i] += 1 - cnt[i];
for(int i = 0; i < idx; ++i) {
if(ans[i] < 2) continue;
ans[i + 1] += ans[i] / 2;
ans[i] %= 2;
}
for(int i = idx; i >= 0; --i) {
if(ans[i] == 0) continue;
for(; i >= 0; --i) printf("%lld", ans[i]);
puts("");
}
}
return 0;
}