UVA 515 - King (SPFA)(二)
if (time[v[e]] > n + 1) return true;
q.push(v[e]);
}
}
}
}
return false;
}
void solve() {
init();
if (!SPFA()) printf("lamentable kingdom\n");
else printf("successful conspiracy\n");
}
int main() {
while (~scanf("%d", &n) && n) {
solve();
}
return 0;
}