1 条题解

  • 0
    @ 2026-2-10 14:22:09
    #include<bits/stdc++.h>
    using namespace std;
    vector<int> vec[10010];
    int main(){
        int n, m;
        cin >>n >>m;
        for (int i = 1; i <= n; i ++){
            vec[i].push_back(i);
        }
        for (int i = 1; i <= m; i ++){
            int a, b;
            cin >> a >> b;
            if(a == b) continue;
            for (int j = 0; j < vec[b].size(); j ++){
                vec[a].push_back(vec[b][j]);
            }
            vector<int>().swap(vec[b]);
        }
        for (int i = 1; i <= n; i ++){
            for (int j = 0; j < vec[i].size(); j ++){
                cout << vec[i][j] << " ";
            }
            cout << endl;
        }
        return 0;
    }
    
    • 1

    信息

    ID
    133
    时间
    2000ms
    内存
    128MiB
    难度
    8
    标签
    (无)
    递交数
    250
    已通过
    47
    上传者