BONUS13 - VOI 2013 - Phần thưởng

Tác giả: hieult

Ngôn ngữ: C++

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
//#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }

const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
    if (rsz <= 0) {
        ptr = 0;
        rsz = (int) fread(bf, 1, bfsz, stdin);
        if (rsz <= 0)
            return EOF;
    }
    --rsz;
    return bf[ptr++];
}
void ga(char &c) {
    c = EOF;
    while (!isalpha(c))
        c = gc();
}
int gs(char s[]) {
    int l = 0;
    char c = gc();
    while (isspace(c))
        c = gc();
    while (c != EOF && !isspace(c)) {
        s[l++] = c;
        c = gc();
    }
    s[l] = '\0';
    return l;
}
template<class T> bool gi(T &v) {
    v = 0;
    char c = gc();
    while (c != EOF && c != '-' && !isdigit(c))
        c = gc();
    if (c == EOF)
        return false;
    bool neg = c == '-';
    if (neg)
        c = gc();
    while (isdigit(c)) {
        v = v * 10 + c - '0';
        c = gc();
    }
    if (neg)
        v = -v;
    return true;
}

typedef pair<int, int> II;

const ld PI = acos(-1.0);
const ld eps = 1e-9;

const int dr[] = {+2, +1, +2, +1, -2, -1, -2, -1};
const int dc[] = {+1, +2, -1, -2, +1, +2, -1, -2};

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ll mod = (ll)1e9 + 7;

#define maxn 105

ull X[64], H[64], T[64], M[64];
ll f[64], d[64];

ull cal(int r, int c){
	ull t = 1;
	t <<= (r * 8 + c);
	return t;
}

ull cal1(int r, int c){
	int t = r * 8 + c;
	if(d[t] != -1) return ((ull)(1) << d[t]);
	return 0;
}

bool inside(int r, int c){
	return r >= 0 && r < 8 && c >= 0 && c < 8;
}

void getX(int id){
	int r = id / 8, c = id % 8;
	X[id] = 0;
	Rep(i, 8){
		X[id] |= cal1(r, i);
		X[id] |= cal1(i, c);
	}
}

void getH(int id){
	int r = id / 8, c = id % 8;
	H[id] = 0;
	Rep(i, 8){
		H[id] |= cal1(r, i);
		H[id] |= cal1(i, c);
	}
	Rep(i, 8) Rep(j, 8){
		if(i - j == r - c || i + j == r + c){
			H[id] |= cal1(i, j);
		}
	}
}

void getT(int id){
	int r = id / 8, c = id % 8;
	T[id] = 0;
	Rep(i, 8) Rep(j, 8){
		if(i - j == r - c || i + j == r + c){
			T[id] |= cal1(i, j);
		}
	}
}

void getM(int id){
	int r = id / 8, c = id % 8;
	M[id] = 0;
	Rep(h, 8){
		int rr = r + dr[h], cc = c + dc[h];
		if(inside(rr, cc)){
			M[id] |= cal1(rr, cc);
		}
	}
}

void init(){
	Rep(i, 64){
		getX(i);
		getH(i);
		getT(i);
		getM(i);
	}
}

ull mask;
ll res = 0;
int num, r, c, g;

void go(int id, ull Mask, ull mask1){
	if(id == 4){
		if(Mask){
			ll ret = 0;
			Rep(i, num) if(getbit(Mask, i)){
				ret += f[i];
			}
			res = max(res, ret);
		}
		return;
	}

	Rep(i, 64) if(!getbit(mask, i) && !getbit(mask1, i)){
		ull Maskt = Mask, mask1t = mask1;
		mask1t |= ((ull)(1) << i);
		if(id == 0) Maskt |= X[i];
		if(id == 1) Maskt |= H[i];
		if(id == 2) Maskt |= T[i];
		if(id == 3) Maskt |= M[i];
		go(id + 1, Maskt, mask1t);
	}
}


int  main()
{
//	freopen("in.txt", "r", stdin);

	cin >> num;
	mask = 0;
	ms(f, 0);
	ms(d, -1);
	Rep(i, num){
		cin >> r >> c >> g;
		r--; c--;
		int x = r * 8 + c;
		mask |= cal(r, c);
		d[x] = i;
		f[i] = g;
	}
	init();
	go(0, 0, 0);
	cout << res << endl;
//	cout << clock() << endl;

	return 0;
}

Download