File size: 2,080 Bytes
c4b0eef |
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 |
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define pii pair <int, int>
const int inf = 1e9;
ll mat[2009][2009];
vector <ll> g[2009];
vector <pii> newinp[2009];
ll dist[2009], ans[2009];
struct node {
ll u, c;
};
bool operator <(node a, node b)
{
return a.c > b.c;
}
int main()
{
ll n;
scanf("%d", &n);
for(ll i = 1; i <= n; i++) {
for(ll j = 1; j <= n; j++) {
scanf("%d", &mat[i][j]);
if(mat[i][j]) {
newinp[i].push_back(pii(i, j));
newinp[j].push_back(pii(i, j));
g[i].push_back(j);
}
}
}
for(ll i = 1; i <= n; i++) {
if(mat[i][i]) {
ans[i] = 1;
continue;
}
for(ll j = 0; j <= 2005; j++)
dist[j] = inf;
for(ll j = 0; j < newinp[i].size(); j++) {
ll u = newinp[i][j].first, v = newinp[i][j].second;
if(u == i)
g[2001].push_back(v);
else
g[u].push_back(2001);
}
priority_queue <node> pq;
pq.push({i, 0});
dist[i] = 0;
while(!pq.empty()) {
node u = pq.top();
pq.pop();
if(dist[u.u] != u.c)
continue;
for(ll v: g[u.u]) {
if(1 + u.c < dist[v]) {
dist[v] = 1 + u.c;
pq.push({v, dist[v]});
}
}
}
if(dist[2001] != inf)
ans[i] = dist[2001];
g[2001].clear();
for(ll j = 0; j < newinp[i].size(); j++) {
ll u = newinp[i][j].first, v = newinp[i][j].second;
if(u != i) {
ll last = g[u].size() - 1;
while(g[u][last] == 2001 && last >= 0) {
g[u].pop_back();
last--;
}
}
}
}
for(ll i = 1; i <= n; i++) {
if(ans[i] > 0)
printf("%d\n", ans[i]);
else
printf("NO WAY\n");
}
return 0;
|