Submission #587111

#TimeUsernameProblemLanguageResultExecution timeMemory
587111BT21tataStranded Far From Home (BOI22_island)C++17
0 / 100
4 ms724 KiB
#include<bits/stdc++.h> // #include <ext/pb_ds/assoc_container.hpp> // using namespace __gnu_pbds; // #pragma GCC target ("avx,avx2,fma") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") typedef long long ll; typedef long double ld; typedef unsigned long long ull; #define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0) #define rall(v) (v).rbegin(),(v).rend() #define all(v) (v).begin(),(v).end() #define setp fixed<<setprecision #define OK cerr<<"OK"<<endl<<flush #define pii pair<int, int> #define pll pair<ll, ll> #define pb push_back #define F first #define S second #define y0 jahdakdh #define y1 jahsadakdakdh #define endl '\n' const ll MOD=1e9+7; const ll mod=(1ll<<31)-1; const ld eps=1e-8; using namespace std; mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count()); int n, m, cnt[20005]; vector<int>g[2005]; bool used[2005]; int main() { SPEED; cin>>n>>m; for(int i=1; i<=n; i++) cin>>cnt[i]; for(int i=0; i<m; i++) { int u, v; cin>>u>>v; g[u].pb(v); g[v].pb(u); } for(int i=1; i<=n; i++) { int cur=cnt[i]; multiset<pii>s; bool pos=1; memset(used, 0, sizeof(used)); for(int u : g[i]) s.insert({cnt[u], u}); used[i]=1; while(s.size()) { int q=(*s.begin()).S; s.erase(s.begin()); // cout<<q<<' '<<cnt[q]<<' '<<cur<<endl; if(used[q]) continue; if(cnt[q]>cur) { break; } used[q]=1; cur+=cnt[q]; for(int u : g[q]) { // cout<<"push "<<q<<' '<<u<<' '<<cnt[u]<<endl; if(!used[u]) s.insert({cnt[u], u}); } } for(int i=1; i<=n; i++) if(!used[i]) pos=0; cout<<pos; } return 0; }
#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...