結果
問題 | No.2250 Split Permutation |
ユーザー | AngrySadEight |
提出日時 | 2023-03-17 22:58:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 347 ms / 3,000 ms |
コード長 | 3,360 bytes |
コンパイル時間 | 10,109 ms |
コンパイル使用メモリ | 306,148 KB |
実行使用メモリ | 18,316 KB |
最終ジャッジ日時 | 2023-10-18 15:59:44 |
合計ジャッジ時間 | 11,961 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 1 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 2 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 2 ms
4,348 KB |
testcase_12 | AC | 2 ms
4,348 KB |
testcase_13 | AC | 2 ms
4,348 KB |
testcase_14 | AC | 2 ms
4,348 KB |
testcase_15 | AC | 2 ms
4,348 KB |
testcase_16 | AC | 2 ms
4,348 KB |
testcase_17 | AC | 2 ms
4,348 KB |
testcase_18 | AC | 347 ms
18,316 KB |
testcase_19 | AC | 316 ms
17,980 KB |
testcase_20 | AC | 280 ms
17,404 KB |
testcase_21 | AC | 169 ms
10,872 KB |
testcase_22 | AC | 258 ms
17,188 KB |
testcase_23 | AC | 42 ms
5,336 KB |
testcase_24 | AC | 253 ms
17,200 KB |
testcase_25 | AC | 346 ms
18,316 KB |
testcase_26 | AC | 122 ms
10,160 KB |
testcase_27 | AC | 29 ms
5,176 KB |
testcase_28 | AC | 58 ms
7,032 KB |
testcase_29 | AC | 336 ms
18,316 KB |
testcase_30 | AC | 63 ms
7,080 KB |
testcase_31 | AC | 15 ms
4,348 KB |
testcase_32 | AC | 71 ms
7,240 KB |
testcase_33 | AC | 190 ms
11,328 KB |
testcase_34 | AC | 42 ms
5,344 KB |
testcase_35 | AC | 129 ms
10,536 KB |
testcase_36 | AC | 76 ms
7,216 KB |
testcase_37 | AC | 335 ms
18,316 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll op(ll a, ll b){ return (a + b) % mod2; } ll e(){ return 0LL; } ll mapping(ll f, ll x){ return (f * x) % mod2; } ll composition(ll f, ll g){ return (f * (g)) % mod2; } ll id(){ return 1LL; } int main(){ ll N; cin >> N; vl P(N); rep(i,N){ cin >> P[i]; P[i]--; } ll p2 = 1; vl pow_2(N + 1); pow_2[0] = 1; for (ll i = 0; i < N; i++){ pow_2[i + 1] = (pow_2[i] * 2LL) % mod2; } lazy_segtree<ll, op, e, ll, mapping, composition, id> l_seg(N); segtree<ll, op, e> seg(N); ll ans = 0; for (ll i = 0; i < N; i++){ seg.set(P[i], p2); ll val_sum = seg.prod(P[i] + 1, N); ans = (ans + mod2 - (val_sum * pow_2[N - 1 - i]) % mod2) % mod2; l_seg.set(P[i], p2); ll prd = l_seg.prod(P[i] + 1, N); ans = (ans + (prd * pow_2[N - 1 - i]) % mod2) % mod2; l_seg.apply(0, N, 2LL); /*for (ll j = 0; j < N; j++){ cout << l_seg.get(j) << " "; } cout << endl;*/ //debug(ans); p2 = (p2 * 2) % mod2; } cout << ans << endl; }