Submission #1247439

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247439		DeathIsAwe	Thousands Islands (IOI22_islands)	C++20	1.75 / 100	22 ms	6000 KiB

islands

#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define ld long double
int n, m;
vector<int> u, v;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    n = N; m = M; u = U; v = V;
    if (n == 2) {
        vector<int> zerovec, onevec, ansvec;
        for (int i=0;i<m;i++) {
            if (u[i] == 0 && v[i] == 1) zerovec.pb(i);
            else if (u[i] == 1 && v[i] == 0) onevec.pb(i);
        }
        if (zerovec.size() > 1 && onevec.size() > 0) {
            return true;
            ansvec.pb(zerovec[0]);
            ansvec.pb(onevec[0]);
            ansvec.pb(zerovec[1]);
            ansvec.pb(zerovec[0]);
            ansvec.pb(onevec[0]);
            ansvec.pb(zerovec[1]);
            return ansvec;
        } else {
            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:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^

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