oj.uz

Submission #585852

# Submission time Handle Problem Language Result Execution time Memory
585852 2022-06-29T12:53:30 Z 1zaid1 Pipes (CEOI15_pipes) C++14
20 / 100
 2160 ms 65604 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int M = 1e5+1;
vector<int> node[M];
int a[M], tt = 1;
bitset<100005> vis;

void dfs(int s, int p = 1) {
    a[s] = tt++;
    vis[s] = true;
    for (int i:node[s]) {
        if (!vis[i]) {
            dfs(i, s);
            if (a[i] > a[s]) cout << s << ' ' << i << endl;
        }
    }
 
    for (int i:node[s]) if (i != p) a[s] = min(a[s], a[i]);
}

int pr[M], pb[M], rnk[M], bnk[M];
void uniR(int a, int b) {
    if (rnk[a] < rnk[b]) swap(a, b);
    if (rnk[a] == rnk[b]) rnk[a]++;
    pr[b] = a;
}

void uniB(int a, int b) {
    if (bnk[a] < bnk[b]) swap(a, b);
    if (bnk[a] == bnk[b]) bnk[a]++;
    pb[b] = a;
}

int findR(int s) {
    return (s==pr[s]?s:pr[s]=findR(pr[s]));
}

int findB(int s) {
    return (s==pb[s]?s:pb[s]=findB(pb[s]));
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) pb[i] = pr[i] = i;

    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;

        if (findB(a) == findB(b) && findR(a) == findR(b)) continue;
        node[a].push_back(b);
        node[b].push_back(a);
        if (findR(a) != findR(b)) uniR(a, b);
        else uniB(a, b);
    }

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

    return 0;
}
/*
10 11
1 7
1 8
1 6
2 8
6 7
5 8
2 5
2 3
2 4
3 4
10 9

*/

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:61:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   61 |     for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i); vis = 0;
      |     ^~~
pipes.cpp:61:55: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   61 |     for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i); vis = 0;
      |                                                       ^~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 2 ms 2644 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3300 KB Output is correct
2 Incorrect 7 ms 3028 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 4980 KB Output is correct
2 Correct 91 ms 4180 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 9588 KB Output is correct
2 Correct 205 ms 10644 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 364 ms 19620 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 717 ms 33288 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1144 ms 62528 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1628 ms 65604 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1954 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2160 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -