Submission #830688

#	Time	Username	Problem	Language	Result	Execution time	Memory
830688		FatihSolak	Thousands Islands (IOI22_islands)	C++17	8.40 / 100	38 ms	14156 KiB

islands

#include "islands.h"
#include <bits/stdc++.h>
#define N 100005
using namespace std;
vector<pair<int,pair<int,int>>> adj[N];
map<int,vector<int>> mp[N];
int par[N];
int par2[N];
int vis[N];
vector<int> ans;
void dfs2(int v,int pr){
	vis[v] = 1;
	vector<pair<int,pair<int,int>>> tmp;
	for(auto u:adj[v]){
		if(ans.size())
			return;
		if(vis[u.first] == 2){
			continue;
		}
		if(vis[u.first] == 1){
			ans.push_back(0);
			return;
        }
		par[u.first] = u.second.first;
		par2[u.first] = v;
		dfs2(u.first,u.second.first);
	}
	vis[v] = 2;
}
variant<bool, vector<int>> find_journey(int n, int m, vector<int> U, vector<int> V){
    for(int i = 0;i<m;i+=2){
        adj[U[i]].push_back({V[i],{i,i+1}});	
    }
    dfs2(0,-1);
    if(ans.empty())
        return false;
    return true;
}

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