結果
問題 | No.2336 Do you like typical problems? |
ユーザー |
|
提出日時 | 2023-06-02 22:54:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 231 ms / 2,000 ms |
コード長 | 6,756 bytes |
コンパイル時間 | 4,390 ms |
コンパイル使用メモリ | 264,096 KB |
最終ジャッジ日時 | 2025-02-13 19:53:00 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
ソースコード
#ifndef HIDDEN_IN_VS // 折りたたみ用// 警告の抑制#define _CRT_SECURE_NO_WARNINGS// ライブラリの読み込み#include <bits/stdc++.h>using namespace std;// 型名の短縮using ll = long long; // -2^63 ~ 2^63 = 9 * 10^18(int は -2^31 ~ 2^31 = 2 * 10^9)using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;using Graph = vvi;// 定数の定義const double PI = acos(-1);const vi DX = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左)const vi DY = { 0, 1, 0, -1 };int INF = 1001001001; ll INFL = 4004004004004004004LL;double EPS = 1e-15;// 入出力高速化struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;// 汎用マクロの定義#define all(a) (a).begin(), (a).end()#define sz(x) ((int)(x).size())#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順#define repe(v, a) for(const auto& v : (a)) // a の全要素(変更不可能)#define repea(v, a) for(auto& v : (a)) // a の全要素(変更可能)#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索(昇順)#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順)#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了// 汎用関数の定義template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら trueを返す)template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら trueを返す)template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }// 演算子オーバーロードtemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }#endif // 折りたたみ用#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#ifdef _MSC_VER#include "localACL.hpp"#endif//using mint = modint1000000007;using mint = modint998244353;//using mint = modint; // mint::set_mod(m);namespace atcoder {inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }}using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;#endif#ifdef _MSC_VER // 手元環境(Visual Studio)#include "local.hpp"#else // 提出用(gcc)inline int popcount(int n) { return __builtin_popcount(n); }inline int popcount(ll n) { return __builtin_popcountll(n); }inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }#define gcd __gcd#define dump(...)#define dumpel(v)#define dump_list(v)#define dump_mat(v)#define input_from_file(f)#define output_to_file(f)#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }#endiftemplate <class T>class Pair_multiple_sum {T sum, sqsum;public:Pair_multiple_sum() : sum(0), sqsum(0) {}void insert(T x) {sum += x;sqsum += x * x;}void erase(T x) {sum -= x;sqsum -= x * x;}T get() {return (sum * sum - sqsum) / 2;}#ifdef _MSC_VERfriend ostream& operator<<(ostream& os, const Pair_multiple_sum& PMS) {os << "sum:" << PMS.sum << " ,sqsum:" << PMS.sqsum;return os;}#endif};//【mint → 有理数】(実験用)/** x を分母と分子の絶対値が v_max 以下の有理数表示に変換する(不可能ならそのまま)*/string mint_to_frac(mint x, int v_max = 31595) {// verify : https://www.codechef.com/problems/SUMOVERALLrepi(dnm, 1, v_max) {int num = (x * dnm).val();if (num == 0) {return "0";}if (num <= v_max) {if (dnm == 1) return to_string(num);return to_string(num) + "/" + to_string(dnm);}if (mint::mod() - num <= v_max) {if (dnm == 1) return "-" + to_string(mint::mod() - num);return "-" + to_string(mint::mod() - num) + "/" + to_string(dnm);}}return to_string(x.val());}int main() {// input_from_file("input.txt");// output_to_file("output.txt");int n;cin >> n;vl b(n), c(n);rep(i, n) cin >> b[i] >> c[i];--b;if (n == 1) EXIT(0);vector<tuple<ll, int, ll>> xtw(2 * n);rep(i, n) xtw[i] = { b[i], 0, c[i] - b[i]};rep(i, n) xtw[n + i] = { c[i], 1, c[i] - b[i]};sort(all(xtw));Pair_multiple_sum<mint> PMS;mint res = 0; ll x_prv = 0;rep(i, 2 * n) {dump("----", i, "-----");auto [x, tp, w] = xtw[i];dump(x_prv, x, tp, w);auto val = PMS.get();res += val * (x - x_prv);dump(mint_to_frac(val), mint_to_frac(res));if (tp == 0) {PMS.insert(mint(w).inv());}else {PMS.erase(mint(w).inv());}x_prv = x;}res /= mint(n) * (n - 1) / 2;res = (1 - res) / 2;res *= mint(n) * (n - 1) / 2;rep(i, n) res *= i + 1;dump(mint_to_frac(res));cout << res << endl;}