Submission #167289

#TimeUsernameProblemLanguageResultExecution timeMemory
167289mhy908Pipes (CEOI15_pipes)C++14
100 / 100
1957 ms15444 KiB
#pragma GCC optimize "03" #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[100001], 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 (stderr)

pipes.cpp: In function 'void dfs(int)':
pipes.cpp:25:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<link[u].size(); i++){
               ~^~~~~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~
#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...