CF1586B. Omkar and Heavenly Tree —— 图论+思维

B. Omkar and Heavenly Tree

题意：

一棵树有n个节点，给出m条限制，每条限制给出a, b, c，表示a-c的最短路径上不能经过b，找到一棵这样的树，输出它的n-1条边 1 <= m < n < 1e5

思路：

由于m < n，所以一定存在某个点未在b中出现过，于是把该点作为根，其他点都作为这个点的子节点，构成的树一定满足条件。

// Decline is inevitable,
// Romance will last forever.
#include <bits/stdc++.h>
using namespace std;
#define mst(a, x) memset(a, x, sizeof(a))
#define INF 0x3f3f3f3f
//#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define ll  long long
//#define int  long long
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
const int maxn = 1e5+10;
const int maxm = 1e3 + 10;
const int P = 1e9+7;//998244353;
int n, m;
int vis[maxn];
int d[maxn];
int a[maxn], b[maxn], c[maxn];
void solve() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        vis[i] = 0;
        d[i] = 0;
    }
    for(int i = 1; i <= m; i++) {
        cin >> a[i] >> b[i] >> c[i];
        d[b[i]] = 1;
    }
    int pre = 0;
    for(int i = 1; i <= n; i++) {
        if(!d[i]) {
            pre = i;
            vis[i] = 1;
            break;
        }
    }
    for(int i = 1; i <= m; i++) {
        if(!vis[a[i]]) {
            cout << pre << ' ' << a[i] << endl;
            vis[a[i]] = 1;
        }
        if(!vis[b[i]]) {
            cout << pre << ' ' << b[i] << endl;
            vis[b[i]] = 1;
        }
        if(!vis[c[i]]) {
            cout << pre << ' ' << c[i] << endl;
            vis[c[i]] = 1;
        }
    }
    for(int i = 1; i <= n; i++) {
        if(!vis[i])
            cout << pre << ' ' << i << endl;
    }
}
signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//    int T; scanf("%d", &T); while(T--)
    int T; cin >> T; while(T--)
    solve();
    return 0;
}