제출 #872927

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
872927		Ghulam_Junaid	Pipes (CEOI15_pipes)	C++17	20 / 100	5086 ms	65536 KiB

pipes

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;
int n, m;
vector<pair<int, int>> edges, g[N];
bool vis[N];

void dfs(int v, int id){
    vis[v] = 1;
    for (auto [u, x] : g[v]){
        if (x == id or vis[u])
            continue;

        dfs(u, id);
    }
}

int main(){
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++){
        int u, v; 
        cin >> u >> v;

        g[u].push_back({v, i});
        g[v].push_back({u, i});
        edges.push_back({u, v});
    }

    int orig = 0;
    for (int v = 1; v <= n; v++){
        if (!vis[v]){
            orig++;
            dfs(v, m);
        }
    }

    for (int i=0; i<m; i++){
        int cc = 0;
        for (int v = 1; v <= n; v++)
            vis[v] = 0;

        for (int v = 1; v <= n; v++){
            if (!vis[v]){
                cc++;
                dfs(v, i);
            }
        }

        if (cc != orig)
            cout << edges[i].first << " " << edges[i].second << endl;
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10