제출 #156147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156147		ZwariowanyMarcin	One-Way Streets (CEOI17_oneway)	C++14	100 / 100	176 ms	22904 KiB

oneway

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define mp make_pair
#define pb push_back
#define ld long double
#define ss(x) (int) x.size()
#define FOR(i, j, n) for(int i = j; i <= n; ++i)
#define fi first
#define se second
#define cat(x) cerr << #x << " = " << x << endl;
#define ios cin.tie(0); ios_base::sync_with_stdio(0)
  
using namespace std;				

const int nax = 1e5 + 111;		
		
int n, m;
int a, b;
vector <pair<int, int>> v[nax];

int h[nax];
pair<int, int> ed[nax];

int id;
int nr[nax];
bool odw[nax];
int low[nax];
stack <int> stos;

void dfs(int u, int ind) {
	stos.push(u);
	low[u] = h[u];
	odw[u] = 1;
	for(auto it : v[u]) {
		if(it.fi == ind)
			continue;
		if(!odw[it.se]) {
			h[it.se] = h[u] + 1;
			dfs(it.se, it.fi);
			low[u] = min(low[u], low[it.se]);
		}
		else {
			low[u] = min(low[u], h[it.se]);
		}
	}
	if(low[u] == h[u]) {
		id += 1;
		while(!stos.empty() && stos.top() != u) {
			nr[stos.top()] = id;
			stos.pop();
		}
		nr[u] = id;
		stos.pop();
	}		
}

vector <pair<int, int>> graf[nax];
pair<int, int> kraw[nax];
int q;

int sum[nax];
		
void solve(int u, int p = 0, int ind = -1) {
	odw[u] = 1;
	for(auto it : graf[u])
		if(!odw[it.se]) {
			solve(it.se, u, it.fi);
			sum[u] += sum[it.se];
		}
	if(ind != -1 && sum[u] != 0) {
		if(sum[u] > 0)
			kraw[ind] = mp(u, p);
		else
			kraw[ind] = mp(p, u);
	}
}
	

int main() {
	scanf("%d%d", &n, &m);
	FOR(i, 1, m) {
		scanf("%d%d", &a, &b);
		ed[i] = mp(a, b);
		if(a == b) {
			continue;
		}
		v[a].pb(mp(i, b));
		v[b].pb(mp(i, a));
	}
	
	FOR(i, 1, n) 
		if(!odw[i]) 
			dfs(i, -1);
	
	FOR(i, 1, n)
		for(auto it : v[i]) 
			if(nr[i] != nr[it.se]) 
				graf[nr[i]].pb(mp(it.fi, nr[it.se]));
	scanf("%d", &q);
	while(q--) {
		scanf("%d%d", &a, &b);
		if(nr[a] == nr[b])
			continue;
		sum[nr[a]] += 1;
		sum[nr[b]] -= 1;
	}
	
	FOR(i, 1, id)
		odw[i] = 0;
	FOR(i, 1, id)
		if(!odw[i]) 
			solve(i);
		
			
	FOR(i, 1, m) {
		if(kraw[i] == mp(0, 0)) {
			printf("B");
			continue;
		}
		ed[i].fi = nr[ed[i].fi];
		ed[i].se = nr[ed[i].se];
		if(kraw[i] == ed[i])
			printf("R");
		else
			printf("L");
	}
		
	
		
		
	
	
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

oneway.cpp: In function 'int main()':
oneway.cpp:82:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
oneway.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~
oneway.cpp:101:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
oneway.cpp:103:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 30 / 30
• Subtask 3: 40 / 40