Submission #867990

#TimeUsernameProblemLanguageResultExecution timeMemory
867990TAhmed33Stranded Far From Home (BOI22_island)C++98
0 / 100
1087 ms604 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e3 + 25; vector <int> adj[MAXN]; int cnt[MAXN]; bool vis[MAXN]; int sze; int main () { int n, m; cin >> n >> m; int l = 0; for (int i = 1; i <= n; i++) cin >> cnt[i], l += cnt[i]; for (int i = 1; i <= m; i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } for (int i = 1; i <= n; i++) { memset(vis, 0, sizeof(vis)); vis[i] = 1; sze = cnt[i]; for (int j = 1; j <= n; j++) { for (int k = 1; k <= n; k++) { if (!vis[k]) continue; for (auto d : adj[k]) { if (vis[d]) continue; if (sze >= cnt[d]) { sze += cnt[d]; vis[d] = 1; } } } } cout << (sze == l); } cout << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...