oj.uz

Submission #985898

# Submission time Handle Problem Language Result Execution time Memory
985898 2024-05-19T09:28:27 Z alexdd One-Way Streets (CEOI17_oneway) C++17
60 / 100
 3000 ms 17072 KB 
#include<iostream>
#include<vector>
using namespace std;
const int INF = 1e9;
int n,m,p;
pair<int,int> e[100005];
int xr[100005];
vector<int> con[100005];
vector<int> relatii[100005];
bool visited[100005],visited_init[100005];
int mind[100005][3];///1 - in sus
int depth[100005];
int tin[100005],tout[100005],timer;
char rez[100005];
int parent[100005];
void dfs_init(int nod)
{
    visited_init[nod]=1;
    tin[nod]=++timer;
    for(auto x:con[nod])
    {
        int adj = nod ^ xr[x];
        if(!visited_init[adj])
        {
            parent[adj]=nod;
            dfs_init(adj);
        }
    }
    tout[nod]=++timer;
}
bool isanc(int x, int y)
{
    if(tin[x]<=tin[y] && tout[x]>=tout[y])
        return 1;
    return 0;
}
void dfs(int nod, int par)
{
    visited[nod]=1;
    mind[nod][0]=mind[nod][1]=mind[nod][2]=INF;
    for(auto x:con[nod])
    {
        if(x==par)
            continue;
        int adj = nod ^ xr[x];
        if(!visited[adj])
        {
            depth[adj] = depth[nod]+1;
            dfs(adj,x);
            for(int i=0;i<3;i++) mind[nod][i] = min(mind[nod][i], mind[adj][i]);
        }
        else
        {
            rez[x] = 'B';
            mind[nod][0] = min(mind[nod][0], depth[adj]);
        }
    }
    for(auto x:relatii[nod])
    {
        if(x<0)
        {
            x = -x;
            mind[nod][2] = min(mind[nod][2], depth[x]);
        }
        else
        {
            mind[nod][1] = min(mind[nod][1], depth[x]);
        }
    }
    if(par==0)
        return;
    if(mind[nod][0] < depth[nod])
    {
        rez[par] = 'B';
    }
    else///bridge
    {

        if(mind[nod][1] >= depth[nod] && mind[nod][2] >= depth[nod])
            rez[par] = 'B';
        else
        {
            if(e[par].first==nod)
            {
                if(mind[nod][1] >= depth[nod]) rez[par] = 'R';
                else rez[par] = 'L';
            }
            else
            {
                if(mind[nod][1] >= depth[nod]) rez[par] = 'L';
                else rez[par] = 'R';
            }
        }
        //rez[par]='X';
    }
}
int lca(int x, int y)
{
    if(isanc(x,y))
        return x;
    if(isanc(y,x))
        return y;
    while(!isanc(x,y))
        x=parent[x];
    return x;
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m;
    int a,b;
    for(int i=1;i<=m;i++)
    {
        cin>>e[i].first>>e[i].second;
        con[e[i].first].push_back(i);
        con[e[i].second].push_back(i);
        xr[i] = e[i].first ^ e[i].second;
    }
    for(int i=1;i<=n;i++)
        if(!visited_init[i])
            dfs_init(i);
    cin>>p;
    for(int i=1;i<=p;i++)
    {
        cin>>a>>b;
        int lc = lca(a,b);
        relatii[a].push_back(-lc);
        relatii[b].push_back(lc);
    }
    for(int i=1;i<=n;i++)
        if(!visited[i])
            dfs(i,0);
    for(int i=1;i<=m;i++)
        cout<<rez[i];
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 3 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5176 KB Output is correct
8 Correct 3 ms 5176 KB Output is correct
9 Correct 2 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 3 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5176 KB Output is correct
8 Correct 3 ms 5176 KB Output is correct
9 Correct 2 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 29 ms 11068 KB Output is correct
12 Correct 39 ms 12416 KB Output is correct
13 Correct 37 ms 13916 KB Output is correct
14 Correct 51 ms 15200 KB Output is correct
15 Correct 43 ms 15504 KB Output is correct
16 Correct 40 ms 13648 KB Output is correct
17 Correct 52 ms 15792 KB Output is correct
18 Correct 42 ms 13828 KB Output is correct
19 Correct 40 ms 17072 KB Output is correct
20 Correct 33 ms 12588 KB Output is correct
21 Correct 29 ms 12120 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 3 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5176 KB Output is correct
8 Correct 3 ms 5176 KB Output is correct
9 Correct 2 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 29 ms 11068 KB Output is correct
12 Correct 39 ms 12416 KB Output is correct
13 Correct 37 ms 13916 KB Output is correct
14 Correct 51 ms 15200 KB Output is correct
15 Correct 43 ms 15504 KB Output is correct
16 Correct 40 ms 13648 KB Output is correct
17 Correct 52 ms 15792 KB Output is correct
18 Correct 42 ms 13828 KB Output is correct
19 Correct 40 ms 17072 KB Output is correct
20 Correct 33 ms 12588 KB Output is correct
21 Correct 29 ms 12120 KB Output is correct
22 Execution timed out 3066 ms 14988 KB Time limit exceeded
23 Halted 0 ms 0 KB -