样例过了,但是0分
  • 板块B3643 图的存储
  • 楼主HHll1
  • 当前回复3
  • 已保存回复3
  • 发布时间2023/10/12 11:35
  • 上次更新2023/11/2 14:20:36
查看原帖
样例过了,但是0分
1064905
HHll1楼主2023/10/12 11:35
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int>> edge1(n, vector<int>(n, 0));
    vector<vector<int>> edge2(n);
    for (int i = 0; i < m; i++)
    {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        edge1[u][v] = 1;
        edge1[v][u] = 1;
        edge2[u].push_back(v);
        edge2[v].push_back(u);
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++) cout << edge1[i][j] << " ";
        cout << endl;
    }
    for (int i = 0; i < n; i++)
    {
        cout << edge2[i].size();
        for (int neighbor : edge2[i]) cout << " " << neighbor + 1;
        cout << endl;
    }
    return 0;
}

求助!样例过了,但是全WA

2023/10/12 11:35
加载中...