結果

問題 No.1096 Range Sums
ユーザー rokahikou1
提出日時 2020-08-06 19:52:00
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 36 ms / 2,000 ms
コード長 2,807 bytes
コンパイル時間 711 ms
コンパイル使用メモリ 95,216 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-21 19:19:01
合計ジャッジ時間 2,103 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
template <uint_fast64_t MOD> class ModInt {
using u64 = uint_fast64_t;
public:
u64 val;
ModInt(const u64 x = 0) : val((x + MOD) % MOD) {}
constexpr u64 &value() { return val; }
constexpr ModInt operator-() { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &rhs) const {
return ModInt(*this) += rhs;
}
constexpr ModInt operator-(const ModInt &rhs) const {
return ModInt(*this) -= rhs;
}
constexpr ModInt operator*(const ModInt &rhs) const {
return ModInt(*this) *= rhs;
}
constexpr ModInt operator/(const ModInt &rhs) const {
return ModInt(*this) /= rhs;
}
constexpr ModInt &operator+=(const ModInt &rhs) {
val += rhs.val;
if(val >= MOD) {
val -= MOD;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt &rhs) {
if(val < rhs.val) {
val += MOD;
}
val -= rhs.val;
return *this;
}
constexpr ModInt &operator*=(const ModInt &rhs) {
val = val * rhs.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &rhs) {
*this *= rhs.inv();
return *this;
}
constexpr bool operator==(const ModInt &rhs) { return this->a == rhs.a; }
constexpr bool operator!=(const ModInt &rhs) { return this->a != rhs.a; }
friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) {
return is >> x.val;
}
constexpr ModInt inv() const { return ModInt(*this).pow(MOD - 2); }
constexpr ModInt pow(ll e) const {
u64 x = 1, p = val;
while(e > 0) {
if(e % 2 == 0) {
p = (p * p) % MOD;
e /= 2;
} else {
x = (x * p) % MOD;
e--;
}
}
return ModInt(x);
}
};
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll res = 0;
for(int i = 0; i < N; i++) {
res += A[i] * (i + 1) * (N - i);
}
cout << res << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0