結果
| 問題 | No.2001 Distanced Triple |
| コンテスト | |
| ユーザー |
 iiljj
|
| 提出日時 | 2022-07-09 00:17:56 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.89.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 14,816 bytes |
| 記録 | |
| コンパイル時間 | 1,584 ms |
| コンパイル使用メモリ | 136,884 KB |
| 最終ジャッジ日時 | 2025-01-30 05:43:47 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 24 WA * 6 |
ソースコード
/* #region Head */
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath> // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))
#define endl '\n'
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
// constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
REP(i, 0, SIZE(arr)) is >> arr[i];
return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
os << "{";
REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
os << get<N>(a);
if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
os << ' ';
} else if constexpr (end_line) {
os << '\n';
}
return operator<< <N + 1, end_line>(os, a);
}
return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(cout, a); }
void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(Tail) > 0) cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif
#ifndef MYLOCAL
#undef DEBUG_
#endif
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#define VAR(type, ...) \
type __VA_ARGS__; \
assert((cin >> __VA_ARGS__));
template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
for (int i = 0; i < ISIZE(v); ++i) v[i]++;
}
/* #endregion */
// #include <atcoder/all>
// using namespace atcoder;
/* #region mint */
// 自動で MOD を取る整数
struct mint {
ll x;
constexpr mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
constexpr mint &operator+=(const mint &a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
constexpr mint &operator-=(const mint &a) {
if ((x += MOD - a.x) >= MOD) x -= MOD;
return *this;
}
constexpr mint &operator*=(const mint &a) {
(x *= a.x) %= MOD;
return *this;
}
constexpr mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
constexpr mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
constexpr mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
// O(log(t))
constexpr mint pow_rec(ll t) const {
if (!t) return 1;
mint a = pow(t >> 1); // ⌊t/2⌋ 乗
a *= a; // ⌊t/2⌋*2 乗
if (t & 1) // ⌊t/2⌋*2 == t-1 のとき
a *= *this; // ⌊t/2⌋*2+1 乗 => t 乗
return a;
}
constexpr mint pow(ll t) const {
mint a(*this);
mint res = 1;
while (t) {
if (t & 1) res *= a;
t >>= 1, a *= a;
}
return res;
}
// for prime mod
constexpr mint inv_prime() const {
return pow(MOD - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)
}
constexpr mint inv() const {
ll a = this->x, b = MOD, u = 1, v = 0, t = 0;
mint res;
while (b) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
if (u < 0) u += MOD;
res = u;
return res;
}
constexpr mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
constexpr mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
constexpr bool operator==(const mint &a) const { return this->x == a.x; }
constexpr bool operator==(const ll a) const { return this->x == a; }
constexpr bool operator!=(const mint &a) const { return this->x != a.x; }
constexpr bool operator!=(const ll a) const { return this->x != a; }
mint operator+() const { return *this; }
mint operator-() const { return *this * (-1); }
// mint 入力
friend istream &operator>>(istream &is, mint &x) {
is >> x.x;
return is;
}
// mint 出力
friend ostream &operator<<(ostream &os, const mint x) {
os << x.x;
return os;
}
};
/* #endregion */
// Problem
void solve() {
VAR(ll, l, r, a, b, c);
if (r - l < min(a + b, c)) {
// 区間 [l, r] が狭すぎる
pprint(0);
return;
}
mint A(a), B(b), C(c), L(l), R(r);
dump(c, a + b);
if (c <= a + b) {
// a, b の条件を満たせば，必ず c の条件も満たされる
// sum (y-A-L+1)*(R-y-B+1), y=(L+A) to (R-B) =
// -1/6 (A + B + L - R - 3) (A + B + L - R - 2) (A + B + L - R - 1)
mint ans =
(-((((mint(1) / 6) * ((((A + B) + L) - R) - 3)) * ((((A + B) + L) - R) - 2)) * ((((A + B) + L) - R) - 1)));
pprint(ans);
return;
}
mint ans = 0;
if (l + (c - b) <= r) {
// sum (R-(y-A)-C)*(y-A-L+1)+1/2*(y-A-L+1)*(y-A-L+2), y=(L+A) to (L+C-B)
// 1/6 (A + B - C - 2) (A + B - C - 1) (A + B - 4 C - 3 L + 3 R + 3)
mint t = ((((mint(1) / 6) * (((A + B) - C) - 2)) * (((A + B) - C) - 1)) *
(((((A + B) - (mint(4) * C)) - (mint(3) * L)) + (mint(3) * R)) + 3));
ans += t;
dump(t);
}
if (l + (c - b) <= r - (c - a)) {
if (l + (c - b) + 1 <= r - (c - a) - 1) {
// sum (R-(y+B)+1)*(y-A-L+1) - 1/2*(C-(A+B))*(C-(A+B)+1), y=(L+(C-B) + 1) to (R-(C-A) - 1)
// -1/6 (A + B - 2 C - L + R - 1) (2 A^2 + A (4 B - 8 C - 4 L + 4 R + 2) + 2 B^2 + B (-8 C - 4 L + 4 R + 2)
// + 5 C^2 + 2 C L - 2 C R + 5 C - L^2 + 2 L R + 7 L - R^2 - 7 R - 6)
mint t = (-(((mint(1) / 6) * (((((A + B) - (mint(2) * C)) - L) + R) - 1)) *
((((((((((((((mint(2) * A.pow(2)) +
(A * (((((mint(4) * B) - (mint(8) * C)) - (mint(4) * L)) + (mint(4) * R)) + 2))) +
(mint(2) * B.pow(2))) +
(B * ((((-(mint(8) * C)) - (mint(4) * L)) + (mint(4) * R)) + 2))) +
(mint(5) * C.pow(2))) +
((mint(2) * C) * L)) -
((mint(2) * C) * R)) +
(mint(5) * C)) -
L.pow(2)) +
((mint(2) * L) * R)) +
(mint(7) * L)) -
R.pow(2)) -
(mint(7) * R)) -
6)));
ans += t;
dump(t);
}
} else {
if (r - (c - a) + 1 <= l + (c - b) - 1) {
// sum 1/2*((R-L)-C+1)*((R-L)-C+2), y=(R-(C-A) + 1) to (L+(C-B) - 1)
// -1/2 (C + L - R - 2) (C + L - R - 1) (A + B - 2 C - L + R + 1)
mint t = (-((((mint(1) / 2) * (((C + L) - R) - 2)) * (((C + L) - R) - 1)) *
(((((A + B) - (mint(2) * C)) - L) + R) + 1)));
ans += t;
dump(t);
}
}
if (r - (c - a) >= l) {
// sum 1/2*(R-(y+B))*(R-(y+B)+1) + (R-(y+B)+1)*(y+B-L-C+1), y=(R-(C-A)) to (R-B)
// 1/6 (A + B - C - 2) (A + B - C - 1) (A + B - 4 C - 3 L + 3 R + 3)
mint t = ((((mint(1) / 6) * (((A + B) - C) - 2)) * (((A + B) - C) - 1)) *
(((((A + B) - (mint(4) * C)) - (mint(3) * L)) + (mint(3) * R)) + 3));
ans += t;
dump(t);
}
//
pprint(ans);
}
// entry point
int main() {
solve();
return 0;
}