oj.uz

Submission #1035177

# Submission time Handle Problem Language Result Execution time Memory
1035177 2024-07-26T05:33:42 Z vjudge1 Pipes (CEOI15_pipes) C++14
40 / 100
 720 ms 60756 KB 
#pragma GCC optimize("O3,unroll-loops")    
#include <iostream>
#include <vector>
using namespace std;
 
const int N = 1e5+1;
struct dsu {
	vector<int> e;
	int find(int &x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
	bool join(int a, int b) {
		a = find(a), b = find(b);
		if (a == b) return false;
		if (e[a] > e[b]) swap(a, b);
		e[a] += e[b]; e[b] = a;
		return true;
	}
} d1, d2;
vector<int> g[N];
int timer=0;
void dfs(int at, int par) {
	d1.e[at]=d2.e[at]=++timer;
	for(int &to:g[at]) {
		if(to == par) {
			par+=N;
			continue;
		}
		if(d2.e[to]) {
			d1.e[at]=min(d1.e[at], d2.e[to]);		
		} else {
			dfs(to, at);
			d1.e[at]=min(d1.e[at], d1.e[to]);
		}
	}
	if(par>N)par-=N;
	if(d1.e[at] == d2.e[at] and at!=par) {
		printf("%d %d\n", at, par);
	}
}
int n, m, u, v;
int main() {
	srand(time(0));
 
	scanf("%d %d", &n, &m);
	//nt u, v;
	d1.e.resize(N);
	d2.e.resize(N);
	for(int i = 1;i<N;i++)d1.e[i]=d2.e[i]=-1;
	for(int i = 0;i<m;i++) {
		scanf("%d %d", &u, &v);
		if((d1.join(u, v) || d2.join(u, v))) {
			g[u].push_back(v);
			g[v].push_back(u);
		}
	}
	for(int i = 1;i<N;i++)d1.e[i]=d2.e[i]=0;
	for(int i= 1;i<=n;i++) {
		if(!d1.e[i]) {
			dfs(i, i);
		}
	}
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3932 KB Output is correct
2 Correct 4 ms 3676 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 3672 KB Output is correct
2 Correct 61 ms 3672 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 4176 KB Output is correct
2 Correct 124 ms 3956 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 5544 KB Output is correct
2 Runtime error 167 ms 19060 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 9716 KB Output is correct
2 Runtime error 243 ms 24920 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 380 ms 10580 KB Output is correct
2 Runtime error 405 ms 41372 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 12140 KB Output is correct
2 Runtime error 521 ms 49280 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 13648 KB Output is correct
2 Runtime error 627 ms 60756 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 720 ms 23992 KB Memory limit exceeded
2 Halted 0 ms 0 KB -