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 "keys.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
int n = r.size(), m = u.size();
vector<int>adj[n];
// map<pair<int,int>,bool>mp;
for(int i = 0 ; i < m ; i++) {
//if(mp[{u[i],v[i]}] || mp[{v[i],u[i]}]) continue;
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
// mp[{u[i],v[i]}]=true;
// mp[{v[i],u[i]}]=true;
}
vector<int>ans(n,0);
bool all=true;
for(int i = 0 ; i < n ; i++) {
if(r[i] != 0 || (int)adj[i].size()==0) {
all=false;
ans[i]=1;
}
}
if(all) {
for(auto &z : ans) z=1;
}
return ans;
}
# | 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... |