Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <vector>
- using namespace std;
- int n, m;
- const int MAX_N = 3000;
- vector<vector<int>> adj(MAX_N);
- vector<int> vis(MAX_N);
- vector<int> closed(MAX_N);
- int nodes = 0;
- void dfs(int node) {
- if (vis[node] || closed[node]) return;
- // Visit this node if it isn't closed and we haven't visited it yet.
- nodes++;
- vis[node] = true;
- for (int u : adj[node]) {
- if (!vis[u]) dfs(u);
- }
- }
- int main() {
- freopen("closing.in", "r", stdin);
- freopen("closing.out", "w", stdout);
- cin >> n >> m;
- // Read in adjacency list.
- for (int i = 0; i < m; i++) {
- int a, b;
- cin >> a >> b;
- adj[a].push_back(b);
- adj[b].push_back(a);
- }
- vector<int> ord(n);
- for (int i = 0; i < n; i++) cin >> ord[i];
- dfs(1);
- /*
- * The farm is initially connected if we've visited every node
- * before any of the farms are closed.
- */
- if (nodes == n) {
- cout << "YES\n";
- } else {
- cout << "NO\n";
- }
- for (int i = 0; i < n - 1; i++) {
- nodes = 0;
- closed[ord[i]] = true;
- fill(vis.begin(), vis.end(), false);
- // Start DFS from the barn that will close last.
- dfs(ord[n - 1]);
- // Have we visited all the unclosed barns?
- if (nodes == n - i - 1) {
- cout << "YES" << "\n";
- } else {
- cout << "NO" << "\n";
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
