제출 #804601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
804601		Hanksburger	Pipes (CEOI15_pipes)	C++17	100 / 100	2417 ms	14308 KiB

pipes

#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100005];
int par[100005][2], t;
int findPar(int u, int x)
{
    return (par[u][x]==u?u:par[u][x]=findPar(par[u][x], x));
}
void dfs(int u, int p)
{
    par[u][0]=par[u][1]=(++t);
    int pass=1;
    for (int v:adj[u])
    {
        if (v==p && pass)
        {
            pass=0;
            continue;
        }
        if (par[v][0])
            par[u][1]=min(par[u][1], par[v][0]);
        else
        {
            dfs(v, u);
            par[u][1]=min(par[u][1], par[v][1]);
            if (par[v][1]>=par[v][0])
                cout << u << ' ' << v << '\n';
        }
    }
}
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i=1; i<=n; i++)
        par[i][0]=par[i][1]=i;
    for (int i=1; i<=m; i++)
    {
        int u, v, U, V;
        cin >> u >> v;
        if (findPar(u, 0)!=findPar(v, 0))
        {
            par[par[u][0]][0]=par[v][0];
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
        else if (findPar(u, 1)!=findPar(v, 1))
        {
            par[par[u][1]][1]=par[v][1];
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
    }
    for (int i=1; i<=n; i++)
        par[i][0]=par[i][1]=0;
    for (int i=1; i<=n; i++)
        if (!par[i][0])
            dfs(i, 0);
}

컴파일 시 표준 에러 (stderr) 메시지

pipes.cpp: In function 'int main()':
pipes.cpp:39:19: warning: unused variable 'U' [-Wunused-variable]
   39 |         int u, v, U, V;
      |                   ^
pipes.cpp:39:22: warning: unused variable 'V' [-Wunused-variable]
   39 |         int u, v, U, V;
      |                      ^

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