oj.uz

Submission #527268

# Submission time Handle Problem Language Result Execution time Memory
527268 2022-02-17T04:48:02 Z ecxx Pipes (CEOI15_pipes) C++17
10 / 100
 2843 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;

int* depth = new int[MAXN]{0};
int* low = new int[MAXN]{0};
int* pos = new int[MAXN];
int* edgelist;

void AP(int i, int d, int pa) {
    depth[i] = d; low[i] = d;
    int paedges = 0;
    for (int k = pos[i]; k < pos[i+1]; k++) {
        int ch = edgelist[k];
        //cout << i << " " << ch << " " << pa << " p" << endl;
        if (ch==pa) {
            paedges++;
            continue;
        }
        if (depth[ch] != -1) {
            low[i] = min(low[i], depth[ch]);
        } else {
            AP(ch, d+1, i);
            low[i] = min(low[i], low[ch]);
        }
    }
    //cout << i << " " << pa << " " << paedges << endl;
    if (pa==-1) return;
    if (low[i] > depth[pa] && paedges < 2) {
        cout << i+1 << " " << pa+1 << "\n";
    }
}

int main() {

    int N, M, a, b; cin >> N >> M;
    vector<pair<int, int> > EL(2*M, {0, 0});

    for (int i = 0; i < M; i++) {
        cin >> a >> b; a--;b--;
        EL[2*i] = {a,b};
        EL[2*i+1] = {b,a};
    }

    sort(EL.begin(), EL.end());

    int curri = -1;
    int q = 0;

    edgelist = new int[2*M+5];

    for (auto a : EL) {
        if (a.first != curri) { 
            pos[a.first] = q;
            curri = a.first;
        }
        edgelist[q] = a.second;
        q++;
    }

    pos[curri+1] = q;

    EL.clear();EL.shrink_to_fit();

    for (int i = 0; i < N; i++) {
        depth[i] = -1;
    }

    for (int i = 0; i < N; i++) {
        if (depth[i] == -1)  AP(i,0,-1);
    }

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 972 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 1344 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 15036 KB Output is correct
2 Correct 387 ms 14720 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2843 ms 65540 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 35 ms 65540 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 37 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -