Submission #1170688

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170688		thelegendary08	Thousands Islands (IOI22_islands)	C++17	10 / 100	19 ms	3400 KiB

islands

#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;
	}
	else{
		int a1,a2,b1,b2,c1,c2;
		f0r(i,m){
			if(u[i] == 0 && v[i] == 1){
				a1 = i;
			}
			else if(u[i] == 1 && v[i] == 0){
				a2 = i;
			}
			else if(u[i] == 1 && v[i] == 2){
				b1 = i;
			}
			else if(u[i] == 2 && v[i] == 1){
				b2 = i;
			}
			else if(u[i] == 2 && v[i] == 0){
				c1 = i;
			}
			else if(u[i] == 0 && v[i] == 2)c2 = i;
			
		}
		return vector<int>{a1, b1, c1, c2, b2, a2, c1, b1, a1, a2, b2, c2};
	}
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45