Submission #1024543

#TimeUsernameProblemLanguageResultExecution timeMemory
102454312345678Keys (IOI21_keys)C++17
0 / 100
2 ms7256 KiB
#include <bits/stdc++.h> using namespace std; const int nx=3e5+5; int n, m; vector<int> d[nx]; std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) { n=r.size(), m=u.size(); for (int i=0; i<m; i++) d[u[i]].push_back(v[i]), d[v[i]].push_back(u[i]); vector<int> ans; for (int i=0; i<n; i++) if (r[i]!=0||d[i].empty()) ans.push_back(i); 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...