oj.uz

Submission #97552

# Submission time Handle Problem Language Result Execution time Memory
97552 2019-02-17T01:24:59 Z jasony123123 Pipes (CEOI15_pipes) C++11
100 / 100
 1514 ms 12476 KB 
    #include <cstdio>
    #include <vector>
    using namespace std;
    #define pb push_back
    typedef pair<int,int> pp;
     
    int n, m;
     
    struct unf {
    	int par[100010];
    	void init(){ for(int i=1; i<=n; ++i) par[i]=i; }
     
    	int root(int x){ return (x==par[x])?x:(par[x]=root(par[x])); }
    	bool merge(int a,int b){
    		a=root(a); b=root(b);
    		if(a==b) return false;
    		par[a]=b;
    		return true;
    	}
    } f1, f2;
     
    int par[100010];
    int idx[100010];
    int lowl[100010];
    int nt;
    vector<int> edge[100010];
     
    void dfs(int x){
    	idx[x] = lowl[x] = ++nt;
    	bool cl = false;
    	for(int y:edge[x]){
    		if(par[x] == y && !cl){
    			cl=true; continue;
    		}
    		if(!idx[y]){
    			par[y]=x;
    			dfs(y);
    			lowl[x] = min(lowl[x], lowl[y]);
    		} else lowl[x] = min(lowl[x], idx[y]);
    	}
    	if(par[x] && idx[x]==lowl[x]) printf("%d %d\n", x, par[x]);
    }
     
    int main(){
    	scanf("%d%d", &n, &m);
    	f1.init(); f2.init();
    for(;m--;){
    	int a,b;
    	scanf("%d%d", &a, &b);
    	if(f1.merge(a,b) || f2.merge(a,b)) edge[a].pb(b), edge[b].pb(a);
    }
    	for(int i=1; i<=n; ++i) if(par[i]==0) dfs(i);
    	return 0;
    }

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:45:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d%d", &n, &m);
      ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:49:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d%d", &a, &b);
      ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2660 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3056 KB Output is correct
2 Correct 8 ms 2936 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 2960 KB Output is correct
2 Correct 112 ms 2872 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 3564 KB Output is correct
2 Correct 239 ms 3340 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 5000 KB Output is correct
2 Correct 315 ms 4900 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 564 ms 9508 KB Output is correct
2 Correct 442 ms 7232 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 793 ms 10528 KB Output is correct
2 Correct 710 ms 8484 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1097 ms 12356 KB Output is correct
2 Correct 945 ms 9164 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1232 ms 12476 KB Output is correct
2 Correct 1211 ms 9220 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1514 ms 11960 KB Output is correct
2 Correct 1396 ms 10132 KB Output is correct