제출 #1247559

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

islands

#include <bits/stdc++.h>
#include "islands.h"
using namespace std;
#define pb push_back
const int MAXN=1000+5;
vector<int> adj[MAXN][MAXN];
vector<int> path;
bool dfs(int node,int par){
    for(int j=0;j<MAXN;j++){
        if(j==par)continue;
        if(adj[node][j].size()>1 && adj[j][node].size()>0){
            path.pb(adj[node][j][0]);
            path.pb(adj[j][node][0]);
            path.pb(adj[node][j][1]);
            path.pb(adj[node][j][0]);
            path.pb(adj[j][node][0]);
            path.pb(adj[node][j][1]);
            return 1;
        }
    }
    for(int j=0;j<MAXN;j++){
        if(j==par)continue;
        if(adj[node][j].size()>0){
            path.pb(adj[node][j][0]);
            bool flag=dfs(j,node);
            if(flag){
                path.pb(adj[node][j][0]);
                return 1;
            }
            else path.pop_back();
        }
    }
    return 0;
}
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    for(int i=0;i<M;i++){
        adj[U[i]][V[i]].pb(i);
    }
    bool flag=dfs(0,-1);
    if(!flag)return false;
    return path;
}

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