Submission #1059579

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059579		shiomusubi496	Thousands Islands (IOI22_islands)	C++17	5 / 100	18 ms	6976 KiB

islands

#include "islands.h"

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

struct edge {
    int to, idx;
};

using Graph = vector<vector<edge>>;

std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
    vector<vector<int>> A(N, vector<int>(N, -1));
    rep (i, M) A[U[i]][V[i]] = i;
    vector<int> memo;
    int cur = 0;
    while (1) {
        vector<int> nxts;
        rep (i, N) {
            if (A[cur][i] != -1 && (memo.empty() || i != memo.back())) nxts.push_back(i);
        }
        memo.push_back(cur);
        if (nxts.size() == 0) return false;
        if (nxts.size() >= 2) {
            vector<int> ans;
            rep (i, memo.size() - 1) ans.push_back(A[memo[i]][memo[i + 1]]);
            ans.push_back(A[cur][nxts[0]]);
            ans.push_back(A[nxts[0]][cur]);
            ans.push_back(A[cur][nxts[1]]);
            ans.push_back(A[nxts[1]][cur]);
            ans.push_back(A[nxts[0]][cur]);
            ans.push_back(A[cur][nxts[0]]);
            ans.push_back(A[nxts[1]][cur]);
            ans.push_back(A[cur][nxts[1]]);
            rrep (i, memo.size() - 1) ans.push_back(A[memo[i]][memo[i + 1]]);
            return ans;
        }
        cur = nxts[0];
    }
    return false;
}

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