Lollypop @ SJTU

啊！！模拟题。搞定一道后的那个成就感啊~~~ 哇卡卡卡。~
小秀一下我的程序简短呀~  pku 程序长度。排 第三。 嘿嘿。~  ^^

#include <iostream>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
using namespace std;

const int movex[4] = {-1, -1, 1, 1};
const int movey[4] = {-1, 1, 1, -1};
const int last[3] = {0, 7, 0};

struct POS {
  int x, y;

  POS () {}
  POS (int a, int b) { x = a, y = b; }
};

POS pos[33];
int G[8][8], num[8][8];
vector<POS> path;

void printG() {
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++)
      printf("%3d", G[i][j]);
    cout << endl;
  }
  cout << "------------\n";
}

void piece(int n, int player) {
  int x, t;
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    t = labs(x);
    G[pos[t].x][pos[t].y] = player * x / labs(x);
  }
}

bool getinf() {
  int r, w;

  scanf("%d%d\n", &r, &w);
  if (r + w == 0) return 0;
  memset(G, 0, sizeof(G));
  piece(r, 1);
  piece(w, 2);
  return 1;
}

void prepare() {
  int N = 0;

  memset(num, 0, sizeof(num));
  for (int i = 0; i < 8; i++)
    for (int j = 1 - (i & 1); j < 8; j += 2) {
      num[i][j] = ++N;
      pos[N] = POS(i, j);
    }
}

void runover(int st , int ed) {
  char s[100];

  for (int i = st; i <= ed; i++) gets(s);
}

void wrong(int x) {
  printf("Move %d is invalid\n", x);
}

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

bool canjump(int player, POS p, int d) {
  int x , y;

  if (labs(G[p.x][p.y]) != player) return 0;
  x = p.x + movex[d];
  y = p.y + movey[d];
  if (!inside(x, y) || labs(G[x][y]) != 3 - player) return 0;
  x += movex[d];
  y += movey[d];
  if (!inside(x, y) || G[x][y] != 0) return 0;
  return 1;
}

void getLR(int player, POS p, int &L, int &R) {
  if (G[p.x][p.y] < 0) L = 0, R = 3;
  else if (player == 1) L = 2, R = 3;
  else L = 0, R = 1;
}

void promotion(int player) {
  if (path.back().x == last[player]) G[path.back().x][path.back().y] = -player;
}

bool move(int player) {
  if (path.size() != 2) return 0;
  int L, R, x, y;

  for (int x = 0; x < 8; x++)
    for (int y = 0; y < 8; y++) {
      if (labs(G[x][y]) != player) continue;
      getLR(player, POS(x, y), L, R);
      for (int i = L; i <= R; i++)
 if (canjump(player, POS(x, y), i)) return 0;
    }

  getLR(player, path[0], L, R);
  for (int i = L; i <= R; i++) {
    x = path[0].x + movex[i];
    y = path[0].y + movey[i];
    if (x == path[1].x && y == path[1].y && !G[x][y]) {
      G[x][y] = G[path[0].x][path[0].y];
      G[path[0].x][path[0].y] = 0;
      promotion(player);
      return 1;
    }
  }
  return 0;
}

bool jump(int player) {
  if (path.size() < 2) return 0;
  int L, R, x, y;
  int tmp[8][8];
  bool found;

  memcpy(tmp, G, sizeof(G));
  getLR(player, path[0], L, R);
  for (int k = 1; k < path.size(); k++) {
    found = 0;
    for (int i = L; i <= R; i++) {
      if (canjump(player, path[k - 1], i)) {
 x = path[k - 1].x + movex[i] * 2;
 y = path[k - 1].y + movey[i] * 2;
 if (x == path[k].x && y == path[k].y) {
   x = path[k - 1].x + movex[i];
   y = path[k - 1].y + movey[i];
   G[x][y] = 0;
   x += movex[i];
   y += movey[i];
   G[x][y] = G[path[k - 1].x][path[k - 1].y];
   G[path[k - 1].x][path[k - 1].y] = 0;
   found = 1;
   break;
 }
      }
    }
    if (!found) {
      memcpy(G, tmp, sizeof(tmp));
      return 0;
    }
  }
  for (int i = L; i <= R; i++)
    if (canjump(player, path.back(), i)) {
      memcpy(G, tmp, sizeof(tmp));
      return 0;
    }
  promotion(player);
  return 1;
}

void getpath() {
  int x;
  char ch, s[500];

  gets(s);
  istringstream in(s);
  path.clear();
  in >> x; path.push_back(pos[x]);
  while (in >> ch >> x) path.push_back(pos[x]);
}

void solve() {
  int tot, player;
  char ch;

  scanf("%d %c\n", &tot, &ch);
  player = (ch == 'W') + 1;
  for (int i = 1; i <= tot; i++, player = 3 - player) {
    //    printG();
    getpath();
    if (labs(G[path[0].x][path[0].y]) != player || path.size() < 2 || !move(player) && !jump(player)) {
      runover(i + 1, tot);
      wrong(i);
      return;
    }
  }
  printf("All moves valid\n");
}

int main() {
  prepare();
  while (getinf()) solve();
}