| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 831388 | NeroZein | 수천개의 섬 (IOI22_islands) | C++17 | 26 ms | 3944 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;
std::variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
map<pair<int, int>, int> mp;
for (int i = 0; i < M; ++i) {
mp[{U[i], V[i]}]++;
}
for (auto p : mp) {
if (p.first.first == 0 && p.second > 1 && mp[{p.first.second, p.first.first}] > 0) {
return true;
}
}
return false;
}
| # | 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... | ||||
