UVA 220 Othello

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

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

题目大意

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

　　有 3 种指令：

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

分析

　　略。

代码如下

  1 #include <bits/stdc++.h>
  2 using namespace std;
  3  
  4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  5 #define Rep(i,n) for (int i = 0; i < (n); ++i)
  6 #define For(i,s,t) for (int i = (s); i <= (t); ++i)
  7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i)
  8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
  9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
 10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
 11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 12  
 13 #define pr(x) cout << #x << " = " << x << "  "
 14 #define prln(x) cout << #x << " = " << x << endl
 15  
 16 #define LOWBIT(x) ((x)&(-x))
 17  
 18 #define ALL(x) x.begin(),x.end()
 19 #define INS(x) inserter(x,x.begin())
 20  
 21 #define ms0(a) memset(a,0,sizeof(a))
 22 #define msI(a) memset(a,inf,sizeof(a))
 23 #define msM(a) memset(a,-1,sizeof(a))
 24 
 25 #define MP make_pair
 26 #define PB push_back
 27 #define ft first
 28 #define sd second
 29  
 30 template<typename T1, typename T2>
 31 istream &operator>>(istream &in, pair<T1, T2> &p) {
 32     in >> p.first >> p.second;
 33     return in;
 34 }
 35  
 36 template<typename T>
 37 istream &operator>>(istream &in, vector<T> &v) {
 38     for (auto &x: v)
 39         in >> x;
 40     return in;
 41 }
 42  
 43 template<typename T1, typename T2>
 44 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
 45     out << "[" << p.first << ", " << p.second << "]" << "\n";
 46     return out;
 47 }
 48 
 49 inline int gc(){
 50     static const int BUF = 1e7;
 51     static char buf[BUF], *bg = buf + BUF, *ed = bg;
 52     
 53     if(bg == ed) fread(bg = buf, 1, BUF, stdin);
 54     return *bg++;
 55 } 
 56 
 57 inline int ri(){
 58     int x = 0, f = 1, c = gc();
 59     for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
 60     for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
 61     return x*f;
 62 }
 63 
 64 template<class T>
 65 inline string toString(T x) {
 66     ostringstream sout;
 67     sout << x;
 68     return sout.str();
 69 }
 70  
 71 typedef long long LL;
 72 typedef unsigned long long uLL;
 73 typedef pair< double, double > PDD;
 74 typedef pair< int, int > PII;
 75 typedef pair< int, PII > PIPII;
 76 typedef pair< string, int > PSI;
 77 typedef pair< int, PSI > PIPSI;
 78 typedef set< int > SI;
 79 typedef set< PII > SPII;
 80 typedef vector< int > VI;
 81 typedef vector< VI > VVI;
 82 typedef vector< PII > VPII;
 83 typedef map< int, int > MII;
 84 typedef map< int, string > MIS;
 85 typedef map< int, PII > MIPII;
 86 typedef map< PII, int > MPIII;
 87 typedef map< string, int > MSI;
 88 typedef map< string, string > MSS;
 89 typedef map< PII, string > MPIIS;
 90 typedef map< PII, PII > MPIIPII;
 91 typedef multimap< int, int > MMII;
 92 typedef multimap< string, int > MMSI;
 93 //typedef unordered_map< int, int > uMII;
 94 typedef pair< LL, LL > PLL;
 95 typedef vector< LL > VL;
 96 typedef vector< VL > VVL;
 97 typedef priority_queue< int > PQIMax;
 98 typedef priority_queue< int, VI, greater< int > > PQIMin;
 99 const double EPS = 1e-6;
100 const LL inf = 0x7fffffff;
101 const LL infLL = 0x7fffffffffffffffLL;
102 const LL mod = 1e9 + 7;
103 const int maxN = 1e4 + 7;
104 const LL ONE = 1;
105 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
106 const LL oddBits = 0x5555555555555555;
107 
108 struct Point{
109     int X, Y;
110     
111     Point() {}
112     Point(int x, int y) : X(x), Y(y) {}
113     
114     bool operator< (const Point &x) const {
115         if(X == x.X) return Y < x.Y;
116         return X < x.X;
117     }
118 };
119 
120 ostream &operator<< (ostream &out, const Point &x) {
121     out << "(" << x.X << "," << x.Y << ")";
122     return out;
123 }
124 
125 int T, board[10][10], cur;
126 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)};
127 
128 char nextchar() {
129     char ret;
130     while(ret = getchar()) if(ret != '\n' && ret != '\r') break;
131     return ret;
132 }
133 
134 void list_move() {
135     set< Point > sp;
136     int nxtcur = (cur == 'W') ? 'B' : 'W';
137     
138     For(x, 1, 8) {
139         For(y, 1, 8) {
140             if(board[x][y] != cur) continue;
141             Rep(i, 8) {
142                 int k = 1;
143                 int a = x + dir[i].ft, b = y + dir[i].sd;
144                 while(a > 0 && a < 9 && b > 0 && b < 9 && board[a][b] == nxtcur) {
145                     ++k;
146                     a += dir[i].ft;
147                     b += dir[i].sd;
148                 }
149                 if(k > 1 && board[a][b] == '-') sp.insert(Point(a, b));
150             }
151         }
152     }
153     
154     if(sp.empty()) { // 如果没有合法输入要交换选手 
155         printf("No legal move.\n");
156         cur = nxtcur;
157     }
158     else {
159         foreach(i, sp) {
160             if(i != sp.begin()) cout << " "; 
161             cout << *i;
162         }
163         cout << endl;
164     }
165 }
166 
167 void move(int x, int y) {
168     int nxtcur = (cur == 'W') ? 'B' : 'W';
169     bool flag = false;
170     
171     Rep(i, 8) { // 每个方向都看看 
172         int k = 1;
173         int a = x + dir[i].ft, b = y + dir[i].sd;
174         while(a > 0 && a < 9 && b > 0 && b < 9 && board[a][b] == nxtcur) {
175             ++k;
176             a += dir[i].ft;
177             b += dir[i].sd;
178         }
179         if(board[a][b] == cur) {
180             For(j, 1, k - 1) {
181                 flag = true;
182                 a = x + j * dir[i].ft;
183                 b = y + j * dir[i].sd;
184                 board[a][b] = cur;
185             }
186         }
187     }
188     
189     if(flag) board[x][y] = cur; // 可能是非法移动 
190     else {
191         cur = nxtcur;
192         move(x, y);
193         return;
194     } 
195     
196     int cntB = 0, cntW = 0;
197     For(i, 1, 8) {
198         For(j, 1, 8) {
199             if(board[i][j] == 'B') ++cntB;
200             if(board[i][j] == 'W') ++cntW;
201         }
202     }
203     
204     printf("Black -%3d White -%3d\n", cntB, cntW);
205     cur = nxtcur;
206 }
207 
208 void display_board() {
209     For(i, 1, 8) {
210         For(j, 1, 8) cout << (char)board[i][j];
211         cout << endl;
212     }
213 }
214 
215 int main(){
216     //freopen("MyOutput.txt","w",stdout);
217     //freopen("input.txt","r",stdin);
218     //INIT();
219     char op;
220     cin >> T;
221     Rep(i, T) {
222         ms0(board);
223         For(i, 1, 8) For(j, 1, 8) board[i][j] = nextchar();
224         
225         if(i) printf("\n");
226         cur = nextchar();
227         while(op = nextchar()) {
228             if(op == 'L') list_move();
229             if(op == 'M') {
230                 int x = nextchar() - '0';
231                 int y = nextchar() - '0';
232                 move(x, y);
233             }
234             if(op == 'Q') {
235                 display_board();
236                 break;
237             }
238         }
239     }
240     return 0;
241 }
View Code

 

posted @ 2019-06-16 22:09  梦樱羽  阅读(204)  评论(0)  编辑  收藏  举报
Live2D