B3643听灌佬多(玄关)
  • 板块灌水区
  • 楼主Ethan_tang
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/11/25 13:17
  • 上次更新2024/11/25 17:37:21
查看原帖
B3643听灌佬多(玄关)
1491661
Ethan_tang楼主2024/11/25 13:17

全WA

#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> b[100005];
bool z[1001][100005];
int main()
{
	cin >> n >> m;
	for (int i = 0;i < m;i++)
	{
		int u,v;
		cin >> u >> v;
		u --;
		v --;
		b[u].push_back(v);
		b[v].push_back(u);
		z[u][v] = 1;
		z[v][u] = 1;
	}
	for (int i = 0;i < n;i++)
	{
		for (int j = 0;j < n;j++)
		{
			cout << z[i][j];
			(j == n - 1?cout << endl:cout << " ");
		}
	}
	for (int i = 0;i < n;i++)
	{
		sort(b[i].begin(),b[i].end());
		cout << b[i].size();
		for (int j = 1;j <= b[i].size();j++)
		{
			cout << b[i][j] + 1 << " ";
		}
		cout << endl;
	}
	return 0;
}
2024/11/25 13:17
加载中...