【2022年10月25日A组】翻转有向图【DFS】

思路:

直接分类讨论。
当翻转u到v时
如果u到v有路径而且不过这条边，那就diff
如果v到u有路径，那就diff
而且这两个条件不能同时满足，否则为same

$code$

#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>

using namespace std;

const int MAXN = 1e3 + 10, MAXM = 2e5 + 10;

int n, m, bz[MAXN];
struct node {
	int x, y;
}E[MAXM];
vector<int> e[MAXN];
bool v[MAXN], g1[MAXN][MAXN], g2[MAXN][MAXN];

void dfs(int x, int st) {
	g1[st][x] = 1;
	v[x] = 1;
	for(int i = 0; i < e[x].size(); i ++)
		if(!v[e[x][i]]) dfs(e[x][i], st);
}

void dfs1(int x, int tmp) {
	bz[x] = tmp;
	v[x] = 1;
	for(int i = 0; i < e[x].size(); i ++)
		if(!v[e[x][i]]) dfs1(e[x][i], tmp);
}

void dfs2(int x, int st, int tmp) {
	if(bz[x] != tmp) g2[st][x] = 1;
	v[x] = 1;
	for(int i = 0; i < e[x].size(); i ++)
		if(!v[e[x][i]]) dfs2(e[x][i], st, tmp);
}

int main() {
	freopen("turn.in", "r", stdin);
	freopen("turn.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; i ++) {
		scanf("%d%d", &E[i].x, &E[i].y);
		e[E[i].x].push_back(E[i].y);
	}
	for(int i = 1; i <= n; i ++) {
		memset(v, 0, sizeof(v));
		dfs(i, i);
	}
	for(int i = 1; i <= n; i ++) {
		memset(v, 0, sizeof(v));
		memset(bz, 0, sizeof(bz));
		v[i] = 1;
		for(int j = 0; j < e[i].size(); j ++) if(!v[e[i][j]]) dfs1(e[i][j], j + 1);
		memset(v, 0, sizeof(v));
		v[i] = 1;
		for(int j = e[i].size() - 1; j >= 0; j --) if(!v[e[i][j]]) dfs2(e[i][j], i, j + 1);
	}
	for(int i = 1; i <= m; i ++)
		if(g1[E[i].y][E[i].x] ^ g2[E[i].x][E[i].y]) printf("diff\n");
		else printf("same\n");
	return 0;
}