Submission #527156

#TimeUsernameProblemLanguageResultExecution timeMemory
527156ecxxPipes (CEOI15_pipes)C++17
10 / 100
3826 ms65540 KiB
#include <bits/stdc++.h> using namespace std; int N; vector<int> depth; vector<int> low; vector<vector<int> > AL; void AP(int i, int d, int pa) { depth[i] = d; low[i] = d; for (int ch : AL[i]) { if (ch==pa) 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]); } } if (low[i] == depth[i] && pa!=-1) { cout << i+1 << " " << pa+1 << "\n"; } } int main() { int N, M, a, b; cin >> N >> M; depth.assign(N, -1); low.assign(N, 0); AL.assign(N, vector<int>()); for (int i = 0; i < M; i++) { cin >> a >> b; a--;b--; AL[a].push_back(b); AL[b].push_back(a); } for (int i = 0; i < N; i++) { if (depth[i] == -1) AP(i,0,-1); } }
#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...