제출 #1258589

#제출 시각아이디문제언어결과실행 시간메모리
1258589chikien2009Pipes (CEOI15_pipes)C++20
20 / 100
2067 ms131072 KiB
#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, m, a, b, head[100000], near[100000];
bool check[6000000];
vector<pair<int, int>> g[100000];

inline void DFS(int node)
{
    head[node] = near[node] = a++;
    for (auto & i : g[node])
    {
        if (!check[i.second])
        {
            check[i.second] = true;
            if (head[i.first] == 0)
            {
                DFS(i.first);
                if (near[i.first] > head[node])
                {
                    cout << i.first + 1 << " " << node + 1 << "\n";
                }
            }
            near[node] = min(near[node], near[i.first]);
        }
    }
}

int main()
{
    setup();

    cin >> n >> m;
    while (m--)
    {
        cin >> a >> b;
        g[a - 1].push_back({b - 1, m});
        g[b - 1].push_back({a - 1, m});
    }
    for (int i = 0; i < n; ++i)
    {
        if (head[i] == 0)
        {
            a = 1;
            DFS(i);
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...