# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
167284 | 2019-12-07T07:56:59 Z | mhy908 | Pipes (CEOI15_pipes) | C++14 | 1845 ms | 22192 KB |
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define F first #define S second using namespace std; typedef long long LL; typedef pair<int, int> pii; typedef pair<LL, LL> pll; struct UNION_FIND{ int par[100001]; UNION_FIND(){for(int i=1; i<=100000; i++)par[i]=i;} int findpar(int num){return num==par[num]?num:par[num]=findpar(par[num]);} void mergepar(int a, int b){par[findpar(a)]=findpar(b);} bool query(int a, int b){return findpar(a)==findpar(b);} }uf1, uf2; vector<int> link[100001]; int n, m; int disc[10001], lowlink[100001], par[100001], t; void dfs(int u) { disc[u]=lowlink[u]=++t; bool temp=false; for(int i=0; i<link[u].size(); i++){ if(link[u][i]==par[u]&&!temp)temp=true; else{ if(!disc[link[u][i]]){ par[link[u][i]]=u; dfs(link[u][i]); if(lowlink[link[u][i]]>disc[u])printf("%d %d\n", u, link[u][i]); lowlink[u]=min(lowlink[u], lowlink[link[u][i]]); } else lowlink[u]=min(lowlink[u], disc[link[u][i]]); } } } int main() { scanf("%d %d", &n, &m); for(int i=1; i<=m; i++){ int u, v; scanf("%d %d", &u, &v); if(!uf1.query(u, v)){ uf1.mergepar(u, v); link[u].pb(v); link[v].pb(u); } else if(!uf2.query(u, v)){ uf2.mergepar(u, v); link[u].pb(v); link[v].pb(u); } } for(int i=1; i<=n; i++){ if(!disc[i])dfs(i); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 3452 KB | Output is correct |
2 | Correct | 5 ms | 3496 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 3960 KB | Output is correct |
2 | Correct | 11 ms | 3832 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 158 ms | 8360 KB | Output is correct |
2 | Correct | 146 ms | 4660 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 251 ms | 5840 KB | Output is correct |
2 | Correct | 291 ms | 6784 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 411 ms | 13640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 608 ms | 16956 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 904 ms | 18212 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1230 ms | 20720 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1523 ms | 22192 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1845 ms | 21184 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |