| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 814509 | LIF | 수천개의 섬 (IOI22_islands) | C++17 | 36 ms | 4432 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<bits/stdc++.h>
#include <variant>
#include <vector>
int ind[300005];
using namespace std;
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V) {
if(N == 2)
{
vector <int> a,b;
for(int i=0;i<M;i++)
{
if(U[i] == 0)a.push_back(i);
else b.push_back(i);
}
if(a.size() >= 2 && b.size() >= 1)
{
vector<int> ans;
ans.push_back(a[0]);
ans.push_back(b[0]);
ans.push_back(a[1]);
ans.push_back(a[0]);
ans.push_back(b[0]);
ans.push_back(a[1]);
return ans;
}
else return false;
}
/*
if (N == 4) {
return std::vector<int>({0, 1, 2, 4, 0, 3, 2, 1, 4, 3});
}
return false;*/
return true;
}
| # | 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... | ||||
