# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830493 | Warinchai | Stranded Far From Home (BOI22_island) | C++14 | 213 ms | 13052 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>
using namespace std;
long long ar[200005];
vector<int>v[200005];
int vis[200005];
int n,m;
int check(int i){
for(int x=1;x<=n;x++){
vis[x]=0;
}
priority_queue<pair<long long,int>,vector<pair<long long,int> >,greater<pair<long long,int> > >pq;
pq.push({ar[i],i});
vis[i]=1;
long long power=0;
int ck=0;
while(!pq.empty()){
long long np=pq.top().first;
int x=pq.top().second;
//cout<<x<<" "<<power<<endl;
pq.pop();
if(x==i||power>=np){
power+=np;
for(int j=0;j<v[x].size();j++){
if(vis[v[x][j]]==1){
continue;
}
vis[v[x][j]]=1;
pq.push({ar[v[x][j]],v[x][j]});
}
}else{
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... |