結果
問題 | No.2875 What is My Rank? |
ユーザー | pitP |
提出日時 | 2024-09-07 00:32:22 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,152 bytes |
コンパイル時間 | 6,301 ms |
コンパイル使用メモリ | 337,888 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-07 00:32:32 |
合計ジャッジ時間 | 9,139 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | WA | - |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 116 ms
6,944 KB |
testcase_34 | AC | 53 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); } istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); } istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } typedef long long ll; typedef vector<vector<int>> Graph; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define FOR(i,l,r) for (int i = l;i < (int)(r); i++) #define rep(i,n) for (int i = 0;i < (int)(n); i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define my_sort(x) sort(x.begin(), x.end()) #define my_max(x) *max_element(all(x)) #define my_min(x) *min_element(all(x)) template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const int INF = (1<<30) - 1; const ll LINF = (1LL<<62) - 1; const int MOD = 998244353; const int MOD2 = 1e9+7; const double PI = acos(-1); vector<int> di = {1,0,-1,0}; vector<int> dj = {0,1,0,-1}; #ifdef LOCAL # include <debug_print.hpp> # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast<void>(0)) #endif using mint = modint998244353; // using mint = double; int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; vector<int> l(N), r(N); rep(i, N) { cin >> l[i] >> r[i]; l[i]--; } mint inv2 = mint(1) / mint(2); mint ans = 1; FOR(i, 1, N){ if(r[0] <= l[i]) ans += 1; else if(l[0] >= r[i]); else { auto func = [&](int left, int right){ mint res = 0; res += (r[i] - 1) * (right - left); res -= right * (right - 1) * inv2; res += left * (left - 1) * inv2; res /= (mint)(r[i] - l[i]); debug(res); return res; }; mint tmp = 0; if((l[0] <= l[i]) && (r[0] <= r[i])){ debug(1); debug(r[i] - l[i]); tmp += (mint)(l[i] - l[0]); tmp += func(l[i], r[0]); } else if((l[0] <= l[i]) && (r[0] >= r[i])){ debug(2); tmp += (mint)(l[i] - l[0]); tmp += func(l[i], r[i]); } else if((l[0] >= l[i]) && (r[0] <= r[i])){ debug(3); tmp += func(l[0], r[0]); } else if((l[0] >= l[i]) && (r[0] >= r[i])){ debug(4); tmp += func(l[0], r[i]); } debug(tmp); tmp /= (mint)(r[0] - l[0]); ans += tmp; } } cout << ans << endl; }