Submission #405327

#TimeUsernameProblemLanguageResultExecution timeMemory
405327MeGustaElArroz23Potemkin cycle (CEOI15_indcyc)C++14
20 / 100
1094 ms2844 KiB
#include<bits/stdc++.h>

using namespace std;

typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;

int main(){
    int n,m;
    cin >> n >> m;
    vvi conexiones(n);
    for (int i=0;i<m;i++){
        int a,b;
        cin >> a >>b;
        a--;
        b--;
        conexiones[a].push_back(b);
        conexiones[b].push_back(a);
    }
    for (int i=0;i<n;i++){
        for (int x:conexiones[i]){
            if (x<i) continue;
            vector<bool> porvisitar(n,true);
            porvisitar[i]=false;
            queue<int> cola;
            for (int y:conexiones[i]){
                if (y!=x) cola.push(y);
            }
            while (cola.size()){
                int y=cola.front();
                cola.pop();
                if (porvisitar[y]){
                    porvisitar[y]=false;
                    for (int z:conexiones[y]) cola.push(z);
                }
            }
            if (porvisitar[x]) cout << i+1 << ' '<<x+1<<'\n';
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...