蒟蒻0分RE求调
查看原帖
蒟蒻0分RE求调
953664
chenqile楼主2025/1/1 19:51
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, m, a[1005][1005]={};
    queue<int> b[1005];
    cin>>n>>m;
    for(int i=0;i<n;i++){
        int t1, t2;
        cin>>t1>>t2;
        a[t1-1][t2-1]=a[t2-1][t1-1]=1;
        b[t1].push(t2);
        b[t2].push(t1);
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++) printf("%d ",a[i][j]);
        printf("\n");
    }
    for(int i=0;i<n;i++){
        cout<<b[i+1].size()<<" ";
        for(int j=0;j<n;j++){
            cout<<b[i].front()<<" ";
            b[i].pop();
        }
        cout<<"\n";
    }
    return 0;
}
2025/1/1 19:51
加载中...