oj.uz

Submission #592002

# Submission time Handle Problem Language Result Execution time Memory
592002 2022-07-08T11:10:10 Z andrei_boaca Pipes (CEOI15_pipes) C++14
100 / 100
 4392 ms 15192 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;
vector<vector<int>> muchii;
int comp[100005],myroot[100005],dp[19][100005],val[100005],par[100005],niv[100005],lg[100005];
int n,m;
int what;
int LCA(int a,int b)
{
    if(niv[a]<niv[b])
        swap(a,b);
    int dif=niv[a]-niv[b];
    int loga=log2(dif);
    for(int i=0;i<=loga;i++)
        if((dif>>i)&1)
            a=dp[i][a];
    if(a==b)
        return a;
    loga=log2(niv[a]);
    for(int i=loga;i>=0;i--)
        if(dp[i][a]!=0&&dp[i][b]!=0)
            if(dp[i][a]!=dp[i][b])
            {
                a=dp[i][a];
                b=dp[i][b];
            }
    return par[a];
}
void dfscalc(int nod)
{
    for(int q:muchii[nod])
    {
        int i=abs(q);
        if(i!=par[nod])
        {
            dfscalc(i);
            val[nod]+=val[i];
        }
    }
    if(val[nod])
    {
        int a=min(nod,par[nod]);
        int b=max(nod,par[nod]);
        for(int &i:muchii[a])
            if(i==b&&i>0)
            {
                i=-i;
                break;
            }
    }
    comp[nod]=what;
}
void dfsbuild(int nod)
{
    val[nod]=0;
    dp[0][nod]=par[nod];
    for(int i=1;i<=17;i++)
        dp[i][nod]=dp[i-1][dp[i-1][nod]];
    for(int q:muchii[nod])
    {
        int i=abs(q);
        if(i!=par[nod])
        {
            par[i]=nod;
            niv[i]=niv[nod]+1;
            dfsbuild(i);
        }
    }
}
void dsumerge(int a, int b)
{
    int c1=comp[a],c2=comp[b];
    if(lg[c1]<lg[c2])
    {
        swap(a,b);
        swap(c1,c2);
    }
    what=c1;
    dfscalc(myroot[c2]);
    par[b]=a;
    lg[c1]+=lg[c2];
    lg[c2]=0;
    niv[b]=niv[a]+1;
    muchii[a].push_back(b);
    muchii[b].push_back(a);
    dfsbuild(b);
}
int main()
{
    cin>>n>>m;
    muchii.resize(n+1);
    for(int i=1;i<=n;i++)
    {
        niv[i]=1;
        lg[i]=1;
        comp[i]=i;
        myroot[i]=i;
        par[i]=0;
        val[i]=0;
    }
    int cnt=0;
    for(int z=1;z<=m;z++)
    {
        int a,b;
        cin>>a>>b;
        if(comp[a]!=comp[b])
        {
            cnt++;
            dsumerge(a,b);
        }
        else
        {
            int lca=LCA(a,b);
            val[a]++;
            val[b]++;
            val[lca]-=2;
        }
    }
    for(int i=1;i<=n;i++)
        if(lg[i])
            dfscalc(myroot[i]);
    for(int i=1;i<=n;i++)
        for(int j:muchii[i])
            if(j>i&&j>0)
                cout<<i<<' '<<j<<'\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1088 KB Output is correct
2 Correct 8 ms 1052 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 852 KB Output is correct
2 Correct 304 ms 880 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 616 ms 1832 KB Output is correct
2 Correct 677 ms 1808 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 977 ms 3924 KB Output is correct
2 Correct 876 ms 4788 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1365 ms 10772 KB Output is correct
2 Correct 1189 ms 10868 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2302 ms 12340 KB Output is correct
2 Correct 2024 ms 12136 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2962 ms 15088 KB Output is correct
2 Correct 2671 ms 15176 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3638 ms 15092 KB Output is correct
2 Correct 3650 ms 15172 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4392 ms 14452 KB Output is correct
2 Correct 4148 ms 15192 KB Output is correct