oj.uz

Submission #49116

# Submission time Handle Problem Language Result Execution time Memory
49116 2018-05-22T12:52:37 Z tmwilliamlin168 One-Way Streets (CEOI17_oneway) C++14
100 / 100
 190 ms 19692 KB 
#include <bits/stdc++.h>
using namespace std;

#define getchar_unlocked getchar
#define putchar_unlocked putchar

inline int in() {
	int result = 0;
	char ch = getchar_unlocked();
	while (true) {
		if(ch >= '0' && ch <= '9')
			break;
		ch = getchar_unlocked();
	}
	result = ch-'0';
	while(true) {
		ch = getchar_unlocked();
		if (ch < '0' || ch > '9')
			break;
		result = result*10 + (ch - '0');
	}
	return result;
}

const int mxN=1e5;
int n, m, k, a[mxN], b[mxN], ab[mxN], d[mxN], s[mxN], p[mxN], r[mxN], dt=1, tin[mxN], low[mxN];
bool bg[mxN];
vector<int> adj1[mxN], adj2[mxN];

int find(int x) {
	return x==p[x]?x:(p[x]=find(p[x]));
}

inline void join(int x, int y) {
	if((x=find(x))==(y=find(y)))
		return;
	if(r[x]<r[y])
		p[x]=y;
	else
		p[y]=x;
	if(r[x]==r[y])
		++r[x];
}

void dfs1(int u, int p) {
	tin[u]=low[u]=dt++;
	for(int e : adj1[u]) {
		int v=u^ab[e];
		if(!tin[v]) {
			dfs1(v, e);
			low[u]=min(low[v], low[u]);
			if(low[v]>tin[u])
				bg[e]=1;
		} else if(e!=p)
			low[u]=min(tin[v], low[u]);
	}
}

void dfs2(int u, int p) {
	for(int e : adj2[u]) {
		int v=u^ab[e];
		if(v==p)
			continue;
		d[v]=d[u]+1;
		dfs2(v, u);
		s[u]+=s[v];
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	n=in(), m=in();
	for(int i=0; i<n; ++i)
		p[i]=i;
	for(int i=0; i<m; ++i) {
		a[i]=in()-1, b[i]=in()-1;
		ab[i]=a[i]^b[i];
		adj1[a[i]].push_back(i);
		adj1[b[i]].push_back(i);
	}
	for(int i=0; i<n; ++i)
		if(!tin[i])
			dfs1(i, -1);
	for(int i=0; i<m; ++i)
		if(!bg[i])
			join(a[i], b[i]);
	for(int i=0; i<m; ++i) {
		if(!bg[i])
			continue;
		a[i]=find(a[i]);
		b[i]=find(b[i]);
		ab[i]=a[i]^b[i];
		adj2[a[i]].push_back(i);
		adj2[b[i]].push_back(i);
	}
	k=in();
	while(k--)
		++s[find(in()-1)], --s[find(in()-1)];
	for(int i=0; i<n; ++i) {
		if(p[i]==i&&!d[i]) {
			d[i]=1;
			dfs2(i, -1);
		}
	}
	for(int i=0; i<m; ++i) {
		if(!bg[i]) {
			putchar_unlocked('B');
			continue;
		}
		int u=d[a[i]]>d[b[i]]?a[i]:b[i];
		putchar_unlocked(s[u]?((s[u]>0)==(u==a[i])?'R':'L'):'B');
	}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5224 KB Output is correct
3 Correct 8 ms 5336 KB Output is correct
4 Correct 6 ms 5336 KB Output is correct
5 Correct 6 ms 5460 KB Output is correct
6 Correct 7 ms 5460 KB Output is correct
7 Correct 6 ms 5460 KB Output is correct
8 Correct 6 ms 5460 KB Output is correct
9 Correct 6 ms 5460 KB Output is correct
10 Correct 6 ms 5460 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5224 KB Output is correct
3 Correct 8 ms 5336 KB Output is correct
4 Correct 6 ms 5336 KB Output is correct
5 Correct 6 ms 5460 KB Output is correct
6 Correct 7 ms 5460 KB Output is correct
7 Correct 6 ms 5460 KB Output is correct
8 Correct 6 ms 5460 KB Output is correct
9 Correct 6 ms 5460 KB Output is correct
10 Correct 6 ms 5460 KB Output is correct
11 Correct 43 ms 9580 KB Output is correct
12 Correct 74 ms 10860 KB Output is correct
13 Correct 52 ms 12284 KB Output is correct
14 Correct 85 ms 14124 KB Output is correct
15 Correct 93 ms 14704 KB Output is correct
16 Correct 108 ms 15132 KB Output is correct
17 Correct 117 ms 16668 KB Output is correct
18 Correct 122 ms 16668 KB Output is correct
19 Correct 122 ms 17752 KB Output is correct
20 Correct 51 ms 17752 KB Output is correct
21 Correct 45 ms 17752 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5224 KB Output is correct
3 Correct 8 ms 5336 KB Output is correct
4 Correct 6 ms 5336 KB Output is correct
5 Correct 6 ms 5460 KB Output is correct
6 Correct 7 ms 5460 KB Output is correct
7 Correct 6 ms 5460 KB Output is correct
8 Correct 6 ms 5460 KB Output is correct
9 Correct 6 ms 5460 KB Output is correct
10 Correct 6 ms 5460 KB Output is correct
11 Correct 43 ms 9580 KB Output is correct
12 Correct 74 ms 10860 KB Output is correct
13 Correct 52 ms 12284 KB Output is correct
14 Correct 85 ms 14124 KB Output is correct
15 Correct 93 ms 14704 KB Output is correct
16 Correct 108 ms 15132 KB Output is correct
17 Correct 117 ms 16668 KB Output is correct
18 Correct 122 ms 16668 KB Output is correct
19 Correct 122 ms 17752 KB Output is correct
20 Correct 51 ms 17752 KB Output is correct
21 Correct 45 ms 17752 KB Output is correct
22 Correct 127 ms 17752 KB Output is correct
23 Correct 116 ms 17752 KB Output is correct
24 Correct 190 ms 17752 KB Output is correct
25 Correct 122 ms 19692 KB Output is correct
26 Correct 123 ms 19692 KB Output is correct
27 Correct 122 ms 19692 KB Output is correct
28 Correct 28 ms 19692 KB Output is correct
29 Correct 59 ms 19692 KB Output is correct
30 Correct 55 ms 19692 KB Output is correct
31 Correct 71 ms 19692 KB Output is correct
32 Correct 108 ms 19692 KB Output is correct