제출 #527697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527697		beepbeepsheep	Pipes (CEOI15_pipes)	C++17	10 / 100	967 ms	14756 KiB

pipes

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

#define ll int
#define ii pair<ll,ll>
#define endl '\n'
const ll inf=1e15;
const ll mod=1e9+7;
const ll maxn=1e5+5;

vector<ll> adj[maxn];
ll cnt[maxn],depth[maxn],low[maxn];
ll par[maxn][2];
int root(ll x, ll l){
    if (par[x][l]==x) return x;
    return par[x][l]=root(par[x][l],l);
}
bool connect(ll a, ll b, ll l){
    if (root(a,l)==root(b,l)) return 0;
    par[root(a,l)][l]=root(b,l);
    return 1;
}
void dfs(ll node, ll p){
    for (auto &u:adj[node]){
        if (depth[u]==-1){
            depth[u]=depth[node]+1;
            dfs(u,node);
            if (low[u]>depth[node]){
                cout<<node<<' '<<u<<endl;
            }
            low[node]=min(low[node],low[u]);
        } else if (u!=p){
            low[node]=min(low[node],depth[u]);
        }
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,e,a,b;
    cin>>n>>e;
    for (int i=0;i<maxn;i++) low[i]=inf;
    memset(depth,-1,sizeof(depth));
    for (int i=0;i<maxn;i++){
        par[i][0]=i;
        par[i][1]=i;
    }
    for (int i=0;i<e;i++){
        cin>>a>>b;
        if (connect(a,b,0) || connect(a,b,1)){
            adj[a].emplace_back(b);
            adj[b].emplace_back(a);
        }
    }
    vector<ll> v;
    for (int i=1;i<=n;i++){
        sort(adj[i].begin(),adj[i].end());
        v.clear();
        for (auto u:adj[i]){
            if (v.empty()) v.emplace_back(u);
            else if (v.back()==u){
                while (v.size() && v.back()==u) v.pop_back();
            } else v.push_back(u);
        }
        swap(v,adj[i]);
    } //remove duplicates
    for (int i=1;i<=n;i++){
        if (depth[i]!=-1) continue;
        depth[i]=1;
        dfs(i,-1);
    }
    return 0;
}

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

pipes.cpp:7:14: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+15' to '2147483647' [-Woverflow]
    7 | const ll inf=1e15;
      |              ^~~~

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