WA 0分 求调

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5, M = 1e4 + 5;
int n, m;
vector<int> g[N];
bool G[M][N];

int main()
{
	cin >> n >> m;
	for (int i = 1; i <= m; ++i)
	{
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
		G[u][v] = 1;
		G[v][u] = 1;
	}
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			cout << G[i][j] << " ";
		}
		cout << endl;
	}
	for (int i = 1; i <= n; ++i)
	{
		cout << g[i].size() << " ";
		for (auto x : g[i])
		{
			cout << x << " ";
		}
		cout << endl;
	}
	return 0;
}