全WA求条必关

#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 6;
int n, m, mp[N][N], x, y;
vector<int> q[N];
int main() {
	ios::sync_with_stdio(0), cin.tie(nullptr);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> x >> y, mp[x][y] = 1, mp[y][x] = 1, q[x].push_back(y), q[y].push_back(x);
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) cout << mp[i][j] << ' ';
		cout << '\n';
	}
	for (int i = 1; i <= n; i++) {
		sort(q[i].begin(), q[i].end());
		cout << q[i].size();
		for (int j = 0; j < (int)q[i].size(); j++) cout << ' ' << q[i][j];
		cout << '\n';
	}
	return 0;
}