Submission #3426835

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
#include<cstring>
struct edge { int to, cap, rev; };
vector<edge> G[100000];
bool used[100000];
void add_edge(int from, int to, int cap) {
	G[from].push_back(edge{ to, cap, (int)G[to].size() });
	G[to].push_back(edge{ from, 0, (int)G[from].size() - 1 });
}
int dfs(int v, int t, int f) {
	if (v == t)return f;
	used[v] = true;
	for (int i = 0; i < (int)G[v].size(); i++) {
		edge &e = G[v][i];
		if (!used[e.to] && e.cap > 0) {
			int d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
int max_flow(int s, int t) {
	int flow = 0;
	for (;;) {
		memset(used, 0, sizeof(used));
		int f = dfs(s, t, mod);
		if (f == 0)return flow;
		flow += f;
	}
}
char lake[100][100];
int main() {
	int h, w; cin >> h >> w;
	int sta, goal;
	rep(i, h) {
		rep(j, w) {
			cin >> lake[i][j];
			if (lake[i][j] == 'S') {
				sta = i * w + j;
			}
			else if (lake[i][j] == 'T') {
				goal = i * w + j;
			}
		}
	}
	int t = h * w;
	rep(i, h) {
		rep(j, w) {
			add_edge(t + i * w + j, i*w + j, 1);
			if (lake[i][j] == '.')continue;
			rep(k, w) {
				if (lake[i][k] == '.')continue;
				add_edge(i*w + j, t+i*w + k, mod);
			}
			rep(k, h) {
				if (lake[k][j] == '.')continue;
				add_edge(i*w + j, t+k*w + j, mod);
			}
		}
	}
	int out = max_flow(sta, t + goal);
	if (out >= (int)mod)cout << -1 << endl;
	else cout << out << endl;
	return 0;
}

Submission Info

Judge Result