結果
問題 | No.2875 What is My Rank? |
ユーザー | 👑 binap |
提出日時 | 2024-09-06 22:32:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 280 ms / 2,000 ms |
コード長 | 2,755 bytes |
コンパイル時間 | 4,498 ms |
コンパイル使用メモリ | 264,384 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-06 22:32:10 |
合計ジャッジ時間 | 9,690 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,812 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 3 ms
6,940 KB |
testcase_09 | AC | 245 ms
6,940 KB |
testcase_10 | AC | 243 ms
6,940 KB |
testcase_11 | AC | 280 ms
6,944 KB |
testcase_12 | AC | 86 ms
6,940 KB |
testcase_13 | AC | 98 ms
6,944 KB |
testcase_14 | AC | 27 ms
6,940 KB |
testcase_15 | AC | 194 ms
6,944 KB |
testcase_16 | AC | 167 ms
6,940 KB |
testcase_17 | AC | 116 ms
6,944 KB |
testcase_18 | AC | 194 ms
6,944 KB |
testcase_19 | AC | 219 ms
6,940 KB |
testcase_20 | AC | 45 ms
6,944 KB |
testcase_21 | AC | 56 ms
6,940 KB |
testcase_22 | AC | 105 ms
6,940 KB |
testcase_23 | AC | 211 ms
6,944 KB |
testcase_24 | AC | 233 ms
6,944 KB |
testcase_25 | AC | 97 ms
6,944 KB |
testcase_26 | AC | 36 ms
6,944 KB |
testcase_27 | AC | 80 ms
6,940 KB |
testcase_28 | AC | 80 ms
6,940 KB |
testcase_29 | AC | 128 ms
6,940 KB |
testcase_30 | AC | 115 ms
6,944 KB |
testcase_31 | AC | 20 ms
6,944 KB |
testcase_32 | AC | 181 ms
6,940 KB |
testcase_33 | AC | 237 ms
6,944 KB |
testcase_34 | AC | 194 ms
6,940 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} using mint = modint998244353; int main(){ int n; cin >> n; vector<int> l(n); vector<int> r(n); rep(i, n) cin >> l[i] >> r[i]; vector<int> d(n); rep(i, n) d[i] = r[i] - l[i] + 1; auto f = [&](int i, int x) -> mint{ if(x < l[i]) return mint(0); else if(x < r[i]){ mint width = x - l[i] + 1; return width * (width + 1) / 2 / d[i]; } { mint width = x - r[i]; return mint(d[i] + 1) / 2 + width; } }; mint ans = 1; for(int i = 1; i < n; i++){ mint prob = 0; prob += f(i, r[0]); prob -= f(i, l[0] - 1); ans += mint(1) - prob / d[0]; // cout << prob << "\n"; } cout << ans << "\n"; return 0; }