結果
問題 | No.2875 What is My Rank? |
ユーザー |
|
提出日時 | 2024-09-06 22:25:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 143 ms / 2,000 ms |
コード長 | 2,517 bytes |
コンパイル時間 | 2,063 ms |
コンパイル使用メモリ | 193,060 KB |
最終ジャッジ日時 | 2025-02-24 04:35:06 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;long long mod = 998244353;//入力が必ず-mod<a<modの時.struct mint{long long v = 0;mint(){} mint(int a){v = a<0?a+mod:a;} mint(long long a){v = a<0?a+mod:a;}mint(unsigned long long a){v = a;}long long val(){return v;}void modu(){v %= mod;}mint repeat2mint(const long long a,long long b){mint ret = 1,p = a;while(b){if(b&1) ret *= p;p *= p; b >>= 1;}return ret;};mint &operator=(const mint &b) = default;mint operator-() const {return mint(0)-(*this);}mint operator+(const mint b){return mint(v)+=b;}mint operator-(const mint b){return mint(v)-=b;}mint operator*(const mint b){return mint(v)*=b;}mint operator/(const mint b){return mint(v)/=b;}mint operator+=(const mint b){v += b.v; if(v >= mod) v -= mod;return *this;}mint operator-=(const mint b){v -= b.v; if(v < 0) v += mod;return *this;}mint operator*=(const mint b){v = v*b.v%mod; return *this;}mint operator/=(mint b){if(b == 0) assert(false);int left = mod-2;while(left){if(left&1) *this *= b; b *= b; left >>= 1;}return *this;}mint operator++(int){*this += 1; return *this;}mint operator--(int){*this -= 1; return *this;}bool operator==(const mint b){return v == b.v;}bool operator!=(const mint b){return v != b.v;}bool operator>(const mint b){return v > b.v;}bool operator>=(const mint b){return v >= b.v;}bool operator<(const mint b){return v < b.v;}bool operator<=(const mint b){return v <= b.v;}mint pow(const long long x){return repeat2mint(v,x);}mint inv(){return mint(1)/v;}};int main() {ios_base::sync_with_stdio(false);cin.tie(nullptr);int N; cin >> N;long long l0,r0; cin >> l0 >> r0;mint answer = 1;for(int i=1; i<N; i++){long long l,r; cin >> l >> r;if(r <= l0) continue;if(r0 < l) answer++;else{long long win = min(r0,r)+1-l;long long add = max(0LL,r0-r)*(r-l+1);long long mind = min(win,1LL*(min(r0,r)-l0+1));win = win*(win+1)/2-(win-mind)*(win-mind+1)/2;win += add;long long all = (r0-l0+1)*(r-l+1);answer += mint(1)-mint(win%mod)/mint(all%mod);}}cout << answer.v << endl;// cout << (mint(8)/9).v << endl;}