# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140456 | evpipis | One-Way Streets (CEOI17_oneway) | C++11 | 104 ms | 15996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef pair<int, int> ii;
const int len = 1e5+5;
int out[len], num[len], low[len], par[len], sum[len], cnt;
ii edge[len];
vector<ii> adj[len];
void dfs(int u){
num[u] = low[u] = ++cnt;
for (int j = 0; j < adj[u].size(); j++){
ii v = adj[u][j];
if (!num[v.fi]){
par[v.fi] = v.se;
dfs(v.fi);
if (low[v.fi] > num[u]){
if (sum[v.fi] > 0)
out[v.se] = edge[v.se].fi==v.fi?1:-1;
if (sum[v.fi] < 0)
out[v.se] = edge[v.se].fi==u?1:-1;
}
low[u] = min(low[u], low[v.fi]);
sum[u] += sum[v.fi];
}
else if (v.se != par[u]){
low[u] = min(low[u], num[v.fi]);
}
}
}
int main(){
int n, m, q;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++){
int a, b;
scanf("%d %d", &a, &b);
edge[i] = mp(a, b);
adj[a].pb(mp(b, i));
adj[b].pb(mp(a, i));
}
scanf("%d", &q);
while (q--){
int a, b;
scanf("%d %d", &a, &b);
sum[a]++;
sum[b]--;
}
for (int i = 1; i <= n; i++)
if (!num[i])
dfs(i);
for (int i = 0; i < m; i++){
if (out[i] > 0)
printf("R");
else if (out[i] == 0)
printf("B");
else
printf("L");
}
printf("\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |