oj.uz

Submission #720567

# Submission time Handle Problem Language Result Execution time Memory
720567 2023-04-08T13:26:22 Z bane One-Way Streets (CEOI17_oneway) C++17
100 / 100
 188 ms 39372 KB 
#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(0,n)
        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]]--;
    }
    fori(0,scc)
        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;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8148 KB Output is correct
2 Correct 6 ms 8172 KB Output is correct
3 Correct 5 ms 8168 KB Output is correct
4 Correct 7 ms 8404 KB Output is correct
5 Correct 7 ms 8432 KB Output is correct
6 Correct 6 ms 8148 KB Output is correct
7 Correct 6 ms 8432 KB Output is correct
8 Correct 6 ms 8404 KB Output is correct
9 Correct 6 ms 8148 KB Output is correct
10 Correct 8 ms 8148 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8148 KB Output is correct
2 Correct 6 ms 8172 KB Output is correct
3 Correct 5 ms 8168 KB Output is correct
4 Correct 7 ms 8404 KB Output is correct
5 Correct 7 ms 8432 KB Output is correct
6 Correct 6 ms 8148 KB Output is correct
7 Correct 6 ms 8432 KB Output is correct
8 Correct 6 ms 8404 KB Output is correct
9 Correct 6 ms 8148 KB Output is correct
10 Correct 8 ms 8148 KB Output is correct
11 Correct 56 ms 13408 KB Output is correct
12 Correct 50 ms 14636 KB Output is correct
13 Correct 56 ms 16200 KB Output is correct
14 Correct 74 ms 20484 KB Output is correct
15 Correct 119 ms 22072 KB Output is correct
16 Correct 131 ms 32700 KB Output is correct
17 Correct 136 ms 34720 KB Output is correct
18 Correct 165 ms 32640 KB Output is correct
19 Correct 104 ms 36016 KB Output is correct
20 Correct 45 ms 14340 KB Output is correct
21 Correct 41 ms 14068 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8148 KB Output is correct
2 Correct 6 ms 8172 KB Output is correct
3 Correct 5 ms 8168 KB Output is correct
4 Correct 7 ms 8404 KB Output is correct
5 Correct 7 ms 8432 KB Output is correct
6 Correct 6 ms 8148 KB Output is correct
7 Correct 6 ms 8432 KB Output is correct
8 Correct 6 ms 8404 KB Output is correct
9 Correct 6 ms 8148 KB Output is correct
10 Correct 8 ms 8148 KB Output is correct
11 Correct 56 ms 13408 KB Output is correct
12 Correct 50 ms 14636 KB Output is correct
13 Correct 56 ms 16200 KB Output is correct
14 Correct 74 ms 20484 KB Output is correct
15 Correct 119 ms 22072 KB Output is correct
16 Correct 131 ms 32700 KB Output is correct
17 Correct 136 ms 34720 KB Output is correct
18 Correct 165 ms 32640 KB Output is correct
19 Correct 104 ms 36016 KB Output is correct
20 Correct 45 ms 14340 KB Output is correct
21 Correct 41 ms 14068 KB Output is correct
22 Correct 126 ms 35700 KB Output is correct
23 Correct 131 ms 33872 KB Output is correct
24 Correct 188 ms 33732 KB Output is correct
25 Correct 110 ms 39372 KB Output is correct
26 Correct 126 ms 35344 KB Output is correct
27 Correct 125 ms 33968 KB Output is correct
28 Correct 31 ms 11340 KB Output is correct
29 Correct 62 ms 14980 KB Output is correct
30 Correct 55 ms 15208 KB Output is correct
31 Correct 75 ms 15676 KB Output is correct
32 Correct 73 ms 23144 KB Output is correct