oj.uz

Submission #959109

# Submission time Handle Problem Language Result Execution time Memory
959109 2024-04-07T13:44:31 Z Cyber_Wolf Pipes (CEOI15_pipes) C++17
50 / 100
 882 ms 48996 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
 
const int N = 1e5+5;
 
vector<vector<int>> adj;
vector<int> tin;
vector<array<int, 2>> par;
int n, m, tmp;

int get(int src, int t)
{
	if(src == par[src][t])	return src;
	return par[src][t] = get(par[src][t], t);
}

bool join(int u, int v, int t)
{
	u = get(u, t), v = get(v, t);
	if(u == v)	return false;
	par[u][t] = v;
	return true;
}
 
int dfs(int src, int pa = -1)
{
	int low, idx = 0;
	tin[src] = low = ++tmp;
	for(auto it : adj[src])
	{
		if(it == pa)
		{
			idx++;	
			continue;
		}
		if(tin[it])
		{
			low = min(low, tin[it]);
			idx++;	
			continue;
		}
		int low_it = dfs(it, src);
		low = min(low, low_it);
		if(idx && adj[src][idx-1] == it)	
		{
			idx++;
			continue;
		}
		if(idx+1 < adj[src].size() && adj[src][idx+1] == it)	
		{
			idx++;
			continue;
		}
		if(low_it > tin[src])
		{
			cout << src << ' ' << it << endl;
		}
		idx++;		
	}
	return low;
}
 
int main()
{
	fastio;
	cin >> n >> m;
	adj = vector<vector<int>> (n+1);
	par = vector<array<int, 2>> (n+1);
	tin = vector<int> (n+1);
	for(int i = 1; i <= n; i++)	par[i] = {i, i};
	for(int i = 0; i < m; i++)
	{
		int u, v;
		cin >> u >> v;
		if(join(u, v, 0) || join(u, v, 1))	
		{
			adj[u].push_back(v), adj[v].push_back(u);
		}
	}
	for(int i = 1; i <= n; i++)	sort(adj[i].begin(), adj[i].end());
	for(int i = 1; i <= n; i++)
	{
		if(!tin[i])	dfs(i);
	}
 
    return 0;
}

Compilation message

pipes.cpp: In function 'int dfs(int, int)':
pipes.cpp:52:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   if(idx+1 < adj[src].size() && adj[src][idx+1] == it)
      |      ~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1116 KB Output is correct
2 Correct 5 ms 856 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 4040 KB Output is correct
2 Correct 68 ms 3664 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 7060 KB Output is correct
2 Correct 148 ms 7308 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 12292 KB Output is correct
2 Correct 199 ms 10672 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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