test/ABC289-B.test.cpp

• View this file on GitHub
• Last update: 2023-02-15 00:30:59+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/1/ITP1_1_A
• Link: https://atcoder.jp/contests/abc289/submissions/38891547

Depends on

• connectedComponents (連結成分分解 simple ver) (src/graph/simple/connectedComponents.hpp)

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/1/ITP1_1_A"

#include "../src/graph/simple/connectedComponents.hpp"

#include <iostream>
#include <vector>

int main() {
	// int N, M; std::cin >> N >> M;
	// std::vector G(N, std::vector(0, 0));
	// for (int _ = 0 ; _ < M ; _++) {
	// 	int a; std::cin >> a;
	// 	G[a - 1].push_back(a);
	// 	G[a].push_back(a - 1);
	// }
	// zawa::connectedComponents cc(G);
	// std::vector ans(0, 0);
	// auto vec = cc.comps();
	// for (const auto& arr : cc.comps()) {
	// 	for (int i = (int)arr.size() - 1 ; i >= 0 ; i--) {
	// 		ans.push_back(arr[i] + 1);
	// 	}
	// }
	// for (int i = 0 ; i < N ; i++) {
	// 	std::cout << ans[i] << (i + 1 == N ? '\n' : ' ');
	// }
	std::cout << "Hello World" << std::endl;
}

/*
 * AtCoder Beginner Contest 289-B レ
 * https://atcoder.jp/contests/abc289/submissions/38891547
 */

#line 1 "test/ABC289-B.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/1/ITP1_1_A"

#line 2 "src/graph/simple/connectedComponents.hpp"

#include <vector>
#include <stack>

namespace zawa {

class connectedComponents {
private:
	std::vector<int> ids;
	std::vector<std::vector<int>> groups;    

	void build(const std::vector<std::vector<int>>& G) {
		int id = 0;
		for (int i = 0 ; i < (int)G.size() ; i++) {
			if (ids[i] == -1) {
				ids[i] = id;
				std::stack<int> stk({ i });		
				while (stk.size()) {
					int v = stk.top();
					stk.pop();
					for (auto x : G[v]) {
						if (ids[x] == -1) {
							ids[x] = id;
							stk.push(x);
						}
					}
				}
				id++;
			}
		}
		groups = std::vector(id, std::vector(0, 0));
		for (int i = 0 ; i < (int)ids.size() ; i++) {
			groups[ids[i]].push_back(i);
		}
	}

public:

	connectedComponents(const std::vector<std::vector<int>>& G) : ids(G.size(), -1) {
		build(G);
	}

	template <class cost_type>
	connectedComponents(const std::vector<std::vector<std::pair<int, cost_type>>>& G) : ids(G.size(), -1) {
		std::vector tmpG(G.size(), std::vector(0, 0));
		for (int i = 0 ; i < (int)G.size() ; i++) {
			for (auto [x, _] : G[i]) {
				tmpG[i].push_back(x);
			}
		}
		build(tmpG);
	}

	inline int operator [](int i) const {
		return ids[i];
	}

	inline std::size_t size() const {
		return groups.size();
	}

	inline std::size_t size(int x) const {
		return groups[ids[x]].size();
	}

	inline std::vector<std::vector<int>> comps() const {
		return groups;
	}

	inline std::vector<int> comp(int id) const {
		return groups[id];
	}

	bool same(int i, int j) const {
		return ids[i] == ids[j];
	}
};

} // namespace zawa
#line 4 "test/ABC289-B.test.cpp"

#include <iostream>
#line 7 "test/ABC289-B.test.cpp"

int main() {
	// int N, M; std::cin >> N >> M;
	// std::vector G(N, std::vector(0, 0));
	// for (int _ = 0 ; _ < M ; _++) {
	// 	int a; std::cin >> a;
	// 	G[a - 1].push_back(a);
	// 	G[a].push_back(a - 1);
	// }
	// zawa::connectedComponents cc(G);
	// std::vector ans(0, 0);
	// auto vec = cc.comps();
	// for (const auto& arr : cc.comps()) {
	// 	for (int i = (int)arr.size() - 1 ; i >= 0 ; i--) {
	// 		ans.push_back(arr[i] + 1);
	// 	}
	// }
	// for (int i = 0 ; i < N ; i++) {
	// 	std::cout << ans[i] << (i + 1 == N ? '\n' : ' ');
	// }
	std::cout << "Hello World" << std::endl;
}

/*
 * AtCoder Beginner Contest 289-B レ
 * https://atcoder.jp/contests/abc289/submissions/38891547
 */

Back to top page