제출 #1223277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1223277		onbert	Thousands Islands (IOI22_islands)	C++20	5 / 100	21 ms	9288 KiB

islands

#include "islands.h"
#include <variant>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int n;
vector<pair<int,int>> adj[maxn];
int a[maxn][maxn];

std::variant<bool, vector<int>> find_journey(
    int N, int M, vector<int> U, vector<int> V) {
    n = N;
    for (int i=0;i<n;i++) for (int j=0;j<n;j++) a[i][j] = 0;
    for (int i=0;i<M;i++) {
        adj[U[i]].push_back({V[i], i});
        a[U[i]][V[i]] = i;
    }
    if (adj[0].size() <= 1) return false;
    if (adj[0].size() >= 2) {
        int v1 = adj[0][0].first, v2 = adj[0][1].first;
        return (vector<int>){a[0][v1], a[v1][0], a[0][v2], a[v2][0], a[v1][0], a[0][v1], a[v2][0], a[0][v2]};
    }
    return false;
}

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