#1116031 (C++23) No.3250 最小公倍数

提出ソース
結果

問題	No.3250 最小公倍数
コンテスト
ユーザー	mihhiael
提出日時	2025-08-29 22:45:46
言語	C++23 (gcc 13.3.0 + boost 1.87.0)
結果	TLE
実行時間	-
コード長	11,301 bytes
コンパイル時間	2,189 ms
コンパイル使用メモリ	193,308 KB
実行使用メモリ	69,056 KB
最終ジャッジ日時	2025-10-16 16:29:22
合計ジャッジ時間	9,611 ms
ジャッジサーバーID （参考情報）	judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	-- * 1
other	TLE * 1 -- * 21
権限があれば一括ダウンロードができます
ソースコード

raw source code
#define MOD_IS_998 1
#if __has_include("template.hpp")
#include "template.hpp"
#else
// template start
#include <algorithm>
#include <cassert>
#include <concepts>
#include <cstdint>
#include <functional>
#include <ios>
#include <iostream>
#include <istream>
#include <limits>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <stdexcept>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <utility>
#include <vector>
#include <version>

#include <atcoder/modint.hpp>

using namespace std;
using ll = long long;
using pall = pair<ll, ll>;
template<class T>
using vec = vector<T>;
template<class T>
using veve = vec<vec<T>>;
using vell = vec<ll>;
using vest = vec<string>;
using vebo = basic_string<bool>;
using vevell = veve<ll>;
template<class T>
using mset = multiset<T>;
template<class T>
using priority_queue_ascend = priority_queue<T, vec<T>, greater<T>>;
constexpr ll inf = numeric_limits<ll>::max();
const string sp = " ";
const string lf = "\n";
const auto &npos = string::npos;
#ifdef MOD_IS_998
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1e9 + 7;
#endif
const vec<pall> grid_move4 = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
const vec<pall> grid_move8 = [] {
	auto ret = grid_move4;
	ret.insert(ret.end(), {{-1, 1}, {-1, -1}, {1, -1}, {1, 1}});
	return ret;
}();

#define cont continue
#define br break
#define whlie while
#define foR for
#define reutnr return
#define retunr return
#define reutrn return
#define auot auto
#define uato auto
#define cosnt const
#define conts const
#define ocnst const
auto &ciN = cin;
auto &icn = cin;
auto &icN = cin;
constexpr bool ture = true;
constexpr bool flase = false;
namespace rnages = ranges;
namespace ra = ranges;

using namespace atcoder;
using mint = static_modint<MOD>;

#define times(N) \
	static_assert(is_integral_v<decltype((N) + 0)>, \
	              "times(): N must be integral"); \
	assert((N) >= 0); \
	for(typedef decltype((N) + 0) _int; \
	    [[maybe_unused]] const _int _i : views::iota((_int)0, (N)))
#define tiems times
#define itmes times

template<int M>
istream &operator>>(istream &in, static_modint<M> &i) {
	ll tmp;
	in >> tmp;
	i = tmp;
	return in;
}

template<int M>
ostream &operator<<(ostream &out, const static_modint<M> &i) {
	return out << i.val();
}

template<class T, class U>
istream &operator>>(istream &in, pair<T, U> &p) {
	return in >> p.first >> p.second;
}

template<class T, class U>
ostream &operator<<(ostream &out, const pair<T, U> &p) {
	return out << p.first << sp << p.second;
}

template<class T>
istream &operator>>(istream &in, vec<T> &v) {
	for(auto &&e : v) {
		in >> e;
	}
	return in;
}

struct debug_stream {
	template<class T>
	debug_stream &operator<<([[maybe_unused]] const T &x) {
#ifndef ONLINE_JUDGE
		clog << x;
#endif
		return *this;
	}

	debug_stream &operator<<([[maybe_unused]] ostream &(*f)(ostream &)) {
#ifndef ONLINE_JUDGE
		clog << f;
#endif
		return *this;
	}
};
template<class T>
concept out_stream = same_as<ostream, T> || same_as<debug_stream, T>;

debug_stream clog_;
#define clog clog_

template<class... Ts>
istream &in(Ts &...vecs) {
	static_assert(sizeof...(vecs) != 0,
	              "myfunc::in(): At least one vector must be provided");
	const set sizes = {vecs.size()...};
	if(sizes.size() > 1) {
		throw invalid_argument("myfunc::in(): All vectors must have the same size");
	}
	times(*sizes.begin()) {
		((cin >> vecs[_i]), ...);
	}
	return cin;
}

void out(ranges::range auto v, const string delim, out_stream auto &out) {
	ranges::for_each(v, [&](const auto &e) { out << e << delim; });
}

void out(ranges::range auto v, const string delim) {
	out(v, delim, cout);
}

[[nodiscard]] const string &yesno(const bool cond, const string &yes = "Yes",
                                  const string &no = "No") noexcept {
	if(cond) return yes;
	return no;
}

// [mi, ma)
[[nodiscard]] uint64_t randint(const uint64_t mi, const uint64_t ma) noexcept {
	static random_device seed;
	static mt19937_64 mt(seed());
	if(mi > ma) [[unlikely]]
		return randint(ma, mi);
	if(mi == ma) [[unlikely]]
		return mi;
	const uint64_t w = ma - mi;
	uint64_t r;
	do {
		r = mt();
	} while(mt.max() - mt.max() % w <= r);
	return r % w + mi;
}

template<class T, class U>
requires common_with<T, U>
[[nodiscard]] constexpr auto min(T &&a, U &&b) noexcept {
	return std::min<common_type_t<T, U>>(std::forward<T>(a), std::forward<U>(b));
}

template<class T, class U>
requires common_with<T, U>
[[nodiscard]] constexpr auto max(T &&a, U &&b) noexcept {
	return std::max<common_type_t<T, U>>(std::forward<T>(a), std::forward<U>(b));
}

template<class... Args>
[[nodiscard]] auto reduce(const ranges::range auto &r, Args &&...args) {
	return reduce(ranges::cbegin(r), ranges::cend(r), forward<Args>(args)...);
}

[[nodiscard]] constexpr ll powll(ll a, ll b, const ll m = inf) {
	if(b < 0) [[unlikely]]
		throw invalid_argument("powll(): exponent less than zero");
	if(m < 1) [[unlikely]]
		throw invalid_argument("powll(): modulo less than one");
	a %= m;
	ll ret = 1;
	while(b) {
		if(b % 2) ret *= a, ret %= m;
		a *= a, a %= m;
		b /= 2;
	}
	return ret;
}

template<class T, class U>
requires assignable_from<T &, U> && totally_ordered_with<T, U>
bool mini(T &var, U &&val) noexcept {
	const bool cmp = var > val;
	if(cmp) var = val;
	return cmp;
}

template<class T, class U>
requires assignable_from<T &, U> && totally_ordered_with<T, U>
bool maxi(T &var, U &&val) noexcept {
	const bool cmp = var < val;
	if(cmp) var = val;
	return cmp;
}

class [[nodiscard]] grid_base {
	public:
	grid_base(const ll h, const ll w) noexcept : height(h), width(w) {}

	[[nodiscard]] ll operator()(const ll i, const ll j) const noexcept {
		if(! isvalid(i, j)) return -1;
		return i * width + j;
	}

	[[nodiscard]] ll operator()(const pall &p) const noexcept {
		return (*this)(p.first, p.second);
	}

	protected:
	bool isvalid(const ll i, const ll j) const noexcept {
		return 0 <= i && 0 <= j && i < height && j < width;
	}

	const ll height, width;
};

class [[nodiscard]] grid_seen : public grid_base {
	public:
	grid_seen(const ll h, const ll w) : grid_base(h, w) {
		visited = vebo(h * w, false);
	}

	[[nodiscard]] bool &seen(const ll i, const ll j) & {
		if(! isvalid(i, j)) [[unlikely]]
			throw out_of_range("grid_seen::seen(): out of range");
		return visited[i * width + j];
	}

	[[nodiscard]] bool &sen(const ll i, const ll j) & {
		return seen(i, j);
	}

	[[nodiscard]] bool &seen(const pall &p) & {
		return seen(p.first, p.second);
	}

	[[nodiscard]] bool &sen(const pall &p) & {
		return seen(p);
	}

	private:
	vebo visited;
};

using grid_lite = grid_base;

template<auto defval, class... Args>
requires is_convertible_v<decltype(defval), typename map<Args...>::mapped_type>
class default_map : public map<Args...> {
	using Map = map<Args...>;

	public:
#ifdef __cpp_lib_associative_heterogeneous_insertion
	template<convertible_to<typename Map::key_type> U>
	requires requires(Map::key_compare c, Map::key_type t, U u) {
		c(t, u);
		c(u, t);
	}
	Map::mapped_type &operator[](const U &key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}

	template<convertible_to<typename Map::key_type> U>
	requires requires(Map::key_compare c, Map::key_type t, U u) {
		c(t, u);
		c(u, t);
	}
	Map::mapped_type &operator[](const U &&key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}
#else
	Map::mapped_type &operator[](const Map::key_type &key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}

	Map::mapped_type &operator[](const Map::key_type &&key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}
#endif
};

template<auto defval, class... Args>
requires is_convertible_v<decltype(defval),
                          typename unordered_map<Args...>::mapped_type>
class default_unordered_map : public unordered_map<Args...> {
	using Map = unordered_map<Args...>;

	public:
#ifdef __cpp_lib_associative_heterogeneous_insertion
	template<class U>
	requires requires(Map::hasher h, U u) { h(u); }
	Map::mapped_type &operator[](const U &key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}

	template<class U>
	requires requires(Map::hasher h, U u) { h(u); }
	Map::mapped_type &operator[](const U &&key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}
#else
	Map::mapped_type &operator[](const Map::key_type &key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}

	Map::mapped_type &operator[](const Map::key_type &&key) {
		Map::try_emplace(key, defval);
		return Map::operator[](key);
	}
#endif
};

template<class T, class U>
requires requires(mset<T>::key_compare c, T t, U u) { c(t, u); }
auto erase_single(mset<T> &mset, U &&v) {
	const auto it = mset.find(v);
	if(it == mset.end()) [[unlikely]]
		throw invalid_argument("erase_single(): why v not in mset!?!?");
	return mset.erase(it);
}

void solve();
// template end
#endif

int main(void) {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	ll t = 1;
	// cin >> t;
	times(t) solve();
	return 0;
}

#include <algorithm>
#include <cmath>
#include <cstddef>
#include <vector>

using namespace std;

using ll = long long;

// [1, n]の最小素因数(v[0] = 0, v[1] = 1), n以下の素数.
// O(n)
class linear_sieve {
	public:
	linear_sieve(const ll n) {
		minfactor.resize(n + 1, 0);
		minfactor[0] = 0;
		minfactor[1] = 1;
		primes.reserve(ll(n / log(n) * 1.15));
		for(ll i = 2; i <= n; i++) {
			if(! minfactor[i]) minfactor[i] = i, primes.push_back(i);

			for(size_t j = 0; j != primes.size() && primes[j] <= minfactor[i]; j++) {
				if(i * primes[j] > n) break;
				minfactor[i * primes[j]] = primes[j];
			}
		}
	}

	vector<ll> minfactor, primes;
};

// sqrt(R)以下の素数、[L, R]の素数判定.
// O(sqrt(R) + (R - L)loglog(R - L))
class segment_sieve : public linear_sieve {
	public:
	segment_sieve(const ll l, const ll r) : linear_sieve((ll)sqrt(r) + 10) {
		isprime = vector<bool>(r - l + 1, true);
		for(const auto &p : primes) {
			ll cur = max(p * p, (l + p - 1) / p * p) - l;
			for(; cur < r - l + 1; cur += p) {
				isprime[cur] = false;
			}
		}
	}

	vector<bool> isprime;
};

void solve() {
	const auto lpf = linear_sieve(1e6 + 10).minfactor;
	ll n;
	cin >> n;
	vell a(n);
	cin >> a;
	vevell nei(n);
	times(n - 1) {
		ll u, v;
		cin >> u >> v;
		u--, v--;
		nei[u].push_back(v);
		nei[v].push_back(u);
	}
	vec<mint> ans(n);
	vebo sen(n, false);
	const auto dfs = [&](auot &&self, const ll i) -> unordered_map<ll, ll> {
		sen[i] = ture;
		unordered_map<ll, ll> m;
		mint mp = a[i];
		{
			ll tmp = a[i];
			while(tmp != 1) {
				m[lpf[tmp]]++;
				tmp /= lpf[tmp];
			}
		}
		clog << "in v" << i << lf;
		for(const auot &e : nei[i]) {
			if(sen[e]) cont;
			unordered_map<ll, ll> m2 = self(self, e);
			if(m.size() < m2.size()) {
				swap(m, m2);
				mp = ans[e];
			}
			clog << "mp: " << mp << lf;
			clog << "m: ";
			out(m, sp, clog), clog << lf;
			clog << "m2: ";
			out(m2, sp, clog), clog << lf;
			for(const auto &[p, e] : m2) {
				if(m.contains(p) && m[p] >= e) cont;
				mp *= mint(p).pow(e - m[p]);
				m[p] = e;
			}
			clog << "mp: " << mp << lf;
			clog << "m: ";
			out(m, sp, clog), clog << lf;
		}
		ans[i] = mp;
		retunr m;
	};
	dfs(dfs, 0);
	out(ans, lf);
}
yukicoder

結果

ソースコード
