# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756116 | VadimK | Stranded Far From Home (BOI22_island) | C++17 | 1087 ms | 15608 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
string ans="";
ll s[n+1];
vector <ll> g[n+1];
for (int i=1; i<=n; i++)
cin>>s[i];
for (int i=1; i<=m; i++)
{
int a,b;
cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
priority_queue <pair<ll,ll> > q;
for (int i=1; i<=n; i++)
{
ll total=s[i];
ll v,num;
bool vis[n+1]= {0},can=1;
vis[i]=1;
q.push(make_pair(0,i));
while (!q.empty())
{
tie (num,v)=q.top();
q.pop();
num*=-1;
if (total<num) {can=0; break;}
total+=num;
for (int j=0; j<g[v].size(); j++)
if (!vis[g[v][j]]) {q.push(make_pair(-1*s[g[v][j]],g[v][j])); vis[g[v][j]]=1;}
}
for (int x=1; x<=n; x++)
if (!vis[x])
{can=0; break;}
if (can==1) ans+='1';
else ans+='0';
while (!q.empty()) q.pop();
}
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |