-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathADACYCLE.cpp
More file actions
96 lines (96 loc) · 2.6 KB
/
Copy pathADACYCLE.cpp
File metadata and controls
96 lines (96 loc) · 2.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
// Ivan Carvalho
// Solution to https://www.spoj.com/problems/ADACYCLE/
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#define MP make_pair
#define MAXN 2001
using namespace std;
typedef pair<int, int> ii;
vector<int> original[MAXN], transposto[MAXN], grafo[MAXN];
stack<int> pilha;
int processado[MAXN], n, processado1[MAXN], processado2[MAXN], componente,
meucompomente[MAXN];
void dfs1(int x) {
processado1[x] = 1;
for (int i = 0; i < original[x].size(); i++) {
int v = original[x][i];
if (!processado1[v]) dfs1(v);
}
pilha.push(x);
}
void dfs2(int x) {
processado2[x] = 1;
meucompomente[x] = componente;
for (int i = 0; i < transposto[x].size(); i++) {
int v = transposto[x][i];
if (!processado2[v]) dfs2(v);
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int davez;
scanf("%d", &davez);
if (davez == 1) {
original[i].push_back(j);
transposto[j].push_back(i);
}
}
}
for (int i = 1; i <= n; i++) {
if (!processado1[i]) dfs1(i);
}
while (!pilha.empty()) {
int i = pilha.top();
pilha.pop();
if (!processado2[i]) {
componente++;
dfs2(i);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < original[i].size(); j++) {
int k = original[i][j];
if (meucompomente[i] != meucompomente[k]) continue;
grafo[i].push_back(k);
}
}
for (int i = 1; i <= n; i++) {
queue<ii> bfs;
for (int j = 0; j < grafo[i].size(); j++) {
bfs.push(MP(grafo[i][j], 1));
processado[grafo[i][j]] = i;
}
int flag = 0;
if (processado[i] == i) {
printf("1\n");
continue;
}
while (!bfs.empty()) {
int v = bfs.front().first, d = bfs.front().second;
bfs.pop();
if (v == i) {
printf("%d\n", d);
flag = 1;
break;
}
for (int j = 0; j < grafo[v].size(); j++) {
int u = grafo[v][j];
if (processado[u] != i) {
processado[u] = i;
if (u == i) {
printf("%d\n", d + 1);
flag = 1;
break;
}
bfs.push(MP(u, d + 1));
}
}
}
if (!flag) printf("NO WAY\n");
}
return 0;
}