oj.uz

Submission #771527

# Submission time Handle Problem Language Result Execution time Memory
771527 2023-07-03T05:54:23 Z PoonYaPat One-Way Streets (CEOI17_oneway) C++14
100 / 100
 45 ms 12844 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
typedef pair<int,int> pii;

int n,m,mark1[100001],mark2[100001],dis[100001],k[100001];
vector<pii> adj[100001];
pii edge[100001];
bool vis[100001],use[100001];
string ans;

void dfs(int x) {
    vis[x]=true;
    for (auto s : adj[x]) {
        if (use[s.second]) continue;
        use[s.second]=true;
        if (vis[s.first]) {
            ++mark2[x];
            --mark2[s.first];
            ans[s.second]='B';
        } else {
            dfs(s.first);

            if (mark2[s.first]) ans[s.second]='B';
            else {
                if (mark1[s.first]>0) {
                    if (edge[s.second].first==x) ans[s.second]='L';
                    else ans[s.second]='R';
                } else if (mark1[s.first]<0) {
                    if (edge[s.second].first==x) ans[s.second]='R';
                    else ans[s.second]='L';
                } else ans[s.second]='B';
            }

            mark2[x]+=mark2[s.first];
            mark1[x]+=mark1[s.first];
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for (int i=0; i<m; ++i) {
        int a,b; cin>>a>>b;
        ans+=" ";
        adj[a].push_back(pii(b,i));
        adj[b].push_back(pii(a,i));
        edge[i]=pii(a,b);
    }
    int k; cin>>k;
    while (k--) {
        int a,b; cin>>a>>b;
        mark1[a]++;
        mark1[b]--;
    }

    for (int i=1; i<=n; ++i) if (!vis[i]) dfs(i);
    cout<<ans;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 24 ms 7784 KB Output is correct
12 Correct 25 ms 8644 KB Output is correct
13 Correct 28 ms 9584 KB Output is correct
14 Correct 30 ms 10136 KB Output is correct
15 Correct 34 ms 10136 KB Output is correct
16 Correct 25 ms 8368 KB Output is correct
17 Correct 34 ms 9764 KB Output is correct
18 Correct 28 ms 8296 KB Output is correct
19 Correct 26 ms 10964 KB Output is correct
20 Correct 32 ms 8196 KB Output is correct
21 Correct 24 ms 7936 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 24 ms 7784 KB Output is correct
12 Correct 25 ms 8644 KB Output is correct
13 Correct 28 ms 9584 KB Output is correct
14 Correct 30 ms 10136 KB Output is correct
15 Correct 34 ms 10136 KB Output is correct
16 Correct 25 ms 8368 KB Output is correct
17 Correct 34 ms 9764 KB Output is correct
18 Correct 28 ms 8296 KB Output is correct
19 Correct 26 ms 10964 KB Output is correct
20 Correct 32 ms 8196 KB Output is correct
21 Correct 24 ms 7936 KB Output is correct
22 Correct 38 ms 9804 KB Output is correct
23 Correct 38 ms 8212 KB Output is correct
24 Correct 41 ms 8292 KB Output is correct
25 Correct 39 ms 12844 KB Output is correct
26 Correct 36 ms 9440 KB Output is correct
27 Correct 37 ms 8340 KB Output is correct
28 Correct 28 ms 5840 KB Output is correct
29 Correct 34 ms 7764 KB Output is correct
30 Correct 34 ms 7908 KB Output is correct
31 Correct 45 ms 8284 KB Output is correct
32 Correct 35 ms 10060 KB Output is correct