oj.uz

Submission #1034724

# Submission time Handle Problem Language Result Execution time Memory
1034724 2024-07-25T17:13:22 Z vjudge1 Pipes (CEOI15_pipes) C++17
40 / 100
 162 ms 16724 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 30'010;
struct dsu {
	int e[N];
	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) {
	bool ck=0;

	d1.e[at]=d2.e[at]=++timer;
	for(int to:g[at]) {
		if(to == par and ck==0) {
			ck=1;
			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(d1.e[at] == d2.e[at] and at!=par) {
		cout << at << " " << par << "\n";
	}
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int n, m;
	cin >> n >> m;
	int u, v;
	for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=-1;
	for(int i = 0;i<m;i++) {
		cin >> 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:44:40: warning: iteration 30009 invokes undefined behavior [-Waggressive-loop-optimizations]
   44 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=-1;
      |                                 ~~~~~~~^~~
pipes.cpp:44:17: note: within this loop
   44 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=-1;
      |                ~^~~
pipes.cpp:52:40: warning: iteration 30009 invokes undefined behavior [-Waggressive-loop-optimizations]
   52 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=0;
      |                                 ~~~~~~~^~
pipes.cpp:52:17: note: within this loop
   52 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=0;
      |                ~^~~
pipes.cpp:44:40: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [120040, 120043] is out of the bounds [0, 120040] of object 'd2' with type 'dsu' [-Warray-bounds]
   44 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=-1;
      |                                 ~~~~~~~^~~
pipes.cpp:15:7: note: 'd2' declared here
   15 | } d1, d2;
      |       ^~
pipes.cpp:44:32: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [120040, 120043] is out of the bounds [0, 120040] of object 'd1' with type 'dsu' [-Warray-bounds]
   44 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=-1;
      |                         ~~~~~~~^~~~~~~~~~~
pipes.cpp:15:3: note: 'd1' declared here
   15 | } d1, d2;
      |   ^~
pipes.cpp:52:40: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [120040, 120043] is out of the bounds [0, 120040] of object 'd2' with type 'dsu' [-Warray-bounds]
   52 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=0;
      |                                 ~~~~~~~^~
pipes.cpp:15:7: note: 'd2' declared here
   15 | } d1, d2;
      |       ^~
pipes.cpp:52:32: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [120040, 120043] is out of the bounds [0, 120040] of object 'd1' with type 'dsu' [-Warray-bounds]
   52 |  for(int i = 1;i<=N;i++)d1.e[i]=d2.e[i]=0;
      |                         ~~~~~~~^~~~~~~~~~
pipes.cpp:15:3: note: 'd1' declared here
   15 | } d1, d2;
      |   ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6040 KB Output is correct
2 Correct 59 ms 5712 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 9656 KB Output is correct
2 Correct 118 ms 10628 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 15952 KB Output is correct
2 Runtime error 140 ms 16724 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 2396 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 2392 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2440 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2396 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2396 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -