#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 300 + 5;
int t, n, m,kCase = 0,mmp[maxn][maxn],a,b;
bool judge()
{
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++) {
int fk1 = 0, fk2 = 0;
for (int k = 0; k < n; k++) {
if (mmp[i][k] && mmp[j][k]) fk1 = 1;
if (mmp[i][k] ^ mmp[j][k]) fk2 = 1;
}
if (fk1 && fk2) return false;
}
}
return true;
}
int main()
{
cin >> t;
while (t--) {
cin >> n >> m;
memset(mmp, 0, sizeof(mmp));
for (int i = 0; i < m; i++) {
cin >> a >> b;
mmp[a][b] = 1;
}
cout << "Case #" << ++kCase << ": ";
if (judge()) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}
习题8-25(uva-11175)
猜你喜欢
转载自blog.csdn.net/seanbill/article/details/117632157
今日推荐
周排行