제출 #1212324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212324		Double_Slash	Pipes (CEOI15_pipes)	C++20	0 / 100	2686 ms	93564 KiB

pipes

#include <bits/stdc++.h>
 
using namespace std;
 
int n, m, depth[100001] = {0}, ps[100001] = {0}, par[100001] = {0};
vector<int> adj[100001];
bool seen[100001];
 
void dfs(int i) {
    seen[i] = true;
    for (int j: adj[i]) {
        if (j == par[i]) continue;
        if (par[j] == i) par[j] = -1;
        if (par[j] == -1) continue;
        if (seen[j]) {
            if (depth[j] > depth[i]) continue;
            ps[i]++;
            ps[j]--;
        } else {
            depth[j] = depth[i] + 1;
            par[j] = i;
            dfs(j);
            ps[i] += ps[j];
        }
    }
}
 
int main() {
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        adj[a].emplace_back(b);
        adj[b].emplace_back(a);
    }
    for (int i = 1; i <= n; ++i) {
        if (not seen[i]) dfs(i);
    }
    for (int i = 1; i <= n; ++i) {
        if (not ps[i] and ~par[i]) cout << i << " " << par[i] << "\n";
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 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