# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436966 | BrunoPloumhans | Keys (IOI21_keys) | C++17 | 2586 ms | 25712 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 <bits/stdc++.h>
using namespace std;
int n;
vector<int> r;
vector<int> cnts;
vector<int> ans;
int min_count = 1e9;
struct edge {
int k;
int v;
};
vector<vector<edge>> adj;
void compute_cnt(int start) {
unordered_set<int> vis;
unordered_set<int> collected_keys;
queue<int> to_visit {{ start }};
unordered_map<int, vector<int>> next_unlocked;
while (!to_visit.empty()) {
int u = to_visit.front(); to_visit.pop();
if (vis.count(u) > 0) continue;
vis.insert(u);
if (collected_keys.insert(r[u]).second) {
for (int v : next_unlocked[r[u]]) {
Compilation message (stderr)
# | 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... |