题意:
空间中有多个粒子碰撞。i,j碰撞有三种情况。
1)nothing happen
2)i disappear
3)j disappear
求最后可以剩下最少的粒子数
思路:
强连通分量最后只能剩下一个,如果外面有边连进来,则全部消失。
所以先求DAG,然后数根的个数。
const int Maxn = 50;
int vis[Maxn+5];
class StrangeParticles
{
public:
int n, sccCnt;
vector<int> S, color;
void dfs1(vector <string> &g, int now) {
vis[now] = 1;
for (int i=0;i<n;++i) if (!vis[i] && g[now][i] == '-') dfs1(g, i);
S.push_back(now);
}
void dfs2(vector <string> &g, int now) {
if (color[now]) return;
color[now] = sccCnt;
for (int i=0;i<n;++i) if (g[now][i] == '+') dfs2(g, i);
}
int remain(vector <string> interacts)
{
n = interacts.size();
color.resize(n);
S.clear();
memset(vis, 0, sizeof(vis));
fill(color.begin(), color.end(), 0);
for (int i=0;i<n;++i) if (!vis[i]) dfs1(interacts, i);
sccCnt = 0;
for (int i=n-1;i>=0;--i) if (!color[S[i]]) {
++sccCnt;dfs2(interacts, S[i]);
}
int ret = 0;
vector<int> in(n+1);
for (int i=0;i<n;++i) for (int j=0;j<n;++j)
if (color[i] != color[j] && interacts[i][j] == '-') {
in[color[j]] = 1;
}
cout << sccCnt << endl;
for (int i=1;i<=sccCnt;++i) ret += !in[i];
return ret;
}
}