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 <vector>
using namespace std;
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c)
{
int n=r.size();
vector<int> ans;
int mi=2*n;
for(int j=0;j<n;j++)
{
if(r[j]==0)
{
mi=min(mi,n);
ans.push_back(n);
}
else
{
mi=min(mi,1);
ans.push_back(1);
}
}
vector<int> cp;
for(int i=0;i<n;i++)
{
cp.push_back((ans[i]==mi));
}
return cp;
}
# | 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... |