1013. Battle Over Cities (25)

思想就是计算有几个联通分量。

代码如下

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <vector>  
using namespace std;


int main()
{
int N, M, K;
cin >> N >> M >> K;
bool **city =new bool *[N];

for (int i = 0; i < N; i++)
{
city[i] = new bool[N];
for (int j = 0; j < N; j++)
city[i][j] = false; 
}

for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
city[a - 1][b - 1] = true;
city[b - 1][a - 1] = true;
}
for (int i = 0; i < K; i++)
{
vector<int> q;
int cc;
cin >> cc; cc--;
for (int j = 0; j < N; j++)
{
if (cc != j)
q.push_back(j);
}
int number = 0;
while (q.size()>0)
{
number++;
int tt = q.front();
q.erase(q.begin());
queue<int>tmp;
tmp.push(tt);
while (tmp.size()>0)
{
int top = tmp.front(); tmp.pop();
for (vector<int>::iterator it2 = q.begin(); it2 != q.end();)
{
if (city[top][*it2] || city[*it2][top])
{
tmp.push(*it2);
vector<int>::iterator tt = it2;
it2=q.erase(tt);
}
else
it2++;
}
if (q.size() <= 0)
break;
}
}
cout << number-1 << endl;
}

return 0;
}