oj.uz

Submission #656961

# Submission time Handle Problem Language Result Execution time Memory
656961 2022-11-08T14:38:22 Z benjaminkleyn Pipes (CEOI15_pipes) C++17
90 / 100
 994 ms 22368 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int max_n = 100000;

int mem[2 * max_n];
int *par[2];

int find(int u, int dsu)
{
    return (par[dsu][u] == u ? u : par[dsu][u] = find(par[dsu][u], dsu));
}

bool same_set(int u, int v, int dsu)
{
    return find(u, dsu) == find(v, dsu);
}

void unite(int u, int v, int dsu)
{
    par[dsu][find(v, dsu)] = find(u, dsu);
}


int n, m, timer = 0;
vector<int> g[max_n];
int edge_xor[2 * max_n], edge_cnt = 0;
int *ti, *lo;

void dfs(const int &u, const int &p)
{
    ti[u] = lo[u] = ++timer;
    for (const int &e : g[u])
        if (e != p)
        {
            int v = edge_xor[e] ^ u;
            if (ti[v])
                lo[u] = min(lo[u], ti[v]);
            else
            {
                dfs(v, e);
                lo[u] = min(lo[u], lo[v]);

                if (lo[v] > ti[u])
                    cout << u + 1 << ' ' << v + 1 << '\n';
            }
        }
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;

    par[0] = &mem[0];
    par[1] = &mem[max_n];
    for (int i = 0; i < n; i++)
        par[0][i] = par[1][i] = i;
    
    for (int i = 0, a ,b; i < m; i++)
    {
        cin >> a >> b;
        a--, b--;

        if (!same_set(a, b, 0))
            unite(a, b, 0);
        else if (!same_set(a, b, 1))
            unite(a, b, 1);
        else continue;

        g[a].push_back(edge_cnt);
        g[b].push_back(edge_cnt);
        edge_xor[edge_cnt] = a ^ b;
        edge_cnt++;
    }

    ti = &mem[0];
    lo = &mem[max_n];

    for (int i = 0; i < n; i++)
        ti[i] = lo[i] = 0;

    for (int i = 0; i < n; i++)
        if (!ti[i])
            dfs(i, -1);

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 3020 KB Output is correct
2 Correct 103 ms 4032 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 3716 KB Output is correct
2 Correct 157 ms 4300 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 5280 KB Output is correct
2 Correct 215 ms 6204 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 10548 KB Output is correct
2 Correct 286 ms 7148 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 11788 KB Output is correct
2 Correct 496 ms 8852 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 678 ms 13844 KB Output is correct
2 Correct 649 ms 9396 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 827 ms 13844 KB Output is correct
2 Correct 761 ms 9164 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 994 ms 13388 KB Output is correct
2 Runtime error 988 ms 22368 KB Memory limit exceeded
3 Halted 0 ms 0 KB -