Submission #1024670

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024670		Wansur	Thousands Islands (IOI22_islands)	C++17	5 / 100	19 ms	7836 KiB

islands

#include <bits/stdc++.h>
#include <variant>
#define f first
#define s second
#define ent '\n'

using namespace std;
typedef long long ll;
const int maxn = 2e5 + 12;
const int mod = 1e9 + 2022;

vector<int> g[maxn];
int a[101][101];
int n, m;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> u, vector<int> v){
    n = N, m = M;
    if(n == 2) return false;
    for(int i=0;i<m;i++){
        if(max(u[i], v[i]) < 10){
            a[u[i]][v[i]] = i;
        }
    }
    vector<int> ans;
    ans = {a[0][1], a[1][0], a[0][2], a[2][0], a[1][0], a[0][1], a[2][0], a[0][2]};
    return ans;
}

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