oj.uz

답안 #695076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
695076 2023-02-04T17:22:47 Z ShaShi One-Way Streets (CEOI17_oneway) C++17
0 / 100
 5 ms 9684 KB 
/** This is the end ... **/
// #pragma GCC optmpmize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define int long long int
#define dint long double
#define endl "\n"
#define pii pair<int, int>
#define pb push_back
#define F first
#define S second
 
using namespace std;
 
const int MOD = (int)1e9 + 7;
const int MAXN = (int)2e5 + 23;
const int MAXK = (int)40000 + 23;
const int MAX_LOG = 23;
const int PRM = (int)31622 + 23;
const int INF = (int)9e9;
 
int POW(int x, int y) {
    return (!y ? 1 : (y & 1 ? x * POW(x * x % MOD, y / 2) % MOD : POW(x * x % MOD, y / 2) % MOD));
}
 
int n, m, s, q, t, tmp, tmp2, cmp, u, v, u2, v2, ow, ans1, ans2, k, flag, l, r, mid;
int arr[MAXN], cnt[MAXN], h[MAXN], seen[MAXN], pow2dad[MAXN][MAX_LOG], cnt2[MAXN], dad[MAXN], bala[MAXN], payin[MAXN], bkedge[MAXN];
vector<pii> adj[MAXN];
vector<pii> edge;
vector<int> vec, e[MAXN];
 
int low[MAXN], comp[MAXN], w[MAXN];
 
void DFS(int u, int p=-1) {
     vec.pb(u);
 
     tmp++;
     low[u] = tmp;
     seen[u] = tmp;
 
     for (auto cur:adj[u]) {
          v = cur.F;
          
          if (cur.S == p || comp[v]) continue;
 
          if (!seen[v]) {
               DFS(v, cur.S);
 
               
               low[u] = min(low[u], low[v]);
          } else {
               low[u] = min(low[u], seen[v]);
          }
     }
 
 
     if (low[u] == seen[u]) {
          m++;
 
          while (vec.size()) {
               v = vec.back();
               vec.pop_back();
 
               comp[v] = m;
 
               for (auto w:adj[v]) {
                    if (comp[w.first] && m != comp[w.first]) {
                         e[m].pb(comp[w.first]);
                    }
               }
               if (v == u) break;
          }
     }
}
 
void DFS2(int u) {
     seen[u] = 1;
 
     for (auto v:e[u]) {
          if (!seen[v]) {
               DFS2(v);
          }
          w[u] += w[v];
     }
}
 
 
int32_t main() {
     ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
 
     cin >> n >> m;
 
     for (int i=1; i<=m; i++) {
          cin >> u >> v;
 
 
          adj[u].pb({v, i});
          adj[v].pb({u, i});
          edge.pb({u, v});
     }
 
     for (int i=1; i<=n; i++) {
          if (!seen[i]) DFS(i);
     }
 
 
     cin >> q;
 
     while (q--) {
          cin >> u >> v;
 
          u = comp[u];
          v = comp[v];
 
          w[u]++;
          w[v]--;
     }
     
     fill(seen, seen+n+m+1, 0);
 
     for (int i=1; i<=m; i++) {
          if (!seen[i]) DFS2(i);
     }
 
     for (auto cur:edge) {
          u = cur.F;
          v = cur.S;
          u = comp[u];
          v = comp[v];
 
          if (u == v) {
               cout << 'B';
          } else if (u > v) {
               if (w[v] < 0) {
                    cout << 'R';
               } else if (w[v] > 0) { 
                    cout << 'L';
               } else {
                    cout << 'B';
               }
          } else {
               if (w[u] < 0) {
                    cout << 'L';
               } else if (w[u] > 0) {
                    cout << 'R';
               } else { 
                    cout << 'B';
               }
          }
     }
 
 
 
 
     return 0;
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 9684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 9684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 9684 KB Output isn't correct
2 Halted 0 ms 0 KB -