# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629581 | abeker | Thousands Islands (IOI22_islands) | C++17 | 328 ms | 33776 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>
#include "islands.h"
using namespace std;
typedef pair <vector <int>, vector <int>> pvv;
vector <int> min_rot(vector <int> v) {
rotate(v.begin(), min_element(v.begin(), v.end()), v.end());
return v;
}
variant <bool, vector <int>> find_journey(int N, int M, vector <int> u, vector <int> v) {
queue <int> sinks;
vector <set <int>> in(N), out(N);
for (int i = 0; i < M; i++) {
out[u[i]].insert(i);
in[v[i]].insert(i);
}
auto refresh = [&](int x) {
if (out[x].empty())
sinks.push(x);
};
for (int i = 0; i < N; i++)
refresh(i);
int curr = 0;
vector <int> sofar;
while (1) {
auto remove = [&](int x) {
for (auto it : in[x]) {
out[u[it]].erase(it);
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... |