Submission #714616

#TimeUsernameProblemLanguageResultExecution timeMemory
714616fuad27Stranded Far From Home (BOI22_island)C++17
10 / 100
1078 ms12728 KiB
#include<bits/stdc++.h> using namespace std; const int N=200'010; int s[N]; vector<int> g[N]; int main () { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; for(int i = 0;i<n;i++)cin >> s[i]; for(int i = 0;i<m;i++) { int a, b; cin >> a >> b; a--,b--; g[a].push_back(b); g[b].push_back(a); } string res=""; for(int i = 0;i<n;i++) { priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq; vector<bool> vis(n); long long sum=s[i]; pq.push({0,i}); vis[i]=1; bool check=true; while(pq.size()) { auto at=pq.top(); pq.pop(); if(at.first<=sum) { sum+=at.first; } else { check=false; break; } for(int to:g[at.second]) { if(!vis[to]){ pq.push({s[to],to}); vis[to]=1; } } } cout<<check; } }
#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...