UVA10763 交换学生 Foreign Exchange

知识点：模拟

使用了映射，感觉不是很快但没有想别的方法

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    while (cin >> n && n) {
        map<pair<int, int>, int> mp;
        for (int i = 0; i < n; i++) {
            int x, y;
            cin >> x >> y;
            pair<int, int> a = make_pair(x, y);
            if (mp.find(a) == mp.end()) mp[a] = 1;
            else mp[a]++;
        }
        int ok = 1;
        for (map<pair<int, int>, int>::iterator it = mp.begin(); it != mp.end(); it++) {
            pair<int, int> a = make_pair(it->first.second, it->first.first);
            if (mp.find(a) == mp.end() || mp[a] != it->second) { ok = 0; break; }
        }
        cout << (ok ? "YES" : "NO") << '\n';
    }
    return 0;
}