| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1359269 | maya_s | Thousands Islands (IOI22_islands) | C++20 | 23 ms | 4328 KiB |
#include "islands.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
variant<bool, vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v) {
vector<vector<ll>> g(n);
for(ll i = 0; i < m; i++) g[u[i]].push_back(i);
if(!(g[0].size() >= 2 && g[1].size() >= 1)) return false;
vector<ll> journey = {g[0][0], g[1][0], g[0][1], g[0][0], g[1][0], g[0][1]};
variant<bool, vector<int>> ans = (true, journey);
return ans;
}
| # | 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... | ||||
