| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1058178 | tolbi | 수천개의 섬 (IOI22_islands) | C++17 | 1 ms | 348 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>
using namespace std;
std::variant<bool, std::vector<int>> find_journey(
	int N, int M, std::vector<int> U, std::vector<int> V) {
	//N=2
	vector<int> git;
	vector<int> don;
	for (int i = 0; i < U.size(); i++){
		if (U[i]==0) git.push_back(i);
	}
	if (git.size()==2 && don.size()==1){
		return vector<int>{git[0],don[0],git[1],git[0],don[0],git[1]};
	}
	if (git.size()<2 || don.size()<2) return false;
	return vector<int>{git[0],don[0],git[1],don[1],don[0],git[0],don[1],git[1]};
}
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... | ||||
