Submission #1079565

#	Time	Username	Problem	Language	Result	Execution time	Memory
1079565		Lalic	Thousands Islands (IOI22_islands)	C++17	5 / 100	24 ms	5196 KiB

islands

#include "islands.h"
//~ #include <variant>
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
	vector<vector<pii>> adj(N);
	
	for(int i=0;i<M;i++) 
		adj[U[i]].pb({V[i], i});
	
	if(N==2){
		if((int)adj[0].size()>=2 && adj[1].size()>=1){
			int a=adj[0][0].se, b=adj[0][1].se, c=adj[1][0].se;
			return vector<int>({a, c, b, a, c, b});
		}
		return false;
	}
}

Compilation message (stderr)

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:19:27: warning: control reaches end of non-void function [-Wreturn-type]
   19 |  vector<vector<pii>> adj(N);
      |                           ^

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