#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
#define fori(a,b) for(int i=a;i<b;i++)
#define forj(a,b) for(int j=a;j<b;j++)
#define fork(a,b) for(int k=a;k<b;k++)
#define ford(i,a,b) for(int i=a;i>=b;i--)
#define seto(x,i) memset(x,i,sizeof x)
#define pf first
#define ps second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=100010;
int n,m,p,a,b,c,scc,dfn[N],low[N],id[N],inx,dist[N],val[N];
bool ins[N];
stack<int> st;
vector<int> gr[N];
unordered_set<int> cgr[N];
pii edge[N];
void tarjan(int v,int p)
{
dfn[v]=low[v]=++inx;
ins[v]=true; st.push(v);
for(auto i:gr[v])
{
if(i==p)
{
p=-1;
continue;
}
if(!dfn[i])
{
tarjan(i,v);
low[v]=min(low[v],low[i]);
}
else if(ins[i])
low[v]=min(low[v],dfn[i]);
}
if(dfn[v]==low[v])
{
while(st.top()!=v)
{
id[st.top()]=scc;
ins[st.top()]=0;
st.pop();
}
id[st.top()]=scc;
ins[st.top()]=0;
st.pop();
scc++;
}
}
void dfs(int v,int p)
{
for(auto i:cgr[v])
if(i!=p)
{
dist[i]=dist[v]+1;
dfs(i,v);
val[v]+=val[i];
}
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>m;
fori(0,m)
{
cin>>edge[i].pf>>edge[i].ps;
gr[edge[i].pf].push_back(edge[i].ps);
gr[edge[i].ps].push_back(edge[i].pf);
}
fori(1,n+1)
if(!dfn[i])
tarjan(i,-1);
fori(0,m)
if(id[edge[i].pf]!=id[edge[i].ps])
{
cgr[id[edge[i].pf]].insert(id[edge[i].ps]);
cgr[id[edge[i].ps]].insert(id[edge[i].pf]);
}
cin>>p;
fori(0,p)
{
cin>>a>>b;
val[id[a]]++;
val[id[b]]--;
}
for(int i = 0; i < scc; i++)
if(!dist[i])
dfs(i,-1);
fori(0,m)
{
a=id[edge[i].pf]; b=id[edge[i].ps];
if(a==b)
cout<<"B";
if(dist[a]>dist[b])
{
if(val[a]>0)
cout<<"R";
if(val[a]==0)
cout<<"B";
if(val[a]<0)
cout<<"L";
}
if(dist[a]<dist[b])
{
if(val[b]>0)
cout<<"L";
if(val[b]==0)
cout<<"B";
if(val[b]<0)
cout<<"R";
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8148 KB |
Output is correct |
2 |
Correct |
4 ms |
8148 KB |
Output is correct |
3 |
Correct |
5 ms |
8148 KB |
Output is correct |
4 |
Correct |
5 ms |
8404 KB |
Output is correct |
5 |
Correct |
6 ms |
8404 KB |
Output is correct |
6 |
Correct |
5 ms |
8148 KB |
Output is correct |
7 |
Correct |
7 ms |
8424 KB |
Output is correct |
8 |
Correct |
8 ms |
8420 KB |
Output is correct |
9 |
Correct |
6 ms |
8148 KB |
Output is correct |
10 |
Correct |
6 ms |
8148 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8148 KB |
Output is correct |
2 |
Correct |
4 ms |
8148 KB |
Output is correct |
3 |
Correct |
5 ms |
8148 KB |
Output is correct |
4 |
Correct |
5 ms |
8404 KB |
Output is correct |
5 |
Correct |
6 ms |
8404 KB |
Output is correct |
6 |
Correct |
5 ms |
8148 KB |
Output is correct |
7 |
Correct |
7 ms |
8424 KB |
Output is correct |
8 |
Correct |
8 ms |
8420 KB |
Output is correct |
9 |
Correct |
6 ms |
8148 KB |
Output is correct |
10 |
Correct |
6 ms |
8148 KB |
Output is correct |
11 |
Correct |
38 ms |
12364 KB |
Output is correct |
12 |
Correct |
38 ms |
13436 KB |
Output is correct |
13 |
Correct |
50 ms |
15012 KB |
Output is correct |
14 |
Correct |
65 ms |
19320 KB |
Output is correct |
15 |
Correct |
90 ms |
20940 KB |
Output is correct |
16 |
Correct |
138 ms |
31488 KB |
Output is correct |
17 |
Correct |
105 ms |
33568 KB |
Output is correct |
18 |
Correct |
133 ms |
31540 KB |
Output is correct |
19 |
Correct |
108 ms |
34944 KB |
Output is correct |
20 |
Correct |
58 ms |
13260 KB |
Output is correct |
21 |
Correct |
37 ms |
13004 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8148 KB |
Output is correct |
2 |
Correct |
4 ms |
8148 KB |
Output is correct |
3 |
Correct |
5 ms |
8148 KB |
Output is correct |
4 |
Correct |
5 ms |
8404 KB |
Output is correct |
5 |
Correct |
6 ms |
8404 KB |
Output is correct |
6 |
Correct |
5 ms |
8148 KB |
Output is correct |
7 |
Correct |
7 ms |
8424 KB |
Output is correct |
8 |
Correct |
8 ms |
8420 KB |
Output is correct |
9 |
Correct |
6 ms |
8148 KB |
Output is correct |
10 |
Correct |
6 ms |
8148 KB |
Output is correct |
11 |
Correct |
38 ms |
12364 KB |
Output is correct |
12 |
Correct |
38 ms |
13436 KB |
Output is correct |
13 |
Correct |
50 ms |
15012 KB |
Output is correct |
14 |
Correct |
65 ms |
19320 KB |
Output is correct |
15 |
Correct |
90 ms |
20940 KB |
Output is correct |
16 |
Correct |
138 ms |
31488 KB |
Output is correct |
17 |
Correct |
105 ms |
33568 KB |
Output is correct |
18 |
Correct |
133 ms |
31540 KB |
Output is correct |
19 |
Correct |
108 ms |
34944 KB |
Output is correct |
20 |
Correct |
58 ms |
13260 KB |
Output is correct |
21 |
Correct |
37 ms |
13004 KB |
Output is correct |
22 |
Correct |
121 ms |
33492 KB |
Output is correct |
23 |
Correct |
132 ms |
31732 KB |
Output is correct |
24 |
Correct |
153 ms |
31436 KB |
Output is correct |
25 |
Correct |
103 ms |
37104 KB |
Output is correct |
26 |
Correct |
133 ms |
32884 KB |
Output is correct |
27 |
Correct |
132 ms |
31576 KB |
Output is correct |
28 |
Correct |
29 ms |
10188 KB |
Output is correct |
29 |
Correct |
61 ms |
12692 KB |
Output is correct |
30 |
Correct |
55 ms |
12864 KB |
Output is correct |
31 |
Correct |
72 ms |
13336 KB |
Output is correct |
32 |
Correct |
73 ms |
20912 KB |
Output is correct |