제출 #1312260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1312260		azamurai	9월 (APIO24_september)	C++20	59 / 100	159 ms	8544 KiB

september

#include "september.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

int get(int v, vector<int>& parent) {
	if (parent[v] == v) return v;
	return parent[v] = get(parent[v], parent);
}

void union_set(int u, int v, vector <int>& parent) {
	int pu = get(u, parent);
	int pv = get(v, parent);
	if (pu != pv) {
		parent[pu] = pv;
	}
}

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector <int> parent(N, 0);
	// [0, N]
	for (int i = 0; i < N; i++) {
		parent[i] = i;
	}
	for (int T = 0; T < M; T++) {
		vector <int> p(N, 0);
		vector <int> pos(N, 0);
		// [0, N - 1]
		for (int i = 0; i < N - 1; i++) {
			pos[S[T][i]] = i;
		}
		vector <pair<int,int>> seg;
		for (int i = 1; i < N; i++) {
			if (F[i] == 0) continue;
			if (pos[F[i]] < pos[i]) {
				seg.push_back(make_pair(pos[F[i]], pos[i]));
			}
		}
		for (auto to : seg) {
			int l = to.first, r = to.second;
			for (int i = l + 1; i <= r; i++) {
				union_set(S[T][i - 1], S[T][i], parent);
			}
		}
	}
	set <int> ans;
	for (int i = 1; i < N; i++) {
		ans.insert(get(i, parent));
	}
	return (int)ans.size();
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 5 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 0 / 16