# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
829621 | Abrar_Al_Samit | Keys (IOI21_keys) | C++17 | 192 ms | 20940 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 <bits/stdc++.h>
#include "keys.h"
using namespace std;
const int nax = 2000;
vector<pair<int,int>>g[nax];
vector<int>waiting[nax];
vector<int> find_reachable(vector<int> r, vector<int> u,
vector<int> v, vector<int> c) {
int n = r.size(), m = u.size();
for(int i=0; i<m; ++i) {
g[u[i]].emplace_back(v[i], c[i]);
g[v[i]].emplace_back(u[i], c[i]);
}
int cnt[n] = {0};
for(int sc=0; sc<n; ++sc) {
bool rc[n] = {0};
rc[sc] = 1;
bool key[n] = {0};
key[r[sc]] = 1;
for(int i=0; i<n; ++i) waiting[i].clear();
vector<int>yet = {sc};
# | 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... |