# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774143 | SanguineChameleon | Keys (IOI21_keys) | C++17 | 810 ms | 175052 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>
using namespace std;
const int maxN = 3e5 + 20;
deque<int> Q;
struct comp {
set<int> rooms;
map<int, set<pair<int, int>>> edges;
set<int> cands, keys;
int edge_cnt = 0;
int id = -1;
int par = -1;
void add_cand(int k) {
if (par == -1 && cands.empty()) {
Q.push_back(id);
}
cands.insert(k);
}
void add_key(int k) {
keys.insert(k);
if (edges.find(k) != edges.end()) {
add_cand(k);
}
}
void add_edge(int u, int v, int k) {
if (u > v) {
# | 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... |