# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435737 | bicsi | Keys (IOI21_keys) | C++17 | 1814 ms | 114664 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;
struct Solver {
int n;
vector<vector<int>> active;
vector<multimap<int, int>> inactive;
vector<set<int>> cols;
vector<int> parent, df, link, bad;
Solver(int n) :
n(n), active(n), inactive(n), cols(n),
parent(n, -1), df(n, -1), link(n, -1), bad(n, 0) {}
void AddEdge(int u, int v, int c) {
if (cols[u].count(c))
active[u].push_back(v);
else
inactive[u].emplace(c, v);
}
void AddCol(int u, int c) {
while (true) {
auto it = inactive[u].find(c);
if (it == inactive[u].end()) break;
active[u].push_back(it->second);
inactive[u].erase(it);
}
cols[u].insert(c);
}
# | 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... |