結果
問題 | No.2950 Max Min Product |
ユーザー | leaf_1415 |
提出日時 | 2024-10-25 22:12:09 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 75 ms / 3,000 ms |
コード長 | 11,114 bytes |
コンパイル時間 | 1,527 ms |
コンパイル使用メモリ | 118,148 KB |
実行使用メモリ | 10,896 KB |
最終ジャッジ日時 | 2024-10-25 23:30:24 |
合計ジャッジ時間 | 5,434 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
10,256 KB |
testcase_01 | AC | 3 ms
8,516 KB |
testcase_02 | AC | 4 ms
8,952 KB |
testcase_03 | AC | 45 ms
10,120 KB |
testcase_04 | AC | 49 ms
10,352 KB |
testcase_05 | AC | 47 ms
9,944 KB |
testcase_06 | AC | 65 ms
10,744 KB |
testcase_07 | AC | 67 ms
10,716 KB |
testcase_08 | AC | 66 ms
10,716 KB |
testcase_09 | AC | 35 ms
9,832 KB |
testcase_10 | AC | 59 ms
10,348 KB |
testcase_11 | AC | 49 ms
10,460 KB |
testcase_12 | AC | 68 ms
10,736 KB |
testcase_13 | AC | 66 ms
10,844 KB |
testcase_14 | AC | 67 ms
10,828 KB |
testcase_15 | AC | 62 ms
10,752 KB |
testcase_16 | AC | 46 ms
10,224 KB |
testcase_17 | AC | 49 ms
10,576 KB |
testcase_18 | AC | 67 ms
10,764 KB |
testcase_19 | AC | 66 ms
10,764 KB |
testcase_20 | AC | 66 ms
10,768 KB |
testcase_21 | AC | 40 ms
10,336 KB |
testcase_22 | AC | 51 ms
10,364 KB |
testcase_23 | AC | 35 ms
9,988 KB |
testcase_24 | AC | 66 ms
10,784 KB |
testcase_25 | AC | 65 ms
10,820 KB |
testcase_26 | AC | 66 ms
10,816 KB |
testcase_27 | AC | 46 ms
10,196 KB |
testcase_28 | AC | 64 ms
10,896 KB |
testcase_29 | AC | 47 ms
10,324 KB |
testcase_30 | AC | 68 ms
10,788 KB |
testcase_31 | AC | 67 ms
10,844 KB |
testcase_32 | AC | 67 ms
10,840 KB |
testcase_33 | AC | 55 ms
10,168 KB |
testcase_34 | AC | 38 ms
9,992 KB |
testcase_35 | AC | 53 ms
10,396 KB |
testcase_36 | AC | 75 ms
10,640 KB |
testcase_37 | AC | 74 ms
10,736 KB |
testcase_38 | AC | 74 ms
10,804 KB |
testcase_39 | AC | 4 ms
9,176 KB |
ソースコード
#include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <ctime> #include <cstdlib> #include <cassert> #include <vector> #include <list> #include <stack> #include <queue> #include <deque> #include <map> #include <set> #include <bitset> #include <string> #include <algorithm> #include <utility> #include <complex> #include <array> #include <unordered_set> #include <unordered_map> #define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++) #define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--) #define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++) #define pers(x, s) for(ll x = (ll)(s).size()-1; (x) >= 0; (x)--) #define chmin(x, y) (x) = min((x), (y)) #define chmax(x, y) (x) = max((x), (y)) #define sz(x) ((ll)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define outl(...) dump_func(__VA_ARGS__) #define outf(x) cout << fixed << setprecision(16) << (x) << endl #define pb push_back #define fi first #define se second #define inf 2e18 #define eps 1e-9 const double PI = 3.1415926535897932384626433; using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; template<class T> using Preq = priority_queue<T>; template<class T> using preq = priority_queue<T, vector<T>, greater<T>>; struct edge{ ll to, cost; edge(){} edge(ll a, ll b){ to = a, cost = b;} }; const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1}; const int mod = 998244353; //const int mod = 1000000007; struct mint{ int x; mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;} mint(const mint &ope) {x = ope.x;} mint operator-(){return mint(-x);} mint operator+(const mint &ope){return mint(x) += ope;} mint operator-(const mint &ope){return mint(x) -= ope;} mint operator*(const mint &ope){return mint(x) *= ope;} mint operator/(const mint &ope){return mint(x) /= ope;} mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;} mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;} mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;} mint& operator/=(const mint &ope){ ll n = mod-2; mint mul = ope; while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;} return *this; } mint inverse(){return mint(1) / *this;} bool operator ==(const mint &ope){return x == ope.x;} bool operator !=(const mint &ope){return x != ope.x;} bool operator <(const mint &ope)const{return x < ope.x;} }; mint modpow(mint a, ll n){ if(n == 0) return mint(1); if(n % 2) return a * modpow(a, n-1); else return modpow(a*a, n/2); } istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;} ostream& operator <<(ostream &os, mint &ope){return os << ope.x;} ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;} ll modpow(ll a, ll n, ll mod){ if(n == 0) return 1; if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod; else return modpow((a*a)%mod, n/2, mod) % mod; } vector<mint> fact, fact_inv; void make_fact(int n){ fact.resize(n+1), fact_inv.resize(n+1); fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i); fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1); } mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];} mint perm(int n, int k){ return comb(n, k) * fact[k]; } mint divide(int n, int k){ if(n == 0 && k == 0) return 1; return comb(n+k-1, k-1); } template<typename T> T comb2(ll n, ll k){ if(n < 0 || k < 0 || n < k) return T(0); T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;} mint cat(ll w, ll h, ll b = 0){ return comb(w+h, w) - comb(w+h, h+b+1); } //b >= 0; vector<ll> prime, pvec, qrime; void make_prime(int n){ prime.resize(n+1); rep(i, 2, n){ if(prime[i] == 0) pvec.push_back(i), prime[i] = i; for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;} } } void make_qrime(int n){ qrime.resize(n+1); rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];} } void factorize(ll n, map<ll, ll> &mp){ mp.clear(); for(auto p : pvec) while(n % p == 0) mp[p]++, n /= p; if(n > 1) mp[n]++; } template<typename S, typename T, typename U> bool isin(S x, T l, U r){return l <= x && x <= r;} template<typename T> bool isdigit(T c){return isin(c, '0', '9');} template<typename T> bool islower(T c){return isin(c, 'a', 'z');} template<typename T> bool isupper(T c){return isin(c, 'A', 'Z');} bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;} void mark(){ cout << "*" << endl; } void yes(){ cout << "Yes" << endl; } void no(){ cout << "No" << endl; } ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); } ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); } ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;} ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;} ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);} ll lcm(ll a, ll b){return a/gcd(a, b)*b;} template<typename T> T arith(T x){return x*(x+1)/2;} template<typename T> T arith2(T x){return x*(x+1)*(x*2+1)/6;} ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;} ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;} string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;} ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;} template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());} int popcount(ull x){ x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL); return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56; } template<typename T> vector<pair<T, ll>> rle(vector<T> vec){ vector<pair<T, ll>> ret; for(auto x : vec){if(sz(ret) == 0 || ret.back().first != x) ret.push_back(P(x, 1)); else ret.back().second++;} return ret; } vector<pair<char, ll>> rle(string s){ vector<char> vec; for(auto c : s) vec.push_back(c); return rle(vec);} template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;} template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;} template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);} template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);} template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;} template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;} template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);} template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));} template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);} template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;} template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;} template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;} template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;} template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;} template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;} template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i, deq) os << deq[i] << " "; return os;} template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;} template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;} template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;} template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;} template<typename T> void outg(T a[], ll sy, ll ty, ll sx, ll tx){rep(y, sy, ty){rep(x, sx, tx){cout << a[x][y]; if(x < tx) cout << " ";} cout << endl;}} template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;} template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;} void dump_func(){cout << endl;} template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);} template<typename T> void bssert(bool b, T t){ if(!b) cout << t << endl, exit(0); } typedef ll llint; llint n; llint a[200005]; llint mx[200005], mn[250005]; mint msum[200005], Msum[200005], psum[200005]; mint ans = 0; void calc(llint l, llint r) { if(l > r) return; if(l == r){ ans += mint(a[l])*mint(a[l]); return; } llint m = (l+r)/2; mint sum = 0; mn[m] = inf, mx[m] = 0; for(int i = m+1; i <= r; i++){ mx[i] = max(mx[i-1], a[i]); mn[i] = min(mn[i-1], a[i]); } msum[m] = Msum[m] = psum[m] = 0; for(int i = m+1; i <= r; i++){ msum[i] = msum[i-1] + mn[i]; Msum[i] = Msum[i-1] + mx[i]; psum[i] = psum[i-1] + mint(mn[i]) * mint(mx[i]); } llint cmin = inf, cmax = 0, lpos = m, rpos = m; for(int i = m; i >= l; i--){ cmax = max(cmax, a[i]); cmin = min(cmin, a[i]); while(lpos < r && a[lpos+1] <= cmax) lpos++; while(rpos < r && a[rpos+1] >= cmin) rpos++; ans += mint(cmax) * mint(cmin) * mint(min(lpos, rpos)-m); if(lpos <= rpos){ ans += mint(Msum[rpos]-Msum[lpos]) * mint(cmin); } else{ ans += mint(msum[lpos]-msum[rpos]) * mint(cmax); } ans += psum[r] - psum[max(lpos, rpos)]; } calc(l, m); calc(m+1, r); } int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]; calc(1, n); cout << ans << endl; return 0; }