This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |