| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362578 | activedeltorre | Thousands Islands (IOI22_islands) | C++20 | 13 ms | 3088 KiB |
#include "islands.h"
#include <cassert>
#include <cstdio>
#include <variant>
#include <vector>
#include <variant>
#include <vector>
using namespace std;
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V)
{
int n=N;
if (n >= 3)
{
vector<int>vec;
int a=-1,b=-1,c=-1,d=-1;
for(int i=0; i<M; i++)
{
if(U[i]==0 && V[i]==1)
{
if(a==-1)
{
a=i;
}
}
if(U[i]==1 && V[i]==0)
{
if(b==-1)
{
b=i;
}
}
if(U[i]==0 && V[i]==2)
{
if(c==-1)
{
c=i;
}
}
if(U[i]==2 && V[i]==0)
{
if(d==-1)
{
d=i;
}
}
}
vec.push_back(a);
vec.push_back(b);
vec.push_back(c);
vec.push_back(d);
vec.push_back(b);
vec.push_back(a);
vec.push_back(d);
vec.push_back(c);
return vec;
}
return false;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
