| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1170685 | thelegendary08 | Thousands Islands (IOI22_islands) | C++17 | 18 ms | 3396 KiB | 
#include "islands.h"
#include<bits/stdc++.h>
#define vi vector<int>
#define pb push_back
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define f0r(i,n) for(int i = 0;  i< n; i++)
#define mp make_pair
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) {
		int c1 = 0;
		int c2 = 0;
		f0r(i, m){
			if(u[i] == 0)c1++;
			else c2++;
		}
		if(c1 >= 2 && c2 >= 1){
			int a = -1;
			int b = -1;
			int c = -1;
			f0r(i,m){
				if(u[i] == 0){
					if(a == -1)a = i;
					else b = i;
				}
				else c = i;
			}
			return vector<int>{a,c,b,a,c,b};
		}
		else return false;
	}
}
Compilation message (stderr)
| # | 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... | ||||
