oj.uz

답안 #771528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771528 2023-07-03T06:01:32 Z PoonYaPat One-Way Streets (CEOI17_oneway) C++14
100 / 100
 45 ms 12428 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int n,m,mark1[100001],mark2[100001],dis[100001],k[100001],st_edge[100001];
vector<pii> adj[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] || mark1[s.first]==0) ans[s.second]='B';
            else if (mark1[s.first]>0) {
                if (st_edge[s.second]==x) ans[s.second]='L';
                else ans[s.second]='R';
            } else if (mark1[s.first]<0) {
                if (st_edge[s.second]==x) ans[s.second]='R';
                else ans[s.second]='L';
            }

            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));
        st_edge[i]=a;
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2664 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2664 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 29 ms 7408 KB Output is correct
12 Correct 31 ms 8236 KB Output is correct
13 Correct 28 ms 9280 KB Output is correct
14 Correct 41 ms 9752 KB Output is correct
15 Correct 29 ms 9864 KB Output is correct
16 Correct 31 ms 7892 KB Output is correct
17 Correct 27 ms 9472 KB Output is correct
18 Correct 26 ms 7896 KB Output is correct
19 Correct 29 ms 10580 KB Output is correct
20 Correct 33 ms 7800 KB Output is correct
21 Correct 23 ms 7504 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2664 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 29 ms 7408 KB Output is correct
12 Correct 31 ms 8236 KB Output is correct
13 Correct 28 ms 9280 KB Output is correct
14 Correct 41 ms 9752 KB Output is correct
15 Correct 29 ms 9864 KB Output is correct
16 Correct 31 ms 7892 KB Output is correct
17 Correct 27 ms 9472 KB Output is correct
18 Correct 26 ms 7896 KB Output is correct
19 Correct 29 ms 10580 KB Output is correct
20 Correct 33 ms 7800 KB Output is correct
21 Correct 23 ms 7504 KB Output is correct
22 Correct 37 ms 9420 KB Output is correct
23 Correct 41 ms 7804 KB Output is correct
24 Correct 43 ms 7852 KB Output is correct
25 Correct 41 ms 12428 KB Output is correct
26 Correct 38 ms 9060 KB Output is correct
27 Correct 37 ms 7880 KB Output is correct
28 Correct 21 ms 5488 KB Output is correct
29 Correct 45 ms 7376 KB Output is correct
30 Correct 35 ms 7508 KB Output is correct
31 Correct 36 ms 7900 KB Output is correct
32 Correct 38 ms 9680 KB Output is correct