제출 #993613

#제출 시각아이디문제언어결과실행 시간메모리
993613amine_arouaStranded Far From Home (BOI22_island)C++17
0 / 100
1091 ms16784 KiB
#include<bits/stdc++.h> using namespace std; #define Int long long #define pb push_back #define fore(i , n) for(int i = 0 ; i<n;i++) #define forr(i , x , y) for(int i = x ; i <= y; i++) #define forn(i , x , y) for(int i = x ; i >= y; i--) const int N = 2e5 + 10; vector<int> adj[N]; int a[N]; bool marked[N]; int n , m; void expand(int x) { priority_queue<pair<int ,int> , vector<pair<int ,int>> , greater<pair<int , int>>> pq; int cur = a[x]; vector<bool> vis(n , 0); pq.push({cur , x}); while(!pq.empty()) { auto [val , node] = pq.top(); pq.pop(); if(val > cur) break; if(vis[node]) continue; vis[node] = 1; if(node != x) cur+=val; for(auto u : adj[node]) { pq.push({a[u] , u}); } } bool acc = 1; fore(i , n) { if(!vis[i]) { acc = 0; break; } } if(acc) { cout<<1; } else { fore(i , n) { if(vis[i]) marked[i] = 1; } cout<<0; } } int main() { cin>>n>>m; fore(i , n) cin>>a[i]; fore(i , m) { int u , v; cin>>u>>v; u-- , v--; adj[u].pb(v); adj[v].pb(u); } fore(i , n) { if(marked[i]) { cout<<0; } else expand(i); } }
#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...