提出 #26317005
ソースコード 拡げる
#include <stdio.h>
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using Bint = boost::multiprecision::cpp_int;
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const double PI = acos(-1.0);
const double EPS = 1e-10;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
inline constexpr ll ceil_div(const ll a, const ll b) {return (a + b - 1) / b - !!((a + b - 1) % b < 0);}// return ceil(a/b)
inline constexpr ll floor_div(const ll a, const ll b) {return a / b - !!(a % b < 0);}// return floor(a/b)
/* ----------------------- DEBUG FUNCTION ---------------------------- */
#define DUMPOUT cerr
void dump_function() { DUMPOUT << ' '; }
void dump_function(bool a) { DUMPOUT << a; }
void dump_function(int a) { DUMPOUT << a; }
void dump_function(long long a) { DUMPOUT << a; }
void dump_function(char a) { DUMPOUT << a; }
void dump_function(string &a) { DUMPOUT << a; }
void dump_function(double a) { DUMPOUT << a; }
template <class T> void dump_function(const vector<T> &);
template <class T, size_t size> void dump_function(const array<T, size> &);
template <class T, class L> void dump_function(const pair<T, L> &p);
template <class T, size_t size> void dump_function(const T (&)[size]);
template <class T> void dump_function(const vector<T> &a) {
if(a.empty()) return;
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
DUMPOUT << endl;
}
template <class T> void dump_function(const deque<T> &a) {
if(a.empty()) return;
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T, size_t size> void dump_function(const array<T, size> &a) {
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T, class L> void dump_function(const pair<T, L> &p) {
DUMPOUT << '(';
dump_function(p.first);
DUMPOUT << ",";
dump_function(p.second);
DUMPOUT << ')';
}
template <class T> void dump_function(set<T> &x) {
for(auto e : x) dump_function(e), DUMPOUT << " ";
DUMPOUT << endl;
}
template <class T> void dump_function(multiset<T> &x) {
for(auto e : x) dump_function(e), DUMPOUT << " ";
DUMPOUT << endl;
}
template <class T, size_t size> void dump_function(const T (&a)[size]) {
dump_function(a[0]);
for(auto i = a; ++i != end(a);) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T> void dump_function(const T &a) { DUMPOUT << a; }
int dump_out() {
DUMPOUT << '\n';
return 0;
}
template <class T> int dump_out(const T &t) {
dump_function(t);
DUMPOUT << '\n';
return 0;
}
template <class Head, class... Tail> int dump_out(const Head &head, const Tail &... tail) {
dump_function(head);
DUMPOUT << ' ';
dump_out(tail...);
return 0;
}
#ifdef DEBUG_
#define dump(x) \
DUMPOUT << #x << ": "; \
dump_function(x); \
DUMPOUT << endl;
void dumps() {}
template <class T> void dumps(const T &t) {
dump_function(t);
DUMPOUT << " ";
}
template <class Head, class... Tail> void dumps(const Head &head, const Tail &... tail) {
dump_function(head);
DUMPOUT << ' ';
dump_out(tail...);
}
#else
#define dump(x)
template <class... T> void dumps(const T &...) {}
#endif
/* ----------------------- DEBUG FUNCTION ---------------------------- */
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0) val += MOD;
}
constexpr int getmod() const { return MOD; }
constexpr Fp operator - () const noexcept {
return val ? MOD - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= MOD) val -= MOD;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += MOD;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b, swap(a, b);
u -= t * v, swap(u, v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {
is >> x.val;
x.val %= MOD;
if (x.val < 0) x.val += MOD;
return is;
}
friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(r, n / 2);
t = t * t;
if (n & 1) t = t * r;
return t;
}
friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b, swap(a, b);
u -= t * v, swap(u, v);
}
return Fp<MOD>(u);
}
};
template<class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for(int i = 2; i < n; i++){
fact_[i] = fact_[i-1] * i;
inv_[i] = -inv_[MOD%i] * (MOD/i);
finv_[i] = finv_[i-1] * inv_[i];
}
}
constexpr T nCr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
int MOD = fact_[0].getmod();
if(n < MOD) return fact_[n] * finv_[k] * finv_[n-k];
// Lucasの定理
T ret = 1;
while(n || k){
int _n = n % MOD, _k = k % MOD;
n /= MOD;
k /= MOD;
ret *= nCr(_n, _k);
}
return ret;
}
constexpr T nPr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
return fact_[n] * finv_[n-k];
}
constexpr T nHr(int n, int k) const noexcept {
if (n <= 0 || k < 0) return 0;
return nCr(n + k - 1, k);
}
constexpr T fact(int n) const noexcept {
if (n < 0) return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0) return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0) return 0;
return finv_[n];
}
};
/* ----------------------------- MOD ----------------------------------- */
const int MOD = 1000000007;
const int MOD2 = 998244353;
using mint = Fp<MOD2>;
BiCoef<mint> bc;
// using vec = vector<int>;
// using mat = vector<vec>;
/* ----------------------------- MOD ----------------------------------- */
/* ----------------------- AtCoder Library ---------------------------- */
// #include <atcoder/all>
// using namespace atcoder;
/* ----------------------- AtCoder Library ---------------------------- */
template <class Abel> struct BIT {
const Abel UNITY_SUM = 0; // to be set
vector<Abel> dat;
/* [1, n] */
BIT(int n) : dat(n + 1, UNITY_SUM) { }
void init(int n) { dat.assign(n + 1, UNITY_SUM); }
/* a is 1-indexed */
inline void add1(int a, Abel x) {
for (int i = a; i < (int)dat.size(); i += i & -i)
dat[i] = dat[i] + x;
}
/* [1, a], a is 1-indexed */
inline Abel sum1(int a) {
Abel res = UNITY_SUM;
for (int i = a; i > 0; i -= i & -i)
res = res + dat[i];
return res;
}
/* [a, b), a and b are 1-indexed */
inline Abel sum1(int a, int b) {
return sum(b - 1) - sum(a - 1);
}
/* a is 0-indexed */
inline void add(int a, Abel x){
add1(a + 1, x);
}
/* [0, a), a is 0-indexed */
inline Abel sum(int a){
return sum1(a);
}
/* [a, b), a is 0-indexed */
inline Abel sum(int a, int b){
return sum1(b) - sum1(a);
}
/* get k-th element (k is 0-indexed) */
int kth_element(long long k) {
++k;
int res = 0;
int N = 1; while (N < (int)dat.size()) N *= 2;
for (int i = N / 2; i > 0; i /= 2) {
if (res + i < (int)dat.size() && dat[res + i] < k) {
k = k - dat[res + i];
res = res + i;
}
}
return res + 1;
}
/* debug */
void print() {
for (int i = 1; i < (int)dat.size(); ++i) cout << sum1(i, i + 1) << ",";
cout << endl;
}
};
template<typename T>
struct Compress {
vector<T> v;
Compress() {}
Compress(vector<T> _v) :v(_v) { build(); }
void add(T x) {
v.emplace_back(x);
}
void build() {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
void build(vector<T> _v) {
v = _v;
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
int get(T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
T& operator[](int i) { return v[i]; }
int size() {
return (int)v.size();
}
};
void solve(){
int N;
cin >> N;
vector<ll> A(N);
Compress<ll> cmp;
cmp.add(0);
cmp.add(LINF);
REP(i,N){
cin >> A[i];
cmp.add(A[i]);
}
cmp.build();
int sz = cmp.size();
BIT<mint> bit(sz+10);
vector<mint> two(N+1);
mint cur = 1;
for(int i=1;i<N;i++){
two[i] = cur;
cur *= 2;
}
REP(i,N) bit.add(cmp.get(A[i]), two[i]);
mint ans = 0;
REP(i,N-1){
bit.add(cmp.get(A[i]), -two[i]);
mint sum = bit.sum(cmp.get(A[i]), sz+1);
if(i > 0) sum /= two[i+1];
ans += sum;
}
cout << ans << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
// int T; cin >> T; REP(t,T) solve();
}
提出情報
| 提出日時 |
|
| 問題 |
E - LEQ |
| ユーザ |
Bondo416 |
| 言語 |
C++ (GCC 9.2.1) |
| 得点 |
500 |
| コード長 |
11902 Byte |
| 結果 |
AC |
| 実行時間 |
290 ms |
| メモリ |
12608 KiB |
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
500 / 500 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
example0.txt, example1.txt, example2.txt, example3.txt |
| All |
000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, example0.txt, example1.txt, example2.txt, example3.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 000.txt |
AC |
2 ms |
3488 KiB |
| 001.txt |
AC |
2 ms |
3520 KiB |
| 002.txt |
AC |
285 ms |
12524 KiB |
| 003.txt |
AC |
280 ms |
12548 KiB |
| 004.txt |
AC |
290 ms |
12540 KiB |
| 005.txt |
AC |
285 ms |
12544 KiB |
| 006.txt |
AC |
177 ms |
9344 KiB |
| 007.txt |
AC |
186 ms |
9680 KiB |
| 008.txt |
AC |
36 ms |
4304 KiB |
| 009.txt |
AC |
188 ms |
9672 KiB |
| 010.txt |
AC |
186 ms |
12536 KiB |
| 011.txt |
AC |
185 ms |
12560 KiB |
| 012.txt |
AC |
188 ms |
12528 KiB |
| 013.txt |
AC |
186 ms |
12540 KiB |
| 014.txt |
AC |
184 ms |
12536 KiB |
| 015.txt |
AC |
187 ms |
12444 KiB |
| 016.txt |
AC |
130 ms |
10496 KiB |
| 017.txt |
AC |
158 ms |
10416 KiB |
| 018.txt |
AC |
160 ms |
10416 KiB |
| 019.txt |
AC |
132 ms |
10156 KiB |
| 020.txt |
AC |
138 ms |
10340 KiB |
| 021.txt |
AC |
142 ms |
10432 KiB |
| 022.txt |
AC |
193 ms |
10336 KiB |
| 023.txt |
AC |
145 ms |
10432 KiB |
| 024.txt |
AC |
144 ms |
10088 KiB |
| 025.txt |
AC |
186 ms |
12608 KiB |
| 026.txt |
AC |
189 ms |
12460 KiB |
| 027.txt |
AC |
285 ms |
12544 KiB |
| 028.txt |
AC |
282 ms |
12540 KiB |
| 029.txt |
AC |
281 ms |
12564 KiB |
| 030.txt |
AC |
185 ms |
12560 KiB |
| example0.txt |
AC |
3 ms |
3568 KiB |
| example1.txt |
AC |
2 ms |
3520 KiB |
| example2.txt |
AC |
2 ms |
3568 KiB |
| example3.txt |
AC |
2 ms |
3568 KiB |