UVa 657 The die is cast

方法：dfs 联通分量

做做水题歇歇脑。

有几个容易出错的地方。第一要考虑骰子上至少是1点，所以如果一个骰子上没有点数，也要记作1。。。还有就是一个骰子全是点。

code:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#include <fstream>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <sstream>
#include <time.h>
#include <complex>
#include <iomanip>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define FOR(a,b,c) for (ll (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (ll (a)=(b);(a)<=(c);++(a))
#define DFOR(a,b,c) for (ll (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (ll (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define rep(i,n) FOR(i,0,n)
#define repn(i,n) FORN(i,1,n)
#define drep(i,n) DFOR(i,n-1,0)
#define drepn(i,n) DFOR(i,n,1)
#define MAX(a,b) a = Max(a,b)
#define MIN(a,b) a = Min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define Reset(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(all(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)
#define forever for(;;)
#define PINF 1000000000000
#define newline '
'

#define test if(1)if(0)cerr
using namespace std;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef pair<double,double> dd;
typedef pair<char,char> cc;
typedef vector<ii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l4;
const double pi = acos(-1.0);


const int maxn = 50;
string board[maxn];
int n, m;
int cnt;
vector<int> ans;
int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};
void dfs2(int x, int y, char c='*')
{
    board[x][y] = c;
    for (int d = 0; d < 4; ++d)
    {
        int nx = x+dx[d], ny = y+dy[d];
        if (nx < 0 || ny < 0 || nx >= n || ny >= m || board[nx][ny] != 'X') continue;
        dfs2(nx, ny, c);
    }
}
void dfs(int x, int y)
{
    board[x][y] = '.';
    for (int d = 0; d < 4; ++d)
    {
        int nx = x+dx[d], ny = y+dy[d];
        if (nx < 0 || ny < 0 || nx >= n || ny >= m || board[nx][ny] == '.') continue;
        if (board[nx][ny] == 'X')
        {
            ++cnt; dfs2(nx, ny);
        }
        dfs(nx, ny);
    }

}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int kase = 0;
    while (cin >> m >> n && m)
    {
        for (int r = 0; r < n; ++r) cin >> board[r];
        ans.clear();
        for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j)
            if (board[i][j] == '*')
            {
                cnt = 0; dfs(i, j); ans.push_back(max(cnt,1));
            }
        for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (board[i][j] != '.')
        {
            ans.pb(1);
            dfs2(i, j, '.');
        }
        cout << "Throw " << ++kase << newline;
        sort(ans.begin(), ans.end());
        bool first = true;
        for (int i = 0; i < ans.size(); ++i)
        {
            if (first) first = false;
            else cout << " ";
            cout << ans[i];
        }

        cout << newline << newline;
    }
}