# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164031 | jairRS | Keys (IOI21_keys) | C++20 | 3084 ms | 25556 KiB |
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
struct Edge {
int to; // destino
int key; // llave del pasillo
};
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
vector<int> p(r.size());
vector<int> ans(r.size(), 0);
const int n = r.size();
const int m = c.size();
vector<vector<Edge>> adj(n);
for(int j = 0; j < m; ++j){
int key = c[j];
adj[u[j]].push_back({v[j], key});
adj[v[j]].push_back({u[j], key});
}
for(int i = 0; i < n; i++){
# | 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... |