Submission #1273510

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273510		zowi	One-Way Streets (CEOI17_oneway)	C++20	0 / 100	1 ms	332 KiB

oneway

#include<bits/stdc++.h>
using namespace std;

int pre[100005];
int post[100005];
vector<int> graf[100005];
vector<int> graf_s[100005];
int dok[100005];
int odw[100005];
int low[100005];
int p = 1;
int po = 1;
int jump[100005][20];
int wag[100005];
int wag1[100005];
int wyn[100005];
map<pair<int,int>,int> k1;
map<pair<int,int>,pair<int,int>> k;

void dfs(int x,int po)
{
	odw[x] = 1;
	pre[x] = p;
	p++;
	int malo = p-1;
	for(int i : graf[x])
	{
		if(po == i) continue;
		if(odw[i] == 0)
		{
			dok[i] = x;
			dfs(i,x);
			malo = min(low[i],malo);
		}
		else
		{
			malo = min(malo,pre[i]);
		}
	}
	low[x] = malo;
}

void dfs1(int x)
{
	odw[x] = 1;
	pre[x] = p;
	p++;
	for(int i : graf_s[x])
	{
		if(odw[i] == 0)
		{
			jump[i][0] = x;
			dfs1(i);
		}
	}
	post[x] = po;
	po++;
}

int lca(int x,int y)
{
	if(pre[x] <= pre[y] && post[x] >= post[y])
	{
		return x;
	}
	if(pre[x] >= pre[y] && post[x] <= post[y])
	{
		return y;
	}
	for(int i = 18;i >= 0;--i)
	{
		if(jump[x][i] == 0) continue;
		if(!(pre[jump[x][i]] <= pre[y] && post[jump[x][i]] >= post[y]))
		{
			x = jump[x][i];
		}
	}
	return jump[x][0];
}

void dfs2(int x)
{
	odw[x] = 1;
	for(int i : graf_s[x])
	{
		if(odw[i] == 0)
		{
			dfs2(i);
			wag[x] += wag[i];
 		}
	}
}
void dfs3(int x)
{
	odw[x] = 1;
	for(int i : graf_s[x])
	{
		if(odw[i] == 0)
		{
			dfs3(i);
			wag1[x] += wag1[i];
 		}
	}
}


int main()
{
	ios_base::sync_with_stdio(0);
	int n,m,a,b,m1;
	cin >> n >> m;
	m1 = m;
	for(int i = 0;i < m;++i)
	{
		cin >> a >> b;
		graf[a].push_back(b);
		graf[b].push_back(a);
		k1[{min(a,b),max(a,b)}] = i;
	}
	dfs(1,-1);
	for(int i = 1;i <= n;++i)
	{
		//cout << pre[i] << ' ';
	}
	//cout << endl;
	for(int i = 1;i <= n;++i)
	{
		//cout << low[i] << ' ';
	}
	for(int i = 1;i <= n;++i)
	{
		odw[i] = 0;
	}
	for(int i = 2;i <= n;++i)
	{
		if(low[i] != low[dok[i]])
		{
			k[{min(low[i],low[dok[i]]),max(low[i],low[dok[i]])}] = {min(i,dok[i]),max(i,dok[i])};
			graf_s[low[i]].push_back(low[dok[i]]);
			graf_s[low[dok[i]]].push_back(low[i]);
		}
	}
	for(int i = 1;i <= n;++i)
	{
		//cout << low[i] << ':' << ' ';
		for(int j : graf_s[low[i]])
		{
			//cout << j << ' ';
		}
		//cout << endl;
	}
	dfs1(1);
	for(int i = 1;i <= 18;++i)
	{
		for(int j = 1;j <= n;++j)
		{
			jump[j][i] = jump[jump[j][i-1]][i-1];
		}
	}
	p = 1;
	for(int i = 1;i <= n;++i)
	{
		//cout << post[i] << ' ';
	}
	//cout << endl;
	cin >> m;
	for(int i = 1;i <= n;++i)
	{
		odw[i] = 0;
	}
	for(int i = 0;i < m;++i)
	{
		cin >> a >> b;
		//cout<< low[lca(low[a],low[b])] << endl;
		wag[low[a]]++;
		wag1[low[b]]++;
		wag[low[lca(low[a],low[b])]]--;
		wag1[low[lca(low[a],low[b])]]--;
	}
	dfs2(1);
	for(int i = 1;i <= n;++i)
	{
		odw[i] = 0;
	}
	dfs3(1);
	for(int i = 2;i <= n;++i)
	{
		////cout << wag[low[i]] << ' ';
		if(wag[low[i]] > 0)
		{
			if(low[i] != low[dok[i]])
			{
				//cout << k[{min(low[i],low[dok[i]]),max(low[i],low[dok[i]])}].first << ' ' << k[{min(low[i],low[dok[i]]),max(low[i],low[dok[i]])}].second << endl;
				wyn[k1[k[{min(low[i],low[dok[i]]),max(low[i],low[dok[i]])}]]] = 1;
			}
		}
	}
	for(int i = 2;i <= n;++i)
	{
		////cout << wag1[low[i]] << ' ';
		if(wag1[low[i]] > 0)
		{
			if(low[i] != low[dok[i]])
			{
				//cout << k[{min(low[i],low[dok[i]]),max(low[i],low[dok[i]])}].first << ' ' << k[{min(low[i],low[dok[i]]),max(low[i],low[dok[i]])}].second << endl;
				wyn[k1[k[{min(low[i],low[dok[i]]),max(low[i],low[dok[i]])}]]] = 2;
			}
		}
	}
	for(int i = 0;i < m1;++i)
	{
		////cout << wyn[i];
		if(wyn[i] == 0)
		{
			cout << 'B';
		}
		if(wyn[i] == 1)
		{
			cout << 'R';
		}
		if(wyn[i] == 2)
		{
			cout << 'L';
		}
	}
	
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40