oj.uz

Submission #1012558

# Submission time Handle Problem Language Result Execution time Memory
1012558 2024-07-02T10:38:30 Z MODDI One-Way Streets (CEOI17_oneway) C++14
100 / 100
 137 ms 30868 KB 
#include <bits/stdc++.h>
#include <fstream>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define mod 1000000007
#define INF 1000000000
#define INF2 2000000000
#define fi first
#define se second
using namespace std;
double const EPS = 1e-14;
const int P = 1007;
typedef long long ll;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // find_by_order, order_of_key
const int Max = 1e5 + 5;
vector<int> v[Max];
int sta[Max], low[Max], par[Max];
int tim = 0, cntx = 0, cnty = 0;
map<pair<int,int>,int> mp, check;
bool vis[Max], ok = false;
int okx[Max], oky[Max];
void dfs(int s, int p) {
    tim++;
    vis[s] = 1; sta[s] = tim; low[s] = tim;
    for(auto i : v[s]) {
        if(vis[i] == 0) {
            dfs(i,s);
            low[s] = min(low[s],low[i]);
            okx[s]+=okx[i]; //you need to keep track of the count of left ends in the given subtree
            oky[s]+=oky[i]; //you need to keep track of the count of right ends in the given subtree
            if(low[i] > sta[s]) {
                if(okx[i] > oky[i]) { //if there are more left than right ends in the subtree of i, this means that one path leaves its subtree across the bridge and the edge needs to be directed from i to s
                    mp[{i,s}] = 2;
                    mp[{s,i}] = 3;
                }
                else if(okx[i] < oky[i]) { //if there are more right than left ends in the subtree of i, this means that one path enters its subtree across the bridge and the edge needs to be directed from s to i
                    mp[{s,i}] = 2;
                    mp[{i,s}] = 3;
                }
            }
        }
        else if(i != p || par[s] > 0){
            low[s] = min(sta[i],low[s]);
        }
        else if(i == p) {
            par[s]++;
        }
    }
    cntx += okx[s];  cnty += oky[s];
}
int main()
{
    ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
    int n, m; cin >> n >> m;
    pair<int,int> edge[m];
    for(int i = 0; i < m; i++) {
        int a, b; cin >> a >> b;
        edge[i].fi = a, edge[i].se = b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    int p; cin >> p;
    while(p--) {
        int a, b; cin >> a >> b;
        okx[a]++; oky[b]++;
    }
    for(int i = 1; i <= n; i++) {
        if(vis[i] == 0) {
            cntx = 0; cnty = 0; dfs(i,0);
        }
    }
    for(int i = 0; i < m; i++) {
        if(mp[{edge[i].fi,edge[i].se}] == 0) cout << 'B';
        else if(mp[{edge[i].fi,edge[i].se}] == 3) cout << 'L';
        else cout << 'R';
    }
    cout << endl;
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 51 ms 16144 KB Output is correct
12 Correct 58 ms 17488 KB Output is correct
13 Correct 56 ms 18888 KB Output is correct
14 Correct 60 ms 19284 KB Output is correct
15 Correct 60 ms 19076 KB Output is correct
16 Correct 58 ms 16208 KB Output is correct
17 Correct 73 ms 21324 KB Output is correct
18 Correct 55 ms 16284 KB Output is correct
19 Correct 80 ms 23124 KB Output is correct
20 Correct 54 ms 16976 KB Output is correct
21 Correct 47 ms 16480 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 51 ms 16144 KB Output is correct
12 Correct 58 ms 17488 KB Output is correct
13 Correct 56 ms 18888 KB Output is correct
14 Correct 60 ms 19284 KB Output is correct
15 Correct 60 ms 19076 KB Output is correct
16 Correct 58 ms 16208 KB Output is correct
17 Correct 73 ms 21324 KB Output is correct
18 Correct 55 ms 16284 KB Output is correct
19 Correct 80 ms 23124 KB Output is correct
20 Correct 54 ms 16976 KB Output is correct
21 Correct 47 ms 16480 KB Output is correct
22 Correct 121 ms 25936 KB Output is correct
23 Correct 133 ms 23468 KB Output is correct
24 Correct 137 ms 23120 KB Output is correct
25 Correct 126 ms 30868 KB Output is correct
26 Correct 127 ms 25428 KB Output is correct
27 Correct 133 ms 23616 KB Output is correct
28 Correct 30 ms 8028 KB Output is correct
29 Correct 62 ms 17540 KB Output is correct
30 Correct 61 ms 17744 KB Output is correct
31 Correct 63 ms 18256 KB Output is correct
32 Correct 72 ms 22096 KB Output is correct