oj.uz

Submission #167278

# Submission time Handle Problem Language Result Execution time Memory
167278 2019-12-07T07:49:07 Z mhy908 Pipes (CEOI15_pipes) C++14
40 / 100
 1853 ms 65536 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[100010];
    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[100010];
int n, m;
int disc[100010], lowlink[100010], par[100010], 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

pipes.cpp: In function 'void dfs(int)':
pipes.cpp:24: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:39: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:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3576 KB Output is correct
2 Correct 5 ms 3448 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3960 KB Output is correct
2 Correct 10 ms 3832 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 9208 KB Output is correct
2 Correct 140 ms 9004 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 14132 KB Output is correct
2 Correct 289 ms 15424 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 422 ms 22036 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 590 ms 30560 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 901 ms 44152 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1222 ms 56584 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1516 ms 65536 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1853 ms 65536 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -