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

Tác giả: RR

Ngôn ngữ: C++

#include <iostream>
#include <cstdio>
#include <vector>

#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,a) for(int i=0;i<(a);++i)
#define sqr(x) ((x)*(x))
using namespace std;

typedef pair<int,int> P;
int id[10][10];
long long board[10][10], cur[10][10], res;
int n, a[66], b[66], c[66], sum[66], diff[66], id2[66];
bool can[10][10][10][10];

int nGood;
P good[66];

vector<P> ke[5][66];
const int di[] = {-2,-2,-1,-1,1,1,2,2};
const int dj[] = {-1,1,-2,2,-2,2,-1,1};

bool inside(int u, int v) {
    return (u > 0 && u < 9 && v > 0 && v < 9);
}

void init() {
    FOR(i,1,8) FOR(j,1,8) {
        // 1 : Knight
        REP(dir,8) {
            int u = i + di[dir], v = j + dj[dir];
            if (inside(u,v))
                ke[1][id[i][j]].push_back(make_pair(u, v));
        }

        // 2 : Rook
        FOR(x,1,8) {
            ke[2][id[i][j]].push_back(make_pair(x, j));
            ke[2][id[i][j]].push_back(make_pair(i, x));
        }

        // 3 : Knight
        FOR(u,1,8) {
            int v = i + j - u;
            if (inside(u, v)) ke[3][id[i][j]].push_back(make_pair(u, v));
            v = u - (i - j);
            if (inside(u, v)) ke[3][id[i][j]].push_back(make_pair(u, v));
        }

        // 4 : Queen
        FOR(t,2,3)
            REP(x,ke[t][id[i][j]].size())
                ke[4][id[i][j]].push_back(ke[t][id[i][j]][x]);
    }
}

bool mark[10][10];

void solve2() {
    FOR(i,1,n) {
        int a, b, c; scanf("%d%d%d", &a, &b, &c);
        board[a][b] += c;
    }
    FOR(i,1,8) FOR(j,1,8) {
        if (!board[i][j]) {
            good[++nGood] = make_pair(i,j);
            id[i][j] = nGood;
        }
        cur[i][j] = board[i][j];
    }

    init();

    res = 0;
    int u, v;
    FOR(knight_id,1,nGood)
    FOR(rook_id,1,nGood) if (rook_id != knight_id)
    FOR(bishop_id,1,nGood) if (bishop_id != knight_id && bishop_id != rook_id)
    FOR(queen_id,1,nGood) if (queen_id != knight_id && queen_id != rook_id && queen_id != bishop_id) {
        FOR(i,1,8) FOR(j,1,8) cur[i][j] = board[i][j];

        long long now = 0;
        REP(x,ke[1][knight_id].size()) {
            u = ke[1][knight_id][x].first, v = ke[1][knight_id][x].second;
            now += cur[u][v];
            cur[u][v] = 0;
        }
        REP(x,ke[2][rook_id].size()) {
            u = ke[2][rook_id][x].first, v = ke[2][rook_id][x].second;
            now += cur[u][v];
            cur[u][v] = 0;
        }
        REP(x,ke[3][bishop_id].size()) {
            u = ke[3][bishop_id][x].first, v = ke[3][bishop_id][x].second;
            now += cur[u][v];
            cur[u][v] = 0;
        }
        REP(x,ke[4][queen_id].size()) {
            u = ke[4][queen_id][x].first, v = ke[4][queen_id][x].second;
            now += cur[u][v];
            cur[u][v] = 0;
        }
        res = max(res, now);
    }
    cout << res << endl;
}

void solve1() {
    for(int i = 1; i <= 8; ++i)
        for(int j = 1; j <= 8; ++j)
            for(int u = 1; u <= 8; ++u)
                for(int v = 1; v <= 8; ++v)
                    can[i][j][u][v] = sqr(i-u) + sqr(j-v) == 5;

    for(int i = 1; i <= n; ++i) {
        scanf("%d%d%d", &a[i], &b[i], &c[i]);
        sum[i] = a[i] + b[i];
        diff[i] = a[i] - b[i];
        board[a[i]][b[i]] += c[i];
    }

    long long res = 0, cur;
    for(int rooki = 1; rooki <= 8; ++rooki)
        for(int rookj = 1; rookj <= 8; ++rookj) if (!board[rooki][rookj]) {
            for(int bishopi = 1; bishopi <= 8; ++bishopi)
                for(int bishopj = 1; bishopj <= 8; ++bishopj)
                    if (!board[bishopi][bishopj])
                    if (bishopi != rooki || bishopj != rookj) {
                        int bishop_sum = bishopi + bishopj, bishop_diff = bishopi - bishopj;
                        for(int queeni = 1; queeni <= 8; ++queeni)
                            for(int queenj = 1; queenj <= 8; ++queenj)
                                if (!board[queeni][queenj])
                                if (queeni != rooki || queenj != rookj)
                                    if (queeni != bishopi || queenj != bishopj) {
                                        int queen_sum = queeni + queenj, queen_diff = queeni - queenj;
                                        long long cursum = 0;
                                        int nId = 0;
                                        for(int i = 1; i <= n; ++i) {
                                            if (a[i] == rooki || b[i] == rookj
                                                || sum[i] == bishop_sum || diff[i] == bishop_diff
                                                || a[i] == queeni || b[i] == queenj
                                                || sum[i] == queen_sum || diff[i] == queen_diff)
                                                    cursum += c[i];
                                            else id2[++nId] = i;
                                        }

                                        for(int knighti = 1; knighti <= 8; ++knighti)
                                            for(int knightj = 1; knightj <= 8; ++knightj)
                                                if (!board[knighti][knightj])
                                                if (knighti != rooki || knightj != rookj)
                                                    if (knighti != bishopi || knightj != bishopj)
                                                        if (knighti != queeni || knightj != queenj) {
                                                            cur = 0;
                                                            for(int i = 1; i <= nId; ++i) {
                                                                if (can[knighti][knightj][a[id2[i]]][b[id2[i]]])
                                                                    cur += c[id2[i]];
                                                            }
                                                            res = max(res, cur + cursum);
                                                        }
                                    }
                    }
        }

    cout << res << endl;
}

int main() {
    scanf("%d", &n);
    if (n >= 30) {
        solve2();
    }
    else solve1();
}

Download