/** This is the end ... **/
// #pragma GCC optimize("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 pb
#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, 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> edges;
vector<int> vec, e[MAXN];
int low[MAXN], ti, comp[MAXN], w[MAXN];
void dfs(int u, int p) {
vec.pb(u);
low[u] = seen[u] = ++ti;
for (int i = 0; i < adj[u].size(); ++i) {
int v = adj[u][i].first;
int id = adj[u][i].second;
if (id == p) continue;
if (comp[v]) continue;
if (!seen[v]) {
dfs(v, id);
low[u] = min(low[u], low[v]);
} else low[u] = min(low[u], seen[v]);
}
if (low[u] == seen[u]) {
++m;
while (vec.size()) {
int 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;
edges.pb({u, v});
adj[u].pb({v, i});
adj[v].pb({u, i});
}
for (int i = 1; i <= n; ++i) {
if (!seen[i]) dfs(i, 0);
}
cin >> q;
while (q--) {
int u, v;
cin >> u >> v;
u = comp[u], v = comp[v];
if (u == v) continue;
++w[u], --w[v];
}
fill(seen, seen+m+1, 0);
for (int i = 1; i <= m; ++i) {
if (!seen[i]) DFS2(i);
}
for (int i = 0; i < edges.size(); ++i) {
int u = edges[i].first;
int v = edges[i].second;
u = comp[u], v = comp[v];
if (u == v) {
cout << 'B';
continue;
}
if (u > v) {
if (w[v] < 0) cout << 'R';
if (w[v] > 0) cout << 'L';
if (w[v] == 0) cout << 'B';
} else {
if (w[u] < 0) cout << 'L';
if (w[u] > 0) cout << 'R';
if (w[u] == 0) cout << 'B';
}
}
return 0;
}
Compilation message
oneway.cpp: In function 'void dfs(long long int, long long int)':
oneway.cpp:9:12: error: 'class std::vector<long long int>' has no member named 'pb'
9 | #define pb pb
| ^~
oneway.cpp:35:10: note: in expansion of macro 'pb'
35 | vec.pb(u);
| ^~
oneway.cpp:37:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
37 | for (int i = 0; i < adj[u].size(); ++i) {
| ~~^~~~~~~~~~~~~~~
oneway.cpp:9:12: error: 'class std::vector<long long int>' has no member named 'pb'
9 | #define pb pb
| ^~
oneway.cpp:54:67: note: in expansion of macro 'pb'
54 | if (comp[w.first] && m != comp[w.first]) e[m].pb(comp[w.first]);
| ^~
oneway.cpp: In function 'int32_t main()':
oneway.cpp:9:12: error: 'class std::vector<std::pair<long long int, long long int> >' has no member named 'pb'
9 | #define pb pb
| ^~
oneway.cpp:78:17: note: in expansion of macro 'pb'
78 | edges.pb({u, v});
| ^~
oneway.cpp:9:12: error: 'class std::vector<std::pair<long long int, long long int> >' has no member named 'pb'
9 | #define pb pb
| ^~
oneway.cpp:80:18: note: in expansion of macro 'pb'
80 | adj[u].pb({v, i});
| ^~
oneway.cpp:9:12: error: 'class std::vector<std::pair<long long int, long long int> >' has no member named 'pb'
9 | #define pb pb
| ^~
oneway.cpp:81:18: note: in expansion of macro 'pb'
81 | adj[v].pb({u, i});
| ^~
oneway.cpp:103:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
103 | for (int i = 0; i < edges.size(); ++i) {
| ~~^~~~~~~~~~~~~~
