Submission #830705

#	Time	Username	Problem	Language	Result	Execution time	Memory
830705		FatihSolak	Thousands Islands (IOI22_islands)	C++17	0 / 100	4 ms	7508 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){
            if(ans.size())
                return;
            int now = u.first;
            while(now != 0){
                ans.push_back(par[now]);
                now = par2[now];
            }
            reverse(ans.begin(),ans.end());
            // vector<int> v1,v2;
            // now = v;
            // while(now != u.first){
            //     v1.push_back(par[now]);
            //     v2.push_back(par[now] + 1);
            //     now = par2[now];
            // }
            // reverse(v1.begin(),v1.end());
            // reverse(v2.begin(),v2.end());
            // v1.push_back(u.second.first);
            // v2.push_back(u.second.first + 1);
            // for(int i = 0;i<v1.size();i++){
            //     for(auto u:v1){
            //         ans.push_back(u);
            //     }
            //     for(auto u:v2){
            //         ans.push_back(u);
            //     }
            //     rotate(v1.begin(),v1.end(),v1.begin() + 1);
            //     rotate(v2.begin(),v2.end(),v2.begin() + 1);
            // }
            now = u.first;
            while(now != 0){
                ans.push_back(par[now]);
                now = par2[now];
            }
			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: 0 / 24
• Subtask 5: 0 / 45