oj.uz

Submission #221661

# Submission time Handle Problem Language Result Execution time Memory
221661 2020-04-10T20:50:15 Z Lawliet Pipes (CEOI15_pipes) C++17
0 / 100
 5 ms 512 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<short int,short int> pii;

const short int LOG = 8;
const short int MAXN = 101;

short int n, m;

short int sz[MAXN];
short int root[MAXN];
short int prof[MAXN];
short int dp[LOG][MAXN];
short int lastNode[MAXN];

vector< short int > adj[MAXN];

set< pii > bridges;

void DFS(short int cur, short int p, short int curRoot)
{
	dp[0][cur] = p;
	root[cur] = curRoot;
	prof[cur] = prof[p] + 1;

	for(short int k = 1 ; k < LOG ; k++)
	{
		short int jump = dp[k - 1][cur];
		dp[k][cur] = dp[k - 1][jump];
	}

	for(short int i = 0 ; i < adj[cur].size() ; i++)
	{
		short int viz = adj[cur][i];

		if( viz != p )
			DFS( viz , cur , curRoot );
	}
}

short int getLastNode(short int cur)
{
	if( lastNode[cur] == cur ) return cur;
	return lastNode[cur] = getLastNode( lastNode[cur] );
}

short int LCA(short int U, short int V)
{
	if( prof[U] < prof[V] ) swap( U , V );

	short int d = prof[U] - prof[V];

	for(short int k = 0 ; k < LOG ; k++)
		if( d & (1 << k) ) U = dp[k][U];

	if( U == V ) return U;

	for(short int k = LOG - 1 ; k >= 0 ; k--)
	{
		if( dp[k][U] != dp[k][V] )
		{
			U = dp[k][U];
			V = dp[k][V];
		}
	}

	return dp[0][U];
}

void mergePath(short int U, short int L)
{
	U = getLastNode( U );

	while( prof[U] > prof[L] )
	{
		bridges.erase( { U , dp[0][U] } );
		bridges.erase( { dp[0][U] , U } );

		lastNode[U] = dp[0][U];

		U = getLastNode( U );
	}
}

void addEdge(short int U, short int V)
{
	if( root[U] != root[V] )
	{
		adj[U].push_back( V );
		adj[V].push_back( U );

		bridges.insert( { U , V } );

		if( sz[ root[U] ] < sz[ root[V] ] ) 
			swap( U , V );

		sz[U] += sz[V];

		DFS( V , U , root[U] );

		return;
	}

	short int L = LCA( U , V );

	mergePath( U , L );
	mergePath( V , L );
}

int main()
{
	scanf("%d %d",&n,&m);

	for(short int i = 1 ; i <= n ; i++)
	{
		sz[i] = 1;
		root[i] = i;
		lastNode[i] = i;
	}

	for(short int i = 1 ; i <= m ; i++)
	{
		short int U, V;
		scanf("%d %d",&U,&V);

		addEdge( U , V );
	}

	for(auto it = bridges.begin() ; it != bridges.end() ; it++)
		printf("%d %d\n",it->first,it->second);
}

Compilation message

pipes.cpp: In function 'void DFS(short int, short int, short int)':
pipes.cpp:33:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(short int i = 0 ; i < adj[cur].size() ; i++)
                        ~~^~~~~~~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:113:21: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'short int*' [-Wformat=]
  scanf("%d %d",&n,&m);
                ~~   ^
pipes.cpp:113:21: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'short int*' [-Wformat=]
pipes.cpp:125:22: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'short int*' [-Wformat=]
   scanf("%d %d",&U,&V);
                 ~~   ^
pipes.cpp:125:22: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'short int*' [-Wformat=]
pipes.cpp:113:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
pipes.cpp:125:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&U,&V);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Wrong number of edges