# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627265 | model_code | Thousands Islands (IOI22_islands) | C++17 | 1096 ms | 131724 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.
// failed/solution-prabowo-fail.cpp
#include "islands.h"
#include <functional>
#include <queue>
#include <utility>
#include <variant>
#include <vector>
std::vector<std::vector<std::pair<int, int>>> pruneNoOutgoing(
int N, int M, std::vector<int> &U, std::vector<int> &V) {
std::vector<int> deg(N);
std::vector<std::vector<std::pair<int, int>>> radj(N);
for (int i = 0; i < M; ++i) {
if (U[i] < 0) {
continue;
}
radj[V[i]].emplace_back(U[i], i);
++deg[U[i]];
}
std::queue<int> q;
for (int i = 0; i < N; ++i) {
if (deg[i] == 0) {
q.push(i);
}
}
std::vector<bool> removed(N, false);
while (!q.empty()) {
# | 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... |