UVA 220 Othello

题目链接：https://vjudge.net/problem/UVA-220

题目翻译摘自《算法禁赛入门经典》

题目大意

　　你的任务是模拟黑白棋游戏的进程。

　　有 3 种指令：

1. L指令：打印所有合法操作，按照从上到下，从左到右的顺序排列（没有合法操作时输出 No legal move）。
2. M指令：放一枚棋子在 (x, y)。如果当前游戏者没有合法操作，则是先切换游戏者再操作。输入保证这个操作是合法的。输出操作完毕后黑白方的棋子总数。
3. Q指令：退出游戏，并打印当前棋盘（格式同输入）。

分析

　　略。

代码如下

#include <bits/stdc++.h>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define rFor(i,t,s) for (int i = (t); i >= (s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,inf,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}
 
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "
";
    return out;
}

inline int gc(){
    static const int BUF = 1e7;
    static char buf[BUF], *bg = buf + BUF, *ed = bg;
    
    if(bg == ed) fread(bg = buf, 1, BUF, stdin);
    return *bg++;
} 

inline int ri(){
    int x = 0, f = 1, c = gc();
    for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
    for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
    return x*f;
}

template<class T>
inline string toString(T x) {
    ostringstream sout;
    sout << x;
    return sout.str();
}
 
typedef long long LL;
typedef unsigned long long uLL;
typedef pair< double, double > PDD;
typedef pair< int, int > PII;
typedef pair< int, PII > PIPII;
typedef pair< string, int > PSI;
typedef pair< int, PSI > PIPSI;
typedef set< int > SI;
typedef set< PII > SPII;
typedef vector< int > VI;
typedef vector< VI > VVI;
typedef vector< PII > VPII;
typedef map< int, int > MII;
typedef map< int, string > MIS;
typedef map< int, PII > MIPII;
typedef map< PII, int > MPIII;
typedef map< string, int > MSI;
typedef map< string, string > MSS;
typedef map< PII, string > MPIIS;
typedef map< PII, PII > MPIIPII;
typedef multimap< int, int > MMII;
typedef multimap< string, int > MMSI;
//typedef unordered_map< int, int > uMII;
typedef pair< LL, LL > PLL;
typedef vector< LL > VL;
typedef vector< VL > VVL;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-6;
const LL inf = 0x7fffffff;
const LL infLL = 0x7fffffffffffffffLL;
const LL mod = 1e9 + 7;
const int maxN = 1e4 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;

struct Point{
    int X, Y;
    
    Point() {}
    Point(int x, int y) : X(x), Y(y) {}
    
    bool operator< (const Point &x) const {
        if(X == x.X) return Y < x.Y;
        return X < x.X;
    }
};

ostream &operator<< (ostream &out, const Point &x) {
    out << "(" << x.X << "," << x.Y << ")";
    return out;
}

int T, board[10][10], cur;
PII dir[] = {MP(0, -1), MP(-1, -1), MP(-1, 0), MP(-1, 1), MP(0, 1), MP(1, 1), MP(1, 0), MP(1, -1)};

char nextchar() {
    char ret;
    while(ret = getchar()) if(ret != '
' && ret != '
') break;
    return ret;
}

void list_move() {
    set< Point > sp;
    int nxtcur = (cur == 'W') ? 'B' : 'W';
    
    For(x, 1, 8) {
        For(y, 1, 8) {
            if(board[x][y] != cur) continue;
            Rep(i, 8) {
                int k = 1;
                int a = x + dir[i].ft, b = y + dir[i].sd;
                while(a > 0 && a < 9 && b > 0 && b < 9 && board[a][b] == nxtcur) {
                    ++k;
                    a += dir[i].ft;
                    b += dir[i].sd;
                }
                if(k > 1 && board[a][b] == '-') sp.insert(Point(a, b));
            }
        }
    }
    
    if(sp.empty()) { // 如果没有合法输入要交换选手 
        printf("No legal move.
");
        cur = nxtcur;
    }
    else {
        foreach(i, sp) {
            if(i != sp.begin()) cout << " "; 
            cout << *i;
        }
        cout << endl;
    }
}

void move(int x, int y) {
    int nxtcur = (cur == 'W') ? 'B' : 'W';
    bool flag = false;
    
    Rep(i, 8) { // 每个方向都看看 
        int k = 1;
        int a = x + dir[i].ft, b = y + dir[i].sd;
        while(a > 0 && a < 9 && b > 0 && b < 9 && board[a][b] == nxtcur) {
            ++k;
            a += dir[i].ft;
            b += dir[i].sd;
        }
        if(board[a][b] == cur) {
            For(j, 1, k - 1) {
                flag = true;
                a = x + j * dir[i].ft;
                b = y + j * dir[i].sd;
                board[a][b] = cur;
            }
        }
    }
    
    if(flag) board[x][y] = cur; // 可能是非法移动 
    else {
        cur = nxtcur;
        move(x, y);
        return;
    } 
    
    int cntB = 0, cntW = 0;
    For(i, 1, 8) {
        For(j, 1, 8) {
            if(board[i][j] == 'B') ++cntB;
            if(board[i][j] == 'W') ++cntW;
        }
    }
    
    printf("Black -%3d White -%3d
", cntB, cntW);
    cur = nxtcur;
}

void display_board() {
    For(i, 1, 8) {
        For(j, 1, 8) cout << (char)board[i][j];
        cout << endl;
    }
}

int main(){
    //freopen("MyOutput.txt","w",stdout);
    //freopen("input.txt","r",stdin);
    //INIT();
    char op;
    cin >> T;
    Rep(i, T) {
        ms0(board);
        For(i, 1, 8) For(j, 1, 8) board[i][j] = nextchar();
        
        if(i) printf("
");
        cur = nextchar();
        while(op = nextchar()) {
            if(op == 'L') list_move();
            if(op == 'M') {
                int x = nextchar() - '0';
                int y = nextchar() - '0';
                move(x, y);
            }
            if(op == 'Q') {
                display_board();
                break;
            }
        }
    }
    return 0;
}