oj.uz

Submission #291509

# Submission time Handle Problem Language Result Execution time Memory
291509 2020-09-05T12:38:51 Z davooddkareshki Pipes (CEOI15_pipes) C++17
90 / 100
 1160 ms 65536 KB 
#include<bits/stdc++.h>
using namespace std;

//#define int long long
#define F first
#define S second
#define pii pair<int,int>
#define mpr make_pair

typedef long long ll;

const int maxn = 1e5+1;
//const int mod = 1e9+7;
//const int inf = 1e9+10;

int n, m, q;

struct dsu
{
    int par[maxn];
    dsu() {memset(par, -1, sizeof par);}
    int get_par(int v)
    {
        if(par[v] < 0) return v;
        return par[v] = get_par(par[v]);
    }

    void merg(int u, int v)
    {
        u = get_par(u);
        v = get_par(v);

        if(u == v) return;

        if(par[u] < par[v]) swap(u,v);
        par[v] += par[u];
        par[u] = v;
    }

    bool ask(int u, int v) {return (get_par(u) == get_par(v));}
} G, T;

/// G --> kole graph
/// T --> molefe haye 2hamband yali graph

vector<pii> g[maxn];
bitset<maxn> mark; int la[maxn];

void pfs(int v, int p = 0)
{
    mark[v] = 1;
    for(auto e : g[v])
    {
        int u = e.F;
        if(mark[u]) {la[v]++; la[u]--;}
    }
    for(auto e : g[v])
    {
        int u = e.F;
        if(!mark[u]) pfs(u,v);
    }
    la[p]++; la[v]--;
}

vector<pii> edge;
void dfs(int v, int id = -1)
{
    mark[v] = 1;
    for(auto e : g[v])
    {
        int u = e.F, ID = e.S;
        if(!mark[u])
        {
            dfs(u,ID);
            la[v] += la[u];
        }
    }

    if(la[v] == 0 && id >= 0)
        cout<< edge[id].F <<" "<< edge[id].S <<"\n";
}

signed main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>> n >> m;
    for(int i = 1, u, v; i <= m; i++)
    {
        cin>> u >> v;

        if(!G.ask(u,v))
        {
            G.merg(u,v);
            edge.push_back({u,v});
        }
        else
            T.merg(u,v);
    }

    int i = 0;
    for(auto e : edge)
    {
        int u = T.get_par(e.F), v = T.get_par(e.S);
        g[u].push_back({v,i});
        g[v].push_back({u,i});
        i++;
    }

    for(int i = 1; i <= n; i++)
        if(!mark[i]) pfs(i);
    for(int i = 1; i <= n; i++) mark[i] = 0;
    for(int i = 1; i <= n; i++)
        if(!mark[i]) dfs(i);
}
/*
10 11
1 7
1 8
1 6
2 8
6 7
5 8
2 5
2 3
2 4
3 4
10 9
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3712 KB Output is correct
2 Correct 5 ms 3712 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 3584 KB Output is correct
2 Correct 106 ms 3584 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 4088 KB Output is correct
2 Correct 202 ms 3832 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 4356 KB Output is correct
2 Correct 251 ms 4468 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 357 ms 6252 KB Output is correct
2 Correct 321 ms 6000 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 567 ms 6256 KB Output is correct
2 Correct 580 ms 6360 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 740 ms 6512 KB Output is correct
2 Correct 693 ms 6752 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 946 ms 6484 KB Output is correct
2 Correct 894 ms 6636 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1150 ms 6508 KB Output is correct
2 Runtime error 1160 ms 65536 KB Memory limit exceeded