# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
495378 | Giantpizzahead | Keys (IOI21_keys) | C++17 | 3095 ms | 95016 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>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define sz(x) ((int) x.size())
#define all(x) x.begin(), x.end()
#define debug if (false) cerr
using namespace std;
using ll = long long;
const int MAXN = 6e5+10;
int N, M;
vector<int> R, ans, ds;
unordered_map<int, vector<int>> adj[MAXN];
void dfs(int i) {
unordered_map<int, vector<int>> active;
vector<int> toVisit;
vector<bool> vis(N);
toVisit.push_back(i);
int numVis = 0;
while (!toVisit.empty()) {
int n = toVisit.back(); toVisit.pop_back();
if (vis[n]) continue;
vis[n] = true; numVis++;
for (auto& p : adj[n]) {
auto& v = active[p.first];
v.insert(v.end(), all(p.second));
}
if (active.count(R[n])) {
for (int e : active[R[n]]) {
# | 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... |