結果

問題 No.2452 Incline
ユーザー cutmdo
提出日時 2023-09-01 22:20:58
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,070 bytes
コンパイル時間 3,369 ms
コンパイル使用メモリ 319,472 KB
最終ジャッジ日時 2025-02-16 16:48:56
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 2 WA * 6
権限があれば一括ダウンロードができます

ソースコード

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

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/Utils/debug.hpp"
#include "./CompetitiveProgrammingCpp/Utils/Timer.hpp"
#include "./CompetitiveProgrammingCpp/Utils/sample.hpp"
#else
#define dump(...)
template<class T>constexpr inline auto d_val(T a, T b) { return a; }
#endif
/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }
/* type define */
using ll = long long;
template<class T>
using V = std::vector<T>;
using VS = V<std::string>;
using VL = V<ll>;
using VVL = V<VL>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;
/* using std */
using std::cout;
using std::cin;
using std::cerr;
constexpr char endl = '\n';
/* Initial processing */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;
/* define hash */
constexpr unsigned int static_random() { return 1u * __TIME__[0] * __TIME__[1] * __TIME__[3] * __TIME__[4] * __TIME__[6] * __TIME__[7]; }
template<class T> struct Hash { auto operator()(T x) const { return std::hash<T>()(x) ^ static_random(); } };
template<> struct Hash<std::pair<int, int>> { auto operator()(const std::pair<int, int>& x) const { return Hash<long long>()(x.first << 31 | x.second
    ); } };
/* input */
template<class T> std::istream& operator >> (std::istream& is, std::vector<T>& vec) { for(T& x : vec) is >> x; return is; }
/* constant value */
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
//=============================================================================================
auto solve_c(ll n, ll m, ll l, ll r) {
ll ans = 0;
REP(x, m + 1) FOR(t, -m, m + 1) {
auto xt = x + (n - 1) * t;
ans += (l <= xt && xt <= r);
}
return ans;
}
auto solve(ll n, ll m, ll l, ll r) {
constexpr ll d2 = (MOD + 1) >> 1;
auto solve_up = [&n](ll r) {
ll tmax = r / (n - 1);
tmax %= MOD;
r %= MOD;
ll p = tmax * (r + 1) % MOD;
ll m = tmax * (tmax + 1) % MOD * d2 % MOD * ((n - 1) % MOD) % MOD;
return (p - m + MOD) % MOD;
};
auto solve_down = [&n, &m](ll l) {
ll tmax = (m - l) / (n - 1);
tmax %= MOD;
l %= MOD;
m %= MOD;
ll p = tmax * (m - l + 1 + MOD) % MOD;
ll m = tmax * (tmax + 1) % MOD * d2 % MOD * ((n - 1) % MOD) % MOD;
return (p - m + MOD) % MOD;
};
auto up = solve_up(r) - ((l > 0) ? solve_up(l - 1) : 0);
auto down = solve_down(l) - ((r < m) ? solve_down(r + 1) : 0);
auto eq = (r - l + 1) % MOD;
ll ans = (up + down + eq + 3 * MOD) % MOD;
// dump(up, down, eq);
return ans;
}
signed main() {
#ifndef TEST
ll t;
cin >> t;
REP(_, t) {
ll n, m, l, r;
cin >> n >> m >> l >> r;
cout << solve(n, m, l, r) << endl;
}
#else
auto gen = Sample::SampleGenerator();
auto g = [&]() {
constexpr ll size = 2;
constexpr ll max = 1e18;
auto [n, m] = gen.generate(PAIR{2,size}, PAIR{0,max});
auto [l, r] = gen.generate(PAIR{0,m}, PAIR{0,m});
if(l > r) { std::swap(l, r); }
return std::make_tuple(n, m, l, r);
};
auto out = [](ll n, ll m, ll l, ll r) {
cout << 1 << endl;
cout << n << " " << m << " " << l << " " << r << endl;
cout << solve(n, m, l, r) << endl;
cout << solve_c(n, m, l, r) << endl;
};
auto runner = Sample::RandomCaseDebugger();
runner.compare(10000, g, out, solve, solve_c);
#endif
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0