Submission #894789

#TimeUsernameProblemLanguageResultExecution timeMemory
894789Faisal_SaqibKeys (IOI21_keys)C++17
0 / 100
1 ms348 KiB
#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 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...