题解 | 【模板】链式前向星

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int n, m;
vector<priority_queue<int, vector<int>, greater<int> > > adjacency_table(100005);
int main() {
	cin >> n >> m;
	int v1, v2;
	while (m--) {
		cin >> v1 >> v2;
		adjacency_table[v1].push(v2);
		adjacency_table[v2].push(v1);
	}
	for (int i = 1; i <= n; i++) {
		if (adjacency_table[i].empty()) {
			cout << "None" << endl;
			continue;
		}
		while (!adjacency_table[i].empty()) {
			cout << adjacency_table[i].top() << " ";
			adjacency_table[i].pop();
		}
		cout << endl;
	}
}