제출 #834999

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834999		pavement	수천개의 섬 (IOI22_islands)	C++17	9.10 / 100	27 ms	3156 KiB

islands

#include "islands.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define eb emplace_back

using ii = pair<int, int>;

vector<int> cyc, path, par;
vector<bool> vis;
vector<vector<ii> > adj, adj_t;

namespace ufds {
	vector<int> lnk, sz, num_edges;
	
	void init(int n) {
		lnk.resize(n);
		iota(lnk.begin(), lnk.end(), 0);
		sz.resize(n);
		fill(sz.begin(), sz.end(), 1);
		num_edges.resize(n);
		fill(num_edges.begin(), num_edges.end(), 0);
	}
	int find(int x) {
		if (x == lnk[x]) {
			return x;
		}
		return lnk[x] = find(lnk[x]);
	}
	void unite(int a, int b) {
		a = find(a);
		b = find(b);
		if (a == b) {
			return;
		}
		if (sz[b] > sz[a]) {
			swap(a, b);
		}
		sz[a] += sz[b];
		num_edges[a] += num_edges[b];
		lnk[b] = a;
	}
};

int dfs(int u, int e = -1) {
	vis[u] = 1;
	for (auto [v, idx] : adj[u]) {
		if (v != e && vis[v]) {
			cyc.pb(idx);
			//~ cout << u << " --> " << v << endl;
			//~ cout << u << " RET " << v << endl;
			return v;
		}
	}
	for (auto [v, idx] : adj[u]) if (v != e) {
		int tmp = dfs(v, u);
		if (tmp != -1) {
			if (tmp == -2) {
				path.pb(idx);
			} else {
				cyc.pb(idx);
				if (tmp == u) {
					tmp = -2;
				}
			}
			//~ cout << u << " RET " << tmp << endl;
			return tmp;
		}
	}
	//~ cout << u << " RET " << -1 << endl;
	return -1;
}

bool get_path(int u, int tar, int e = -1) {
	par[u] = e;
	if (u == tar) {
		return 1;
	}
	for (auto [v, idx] : adj_t[u]) if (v != e) {
		if (get_path(v, tar, u)) {
			path.pb(idx);
			return 1;
		}
	}
	return 0;
}

variant<bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V) {
	ufds::init(N);
	adj.resize(N);
	adj_t.resize(N);
	for (int i = 0; i < M; i++) {
		if (i % 2 == 0) {
			ufds::unite(U[i], V[i]);
			ufds::num_edges[ufds::find(U[i])]++;
		}
	}
	if (ufds::num_edges[ufds::find(0)] != ufds::sz[ufds::find(0)] - 1) {
		int cnt_edges = 0;
		for (int i = 0; i < M; i++) {
			if (ufds::find(U[i]) == ufds::find(0)) {
				adj[U[i]].eb(V[i], i);
				cnt_edges++;
				if (cnt_edges == 2 * ufds::sz[ufds::find(0)]) {
					break;
				}
			}
		}
		assert(cnt_edges == 2 * ufds::sz[ufds::find(0)]);
		vis.resize(N);
		dfs(0);
		reverse(path.begin(), path.end());
		reverse(cyc.begin(), cyc.end());
		vector<int> out;
		//~ cout << "HERE\n";
		for (int i : path) {
			out.pb(i);
		}
		for (int i : cyc) {
			out.pb(i);
		}
		reverse(cyc.begin(), cyc.end());
		for (int i : cyc) {
			out.pb(i ^ 1);
		}
		for (int i : cyc) {
			out.pb(i);
		}
		reverse(cyc.begin(), cyc.end());
		for (int i : cyc) {
			out.pb(i ^ 1);
		}
		reverse(cyc.begin(), cyc.end());
		reverse(path.begin(), path.end());
		for (int i : path) {
			out.pb(i);
		}
		return out;
	} else {
		vector<int> deg(N, 0);
		for (int i = 0; i < M; i++) {
			if (ufds::find(U[i]) == ufds::find(0)) {
				deg[U[i]]++;
			}
		}
		if (deg[0] > 1 || *max_element(deg.begin(), deg.end()) > 2) {
			if (deg[0] > 1) {
				vector<int> outgoing;
				for (int i = 0; i < M; i++) {
					if (U[i] == 0) {
						outgoing.pb(i);
					}
				}
				auto ret = {outgoing[0], outgoing[0] ^ 1, outgoing[1], outgoing[1] ^ 1, outgoing[0] ^ 1, outgoing[0], outgoing[1] ^ 1, outgoing[1]};
				return ret;
			} else {
				for (int i = 0; i < M; i++) {
					if (ufds::find(U[i]) == ufds::find(0)) {
						adj_t[U[i]].eb(V[i], i);
					}
				}
				par = vector<int>(N, -1);
				int node = max_element(deg.begin(), deg.end()) - deg.begin();
				get_path(0, node);
				vector<int> outgoing;
				for (auto [u, idx] : adj_t[node]) {
					if (u != par[node]) {
						outgoing.pb(idx);
					}
				}
				auto cyc = {outgoing[0], outgoing[0] ^ 1, outgoing[1], outgoing[1] ^ 1, outgoing[0] ^ 1, outgoing[0], outgoing[1] ^ 1, outgoing[1]};
				vector<int> ret;
				reverse(path.begin(), path.end());
				for (int i : path) {
					ret.pb(i);
				}
				for (int i : cyc) {
					ret.pb(i);
				}
				reverse(path.begin(), path.end());
				for (int i : path) {
					ret.pb(i);
				}
				assert((int)ret.size() <= (int)2e6);
				return ret;
			}
		} else {
			return false;
		}
	}
}

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