# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037330 | 42kangaroo | Thousands Islands (IOI22_islands) | C++17 | 41 ms | 7760 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 "islands.h"
#include <variant>
#include <vector>
#include "bits/stdc++.h"
using namespace std;
using g_t = vector<vector<pair<int, int>>>;
void dfs(int n, int &t, g_t &g, vector<bool> &vis, vector<int> &pos) {
if (vis[n]) return;
vis[n] = true;
for (auto [e, nu]: g[n]) {
dfs(e, t, g, vis, pos);
}
pos[n] = t++;
}
void compDfs(int n, int co, g_t &g, vector<int> &comp) {
if (comp[n] != -1) return;
comp[n] = co;
for (auto [e, nu]: g[n]) {
compDfs(e, co, g, comp);
}
}
void findDfs(int n, int whi, g_t &g, vector<bool>& vis, vector<int> &res) {
if (vis[n]) return;
vis[n] = true;
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... |