# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
617875 | sokratisi | Keys (IOI21_keys) | C++17 | 3066 ms | 17092 KiB |
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>
#include <unordered_set>
using namespace std;
int solve(vector<int> r, vector<int> u, vector<int> v, vector<int> c, int s) {
unordered_set<int> vis;
unordered_set<int> keys;
vis.insert(s);
keys.insert(r[s]);
int added = 1;
int m = u.size();
while (added) {
added = 0;
for (int i = 0; i < m; i++) {
if (vis.find(u[i]) != vis.end()) {
if (vis.find(v[i]) == vis.end()) {
if (keys.find(c[i]) != keys.end()) {
added++;
vis.insert(v[i]);
keys.insert(r[v[i]]);
}
}
}
}
for (int i = 0; i < m; i++) {
if (vis.find(v[i]) != vis.end()) {
if (vis.find(u[i]) == vis.end()) {
if (keys.find(c[i]) != keys.end()) {
added++;
# | 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... |