제출 #656911

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

pipes

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int max_n = 10001;

int n, m, ti[max_n] = {0}, lo[max_n], timer = 0;
unordered_map<int,int> g[max_n];

void dfs(int u, int p = -1)
{
    ti[u] = lo[u] = ++timer;
    for (auto [v, cnt] : g[u])
        if (v != p)
        {
            if (ti[v])
                lo[u] = min(lo[u], ti[v]);
            else
            {
                dfs(v, u);
                lo[u] = min(lo[u], lo[v]);

                if (lo[v] > ti[u] && cnt < 2)
                    cout << u << ' ' << v << '\n';
            }
        }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    for (int i = 0, a ,b; i < m; i++)
    {
        cin >> a >> b;
        g[a][b]++;
        g[b][a]++;
    }

    for (int i = 1; i <= n; i++)
        if (!ti[i])
            dfs(i);

    return 0;
}

• 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