【HDOJ】4341 Gold miner

分组01背包。在一条直线上的点归为一组。

/* 4341 */
#include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <cassert>
#include <functional>
#include <iterator>
#include <iomanip>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,1024000")

#define sti                set<int>
#define stpii            set<pair<int, int> >
#define mpii            map<int,int>
#define vi                vector<int>
#define pii                pair<int,int>
#define vpii            vector<pair<int,int> >
#define rep(i, a, n)     for (int i=a;i<n;++i)
#define per(i, a, n)     for (int i=n-1;i>=a;--i)
#define clr                clear
#define pb                 push_back
#define mp                 make_pair
#define fir                first
#define sec                second
#define all(x)             (x).begin(),(x).end()
#define SZ(x)             ((int)(x).size())
#define lson            l, mid, rt<<1
#define rson            mid+1, r, rt<<1|1

typedef struct mine_t {
    int x, y, t, v;
    
    friend bool operator< (const mine_t& a, const mine_t& b) {
        int tmp = a.x * b.y - a.y * b.x;
        if (tmp != 0)
            return tmp < 0;
        return a.y < b.y;
    }
} mine_t;

const int maxn = 205;
const int maxt = 40005;
mine_t mine[maxn];
int dp[maxt];
int B[maxn][maxn];
int sz[maxn];
int n, T;

bool cmp(int i) {
    return i+1<n && mine[i].x*mine[i+1].y==mine[i].y*mine[i+1].x;
}

void solve() {
    int bn = 0;
    
    sort(mine, mine+n);
    memset(sz, 0, sizeof(sz));
    rep(i, 0, n) {
        B[bn][sz[bn]++] = i;
        if (cmp(i)) {
            mine[i+1].t += mine[i].t;
            mine[i+1].v += mine[i].v;
        } else {
            ++bn;
        }
    }
    
    memset(dp, 0, sizeof(dp));
    rep(i, 0, bn) {
        per(j, 0, T+1) {
            rep(k, 0, sz[i]) {
                int id = B[i][k];
                int t = mine[id].t;
                int v = mine[id].v;
                if (j >= t)
                    dp[j] = max(dp[j], dp[j-t]+v);
            }
        }
    }
    
    int ans = dp[T];
    printf("%d
", ans);
}

int main() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    int t = 0;
    
    while (scanf("%d %d", &n, &T) != EOF) {
        rep(i, 0, n)
            scanf("%d %d %d %d", &mine[i].x, &mine[i].y, &mine[i].t, &mine[i].v);
        printf("Case %d: ", ++t);
        solve();    
    }
    
    #ifndef ONLINE_JUDGE
        printf("time = %d.
", (int)clock());
    #endif
    
    return 0;
}

数据发生器。

from copy import deepcopy
from random import randint, shuffle
import shutil
import string


def GenDataIn():
    with open("data.in", "w") as fout:
        t = 20
        bound = 10**5
        ld = list(string.digits)
        # fout.write("%d
" % (t))
        for tt in xrange(t):
            n = randint(1, 200)
            T = randint(1, 200**2)
            fout.write("%d %d
" % (n, T))
            for i in xrange(n):
                x = randint(-200, 200)
                y = randint(0, 200)
                t = randint(1, 200)
                v = randint(0, 200)
                fout.write("%d %d %d %d
" % (x, y, t, v))
            
                
def MovDataIn():
    desFileName = "F:eclipse_prjworkspacehdojdata.in"
    shutil.copyfile("data.in", desFileName)

    
if __name__ == "__main__":
    GenDataIn()
    MovDataIn()