B3643 图的存储

图由三种表示方式：邻接列表，邻接矩阵，边列表。这道题考察前两种编程实现。

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n, m;
vector<int> adjlist[1001];
int adjmatrix[1001][1001];

int main() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    adjlist[u].push_back(v);
    adjlist[v].push_back(u);
    adjmatrix[u][v] = 1;
    adjmatrix[v][u] = 1;
  }
  
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cout << adjmatrix[i][j] << ' ';
    }
    cout << endl;
  }
  
  for (int i = 1; i <= n; i++) {
    sort(adjlist[i].begin(),adjlist[i].end());
    cout << adjlist[i].size() << ' ';
    for (auto e : adjlist[i]) {
      cout << e << ' ';
    }
    cout << endl;
  }
  return 0;
}