제출 #1051567

#제출 시각아이디문제언어결과실행 시간메모리
1051567MarwenElarbi열쇠 (IOI21_keys)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h>
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();
	std::vector<int> ans(r.size(),1);
	int cnt=0;
	for (int i = 0; i < (int)r.size(); ++i)
	{
		cnt+=(r[i]==0);
	}
	if(cnt==n||cnt==0) return ans;
	for (int i = 0; i < (int)r.size(); ++i)
	{
		if(r[i]==0) ans[i]=0; 
	}
	return ans;
}
#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...