Andrew Stankevich Contests #2

传送门：http://codeforces.com/blog/entry/7770

http://acdream.info/contest?cid=1127

C - Hyperhuffman

哈夫曼编码题目，注意细节。

#include <cstdio>
#include <queue>
using namespace std;

typedef long long LL;
#define NN        500007

struct node {
    LL cnt;
    node *l, *r;
}n[NN*2];

int p;

class cmp {
public:
    int operator() (const node *a, const node *b) {
        return a->cnt > b->cnt;        // 小顶堆
    }
};

LL ddd = 0;

LL dfs(node *r)
{
    if (r->l == NULL) return r->cnt * ddd;
    ++ddd;
    LL ans = dfs(r->l);
    ans += dfs(r->r);
    --ddd;
    return ans;
}

priority_queue <node *, vector<node *>, cmp> q;

int main(void)
{
    int N;
    scanf("%d", &N);

    for(p=0; p<N; ++p) {
        scanf("%lld", &n[p].cnt);
        n[p].l = n[p].r = NULL;
        q.push(&n[p]);
    }
    if (q.size() > 1) {
        do {
            n[p].l = q.top(); q.pop();
            n[p].r = q.top(); q.pop();
            n[p].cnt = n[p].l->cnt + n[p].r->cnt;
            q.push(&n[p++]);
        }while(q.size() > 1);
        printf("%lld
", dfs(q.top()));
    } else printf("%lld
", q.top()->cnt);
    return 0;
}

G - Robbers

贪心，使用优先队列优化。

#include <cstdio>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;

struct gangster {
    int i, k;
    double xy;
    double ans;
    gangster(){}
    gangster(int &i, double xy, double ans):i(i), xy(xy), ans(ans), k(0) {}
}_g[1000];

int operator < (const gangster &a, const gangster &b)
{
    return a.ans < b.ans;
}

int cmp (const gangster &a, const gangster &b)
{
    return a.i < b.i;
}

priority_queue <gangster> g;

int main(void)
{
    int N, M, Y;
    scanf("%d%d%d", &N, &M, &Y);
    for(int i=0; i<N; ++i) {
        int x;
        scanf("%d", &x);
        g.push(gangster(i, ((double)x)/Y, ((double)x)/Y));
    }
    for(int i=0; i<M; ++i) {
        gangster g0 = g.top();
        g.pop();
        g0.ans = g0.xy - ((double)++g0.k)/M;
        g.push(g0);
    }

    for(int i=0; !g.empty(); ++i) {
        _g[i] = g.top();
        g.pop();
    }
    sort(_g, _g + N, cmp);
    for(int i=0; i<N; ++i) {
        if (i) putchar(' ');
        printf("%d", _g[i].k);
    }
    return 0;
}