結果

問題 No.2295 Union Path Query (Medium)
ユーザー Forested
提出日時 2023-05-05 22:35:44
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 82 ms / 4,000 ms
コード長 12,783 bytes
コンパイル時間 1,403 ms
コンパイル使用メモリ 131,888 KB
最終ジャッジ日時 2025-02-12 18:53:57
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 53
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef LOCAL
#define FAST_IO
#endif
// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)
using namespace std;
using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;
template <typename T>
using Vec = vector<T>;
template <typename T>
bool chmin(T &x, const T &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <typename T>
Vec<tuple<i32, i32, T>> runlength(const Vec<T> &a) {
if (a.empty()) {
return Vec<tuple<i32, i32, T>>();
}
Vec<tuple<i32, i32, T>> ret;
i32 prv = 0;
REP(i, 1, a.size()) {
if (a[i - 1] != a[i]) {
ret.emplace_back(prv, i, a[i - 1]);
prv = i;
}
}
ret.emplace_back(prv, (i32)a.size(), a.back());
return ret;
}
#ifdef INT128
using u128 = __uint128_t;
using i128 = __int128_t;
istream &operator>>(istream &is, i128 &x) {
i64 v;
is >> v;
x = v;
return is;
}
ostream &operator<<(ostream &os, i128 x) {
os << (i64)x;
return os;
}
istream &operator>>(istream &is, u128 &x) {
u64 v;
is >> v;
x = v;
return is;
}
ostream &operator<<(ostream &os, u128 x) {
os << (u64)x;
return os;
}
#endif
[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
SetUpIO() {
#ifdef FAST_IO
ios::sync_with_stdio(false);
cin.tie(nullptr);
#endif
cout << fixed << setprecision(15);
}
} set_up_io;
// ============
#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif
#include <charconv>
#include <cstring>
// https://ei1333.github.io/library/other/scanner.hpp
/**
* @brief Scanner()
*/
struct Scanner {
public:
explicit Scanner(FILE *fp) : fp(fp) {}
template< typename T, typename... E >
void read(T &t, E &... e) {
read_single(t);
read(e...);
}
private:
static constexpr size_t line_size = 1 << 16;
static constexpr size_t int_digits = 20;
char line[line_size + 1] = {};
FILE *fp = nullptr;
char *st = line;
char *ed = line;
void read() {}
static inline bool is_space(char c) {
return c <= ' ';
}
void reread() {
ptrdiff_t len = ed - st;
memmove(line, st, len);
char *tmp = line + len;
ed = tmp + fread(tmp, 1, line_size - len, fp);
*ed = 0;
st = line;
}
void skip_space() {
while(true) {
if(st == ed) reread();
while(*st && is_space(*st)) ++st;
if(st != ed) return;
}
}
template< typename T, enable_if_t< is_integral< T >::value, int > = 0 >
void read_single(T &s) {
skip_space();
if(st + int_digits >= ed) reread();
bool neg = false;
if(is_signed< T >::value && *st == '-') {
neg = true;
++st;
}
typename make_unsigned< T >::type y = *st++ - '0';
while(*st >= '0') {
y = 10 * y + *st++ - '0';
}
s = (neg ? -y : y);
}
template< typename T, enable_if_t< is_same< T, string >::value, int > = 0 >
void read_single(T &s) {
s = "";
skip_space();
while(true) {
char *base = st;
while(*st && !is_space(*st)) ++st;
s += string(base, st);
if(st != ed) return;
reread();
}
}
template< typename T >
void read_single(vector< T > &s) {
for(auto &d : s) read(d);
}
};
// https://ei1333.github.io/library/other/printer.hpp
/**
* @brief Printer()
*/
struct Printer {
public:
explicit Printer(FILE *fp) : fp(fp) {}
~Printer() { flush(); }
template< bool f = false, typename T, typename... E >
void write(const T &t, const E &... e) {
if(f) write_single(' ');
write_single(t);
write< true >(e...);
}
template< typename... T >
void writeln(const T &...t) {
write(t...);
write_single('\n');
}
void flush() {
fwrite(line, 1, st - line, fp);
st = line;
}
private:
FILE *fp = nullptr;
static constexpr size_t line_size = 1 << 16;
static constexpr size_t int_digits = 20;
char line[line_size + 1] = {};
char *st = line;
template< bool f = false >
void write() {}
void write_single(const char &t) {
if(st + 1 >= line + line_size) flush();
*st++ = t;
}
template< typename T, enable_if_t< is_integral< T >::value, int > = 0 >
void write_single(T s) {
if(st + int_digits >= line + line_size) flush();
st += to_chars(st, st + int_digits, s).ptr - st;
}
void write_single(const string &s) {
for(auto &c: s) write_single(c);
}
void write_single(const char *s) {
while(*s != 0) write_single(*s++);
}
template< typename T >
void write_single(const vector< T > &s) {
for(size_t i = 0; i < s.size(); i++) {
if(i) write_single(' ');
write_single(s[i]);
}
}
};
// ============
#include <cassert>
#include <iostream>
#include <type_traits>
// ============
constexpr bool is_prime(unsigned n) {
if (n == 0 || n == 1) {
return false;
}
for (unsigned i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
constexpr unsigned mod_pow(unsigned x, unsigned y, unsigned mod) {
unsigned ret = 1, self = x;
while (y != 0) {
if (y & 1) {
ret = (unsigned) ((unsigned long long) ret * self % mod);
}
self = (unsigned) ((unsigned long long) self * self % mod);
y /= 2;
}
return ret;
}
template <unsigned mod>
constexpr unsigned primitive_root() {
static_assert(is_prime(mod), "`mod` must be a prime number.");
if (mod == 2) {
return 1;
}
unsigned primes[32] = {};
int it = 0;
{
unsigned m = mod - 1;
for (unsigned i = 2; i * i <= m; ++i) {
if (m % i == 0) {
primes[it++] = i;
while (m % i == 0) {
m /= i;
}
}
}
if (m != 1) {
primes[it++] = m;
}
}
for (unsigned i = 2; i < mod; ++i) {
bool ok = true;
for (int j = 0; j < it; ++j) {
if (mod_pow(i, (mod - 1) / primes[j], mod) == 1) {
ok = false;
break;
}
}
if (ok)
return i;
}
return 0;
}
// y >= 1
template <typename T>
constexpr T safe_mod(T x, T y) {
x %= y;
if (x < 0) {
x += y;
}
return x;
}
// y != 0
template <typename T>
constexpr T floor_div(T x, T y) {
if (y < 0) {
x *= -1;
y *= -1;
}
if (x >= 0) {
return x / y;
} else {
return -((-x + y - 1) / y);
}
}
// y != 0
template <typename T>
constexpr T ceil_div(T x, T y) {
if (y < 0) {
x *= -1;
y *= -1;
}
if (x >= 0) {
return (x + y - 1) / y;
} else {
return -(-x / y);
}
}
// ============
template <unsigned mod>
class ModInt {
static_assert(mod != 0, "`mod` must not be equal to 0.");
static_assert(
mod < (1u << 31),
"`mod` must be less than (1u << 31) = 2147483648.");
unsigned val;
public:
static constexpr unsigned get_mod() {
return mod;
}
constexpr ModInt() : val(0) {}
template <typename T, std::enable_if_t<std::is_signed_v<T>> * = nullptr>
constexpr ModInt(T x) : val((unsigned) ((long long) x % (long long) mod + (x < 0 ? mod : 0))) {}
template <typename T, std::enable_if_t<std::is_unsigned_v<T>> * = nullptr>
constexpr ModInt(T x) : val((unsigned) (x % mod)) {}
static constexpr ModInt raw(unsigned x) {
ModInt<mod> ret;
ret.val = x;
return ret;
}
constexpr unsigned get_val() const {
return val;
}
constexpr ModInt operator+() const {
return *this;
}
constexpr ModInt operator-() const {
return ModInt<mod>(0u) - *this;
}
constexpr ModInt &operator+=(const ModInt &rhs) {
val += rhs.val;
if (val >= mod)
val -= mod;
return *this;
}
constexpr ModInt &operator-=(const ModInt &rhs) {
if (val < rhs.val)
val += mod;
val -= rhs.val;
return *this;
}
constexpr ModInt &operator*=(const ModInt &rhs) {
val = (unsigned long long)val * rhs.val % mod;
return *this;
}
constexpr ModInt &operator/=(const ModInt &rhs) {
val = (unsigned long long)val * rhs.inv().val % mod;
return *this;
}
friend constexpr ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
return ModInt<mod>(lhs) += rhs;
}
friend constexpr ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
return ModInt<mod>(lhs) -= rhs;
}
friend constexpr ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
return ModInt<mod>(lhs) *= rhs;
}
friend constexpr ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
return ModInt<mod>(lhs) /= rhs;
}
constexpr ModInt pow(unsigned long long x) const {
ModInt<mod> ret = ModInt<mod>::raw(1);
ModInt<mod> self = *this;
while (x != 0) {
if (x & 1)
ret *= self;
self *= self;
x >>= 1;
}
return ret;
}
constexpr ModInt inv() const {
static_assert(is_prime(mod), "`mod` must be a prime number.");
assert(val != 0);
return this->pow(mod - 2);
}
friend std::istream &operator>>(std::istream &is, ModInt<mod> &x) {
long long val;
is >> val;
x.val = val % mod + (val < 0 ? mod : 0);
return is;
}
friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &x) {
os << x.val;
return os;
}
friend bool operator==(const ModInt &lhs, const ModInt &rhs) {
return lhs.val == rhs.val;
}
friend bool operator!=(const ModInt &lhs, const ModInt &rhs) {
return lhs.val != rhs.val;
}
};
[[maybe_unused]] constexpr unsigned mod998244353 = 998244353;
[[maybe_unused]] constexpr unsigned mod1000000007 = 1000000007;
// ============
using Mint = ModInt<mod998244353>;
class Uf {
i32 n;
Vec<i32> par;
Vec<i32> sz;
Vec<i32> wt;
Vec<Mint> comp;
i32 root(i32 v) const {
while (par[v] != -1) {
v = par[v];
}
return v;
}
public:
Uf(i32 n) : n(n), par(n, -1), sz(n, 1), wt(n, 0), comp(n, Mint()) {}
void unite(i32 u, i32 v, i32 w) {
u = root(u);
v = root(v);
if (u == v) {
return;
}
if (sz[u] > sz[v]) {
swap(u, v);
}
par[u] = v;
wt[u] = w;
comp[v] += comp[u] + Mint(w) * Mint(sz[u]) * Mint(sz[v]);
sz[v] += sz[u];
}
i32 get_path(i32 u, i32 v) const {
if (root(u) != root(v)) {
return -1;
}
i32 mx = 0;
while (u != v) {
if (sz[u] < sz[v]) {
chmax(mx, wt[u]);
u = par[u];
} else {
chmax(mx, wt[v]);
v = par[v];
}
}
return mx;
}
Mint get_comp(i32 v) const {
return comp[root(v)];
}
};
int main() {
Scanner sc(stdin);
Printer pr(stdout);
i32 n, x, q;
sc.read(n, x, q);
Uf uf(n);
while (q--) {
i32 type;
sc.read(type);
if (type == 1) {
i32 v, w;
sc.read(v, w);
uf.unite(x, v, w);
} else if (type == 2) {
i32 u, v;
sc.read(u, v);
i32 ans = uf.get_path(u, v);
pr.writeln(ans);
if (ans != -1) {
x = (x + ans) % n;
}
} else if (type == 3) {
i32 v;
sc.read(v);
pr.writeln(uf.get_comp(v).get_val());
} else {
i32 v;
sc.read(v);
x = (x + v) % n;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0