oj.uz

답안 #154721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154721 2019-09-24T07:47:46 Z nicolaalexandra Pipes (CEOI15_pipes) C++17
80 / 100
 5000 ms 62172 KB 
#include <iostream>
#include <vector>
#define DIM 100002
using namespace std;
int t[DIM],t2[DIM],viz[DIM],low[DIM],niv[DIM];
vector <int> L[DIM];
int n,m,i,j,x,y,idx;
inline int get_rad (int x){
    int nr = x;
    while (t[x] > 0)
        x = t[x];
    while (t[nr] > 0){
        int aux = t[nr];
        t[nr] = x;
        nr = aux;
    }
    return x;
}
inline int get_rad2 (int x){
    int nr = x;
    while (t2[x] > 0)
        x = t2[x];
    while (t2[nr] > 0){
        int aux = t2[nr];
        t2[nr] = x;
        nr = aux;
    }
    return x;
}
void dfs(int nod, int tata){
    viz[nod] = 1;
    niv[nod] = low[nod] = ++idx;
    for(int i=0;i<L[nod].size();++i){
        int vecin = L[nod][i];
        if(vecin == tata)
            continue;
        if(viz[vecin] == 1)
            low[nod] = min (low[nod],niv[vecin]);
        else {
            dfs (vecin, nod);
            low[nod] = min (low[nod],low[vecin]);
            if (low[vecin] > niv[nod] && get_rad2(nod) != get_rad2(vecin))
                cout<<nod<<" "<<vecin<<"\n";
        }}}

int main (){

    cin>>n>>m;
    for (i=1;i<=n;++i)
        t[i] = t2[i] = -1;

    for (i=1;i<=m;++i){
        cin>>x>>y;
        int rx = get_rad (x), ry = get_rad (y);
        if (rx != ry){
            L[x].push_back(y);
            L[y].push_back(x);
            if (t[rx] < t[ry]){
                t[rx] += t[ry];
                t[ry] = rx;
            } else {
                t[ry] += t[rx];
                t[rx] = ry;
            }
        } else {
            /// nodurile se alfa deja in aceeasi multime si toate muchiile
            /// de pe drumul de la x la y NU pot fi critice
            /// oare merge daca fac din nou paduri pt nodurile astea?
            int rx2 = get_rad2 (x), ry2 = get_rad2 (y);
            if (rx2 != ry2){
                L[x].push_back(y); /// astea ar fi muchiile de intoarcere pt biconexe
                L[y].push_back(x);
                if (t2[rx2] < t2[ry2]){
                    t2[rx2] += t2[ry2];
                    t2[ry2] = rx2;
                } else {
                    t2[ry2] += t2[rx2];
                    t2[rx2] = ry2;
                }}}}
    for (i=1;i<=n;++i)
        if (!viz[i])
            dfs (i,0);


    return 0;
}

Compilation message

pipes.cpp: In function 'void dfs(int, int)':
pipes.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<L[nod].size();++i){
                 ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 3192 KB Output is correct
2 Correct 15 ms 2936 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 512 ms 3028 KB Output is correct
2 Correct 490 ms 2908 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 881 ms 3708 KB Output is correct
2 Correct 1038 ms 3320 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1428 ms 5312 KB Output is correct
2 Correct 1241 ms 5108 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1918 ms 10180 KB Output is correct
2 Correct 1676 ms 7376 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3032 ms 11388 KB Output is correct
2 Correct 2965 ms 8936 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4014 ms 13380 KB Output is correct
2 Correct 3728 ms 9360 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4965 ms 13364 KB Output is correct
2 Runtime error 4730 ms 62172 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5021 ms 7308 KB Time limit exceeded
2 Halted 0 ms 0 KB -