Submission #632070

#	Time	Username	Problem	Language	Result	Execution time	Memory
632070		4123xr4323	Thousands Islands (IOI22_islands)	C++17	5 / 100	39 ms	17104 KiB

islands

#include <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(),a.end()
#define X first
#define Y second
using namespace std;
using pii = pair <long long, long long>;
constexpr int maxn = 2e5 + 10;
constexpr int mod = 1000002022;
constexpr long long inf = 1e17 + 10;
 
int n, m;
vector <pii> graph [maxn];
int g [444][444];

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) {
        graph[U[i]].push_back (mp (V[i], i));
        g[U[i]][V[i]] = i;
    }
    vector <int> res = {g[0][1], g[1][0], g[0][2], g[2][0], g[1][0], g[0][1], g[2][0], g[0][2]};
    return res;
}

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