結果
問題 | No.1099 Range Square Sum |
ユーザー |
|
提出日時 | 2020-06-26 21:51:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 385 ms / 2,000 ms |
コード長 | 15,457 bytes |
コンパイル時間 | 3,330 ms |
コンパイル使用メモリ | 241,560 KB |
最終ジャッジ日時 | 2025-01-11 11:18:13 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
コンパイルメッセージ
main.cpp:424:1: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type] 424 | main() { | ^~~~ main.cpp: In function ‘void scan(char*)’: main.cpp:65:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 65 | void scan(char a[]) { scanf("%s", a); } | ~~~~~^~~~~~~~~
ソースコード
#pragma region Macros#pragma GCC optimize("O3")#include <bits/stdc++.h>#define ll long long#define ld long double#define rep2(i, a, b) for(ll i = a; i <= b; ++i)#define rep(i, n) for(ll i = 0; i < n; ++i)#define rep3(i, a, b) for(ll i = a; i >= b; --i)#define pii pair<int, int>#define pll pair<ll, ll>#define pb push_back#define eb emplace_back#define vi vector<int>#define vll vector<ll>#define vpi vector<pii>#define vpll vector<pll>#define overload2(_1, _2, name, ...) name#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define VEC(type, name, size)\vector<type> name(size);\IN(name)#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define VV(type, name, h, w)\vector<vector<type>> name(h, vector<type>(w));\IN(name)#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define fi first#define se second#define all(c) begin(c), end(c)#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))using namespace std;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;#define Size(c) (int)(c).size()#define INT(...)\int __VA_ARGS__;\IN(__VA_ARGS__)#define LL(...)\ll __VA_ARGS__;\IN(__VA_ARGS__)#define ULL(...)\ull __VA_ARGS__;\IN(__VA_ARGS__)#define STR(...)\string __VA_ARGS__;\IN(__VA_ARGS__)#define CHR(...)\char __VA_ARGS__;\IN(__VA_ARGS__)#define DBL(...)\double __VA_ARGS__;\IN(__VA_ARGS__)#define LD(...)\ld __VA_ARGS__;\IN(__VA_ARGS__)int scan() { return getchar(); }template <class T> void scan(T a) { cin >> a; }void scan(int &a) { cin >> a; }void scan(long long &a) { cin >> a; }void scan(char &a) { cin >> a; }void scan(double &a) { cin >> a; }void scan(long double &a) { cin >> a; }void scan(char a[]) { scanf("%s", a); }void scan(string &a) { cin >> a; }template <class T> void scan(vector<T> &);template <class T, size_t size> void scan(array<T, size> &);template <class T, class L> void scan(pair<T, L> &);template <class T, size_t size> void scan(T (&)[size]);template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);}template <class T> void scan(deque<T> &a) {for(auto &i : a) scan(i);}template <class T, size_t size> void scan(array<T, size> &a) {for(auto &i : a) scan(i);}template <class T, class L> void scan(pair<T, L> &p) {scan(p.first);scan(p.second);}template <class T, size_t size> void scan(T (&a)[size]) {for(auto &i : a) scan(i);}template <class T> void scan(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &... tail) {scan(head);IN(tail...);}string stin() {string s;cin >> s;return s;}template <class T, class S> inline bool chmax(T &a, S b) {if(a < b) {a = b;return 1;}return 0;}template <class T, class S> inline bool chmin(T &a, S b) {if(a > b) {a = b;return 1;}return 0;}vi iota(int n) {vi a(n);iota(all(a), 0);return a;}template <class T> void UNIQUE(vector<T> &x) {sort(all(x));x.erase(unique(all(x)), x.end());}int in() {int x;cin >> x;return x;}ll lin() {unsigned long long x;cin >> x;return x;}void print() { putchar(' '); }void print(bool a) { cout << a; }void print(int a) { cout << a; }void print(long long a) { cout << a; }void print(char a) { cout << a; }void print(string &a) { cout << a; }void print(double a) { cout << a; }template <class T> void print(const vector<T> &);template <class T, size_t size> void print(const array<T, size> &);template <class T, class L> void print(const pair<T, L> &p);template <class T, size_t size> void print(const T (&)[size]);template <class T> void print(const vector<T> &a) {if(a.empty()) return;print(a[0]);for(auto i = a.begin(); ++i != a.end();) {cout << " ";print(*i);}cout << endl;}template <class T> void print(const deque<T> &a) {if(a.empty()) return;print(a[0]);for(auto i = a.begin(); ++i != a.end();) {cout << " ";print(*i);}}template <class T, size_t size> void print(const array<T, size> &a) {print(a[0]);for(auto i = a.begin(); ++i != a.end();) {cout << " ";print(*i);}}template <class T, class L> void print(const pair<T, L> &p) {cout << '(';print(p.first);cout << ",";print(p.second);cout << ')';}template <class T> void print(set<T> &x) {for(auto e : x) print(e), cout << " ";cout << endl;}template <class T> void print(multiset<T> &x) {for(auto e : x) print(e), cout << " ";cout << endl;}template <class T, size_t size> void print(const T (&a)[size]) {print(a[0]);for(auto i = a; ++i != end(a);) {cout << " ";print(*i);}}template <class T> void print(const T &a) { cout << a; }int out() {putchar('\n');return 0;}template <class T> int out(const T &t) {print(t);putchar('\n');return 0;}template <class Head, class... Tail> int out(const Head &head, const Tail &... tail) {print(head);putchar(' ');out(tail...);return 0;}ll gcd(ll a, ll b) {while(b) {ll c = b;b = a % b;a = c;}return a;}ll lcm(ll a, ll b) {if(!a || !b) return 0;return a * b / gcd(a, b);}vector<pll> factor(ll x) {vector<pll> ans;for(ll i = 2; i * i <= x; i++)if(x % i == 0) {ans.push_back({i, 1});while((x /= i) % i == 0) ans.back().second++;}if(x != 1) ans.push_back({x, 1});return ans;}vector<int> divisor(int x) {vector<int> ans;for(int i = 1; i * i <= x; i++)if(x % i == 0) {ans.pb(i);if(i * i != x) ans.pb(x / i);}return ans;}template <typename T> void zip(vector<T> &x) {vector<T> y = x;sort(all(y));for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }}int popcount(ll x) { return __builtin_popcountll(x); }mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }template <typename T> void shuffle(vector<T> &v) {rep3(i, v.size() - 1, 1) { swap(v[i], v[rnd(i)]); }}#define endl '\n'vector<string> YES{"NO", "YES"};vector<string> Yes{"No", "Yes"};vector<string> yes{"no", "yes"};#ifdef _LOCAL#undef endl#define debug(x)\cout << #x << ": ";\print(x);\cout << endl;void err() {}template <class T> void err(const T &t) {print(t);cout << " ";}template <class Head, class... Tail> void err(const Head &head, const Tail &... tail) {print(head);putchar(' ');out(tail...);}#else#define debug(x)template <class... T> void err(const T &...) {}#endiftemplate <typename T> struct edge {int from, to;T cost;int id;edge(int to, T cost) : from(-1), to(to), cost(cost) {}edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}// edge(int from,int to,T cost,int id):from(from),to(to),cost(cost),id(id){}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template <typename T> using Edges = vector<edge<T>>;template <typename T> using WeightedTree = vector<Edges<T>>;template <typename T> using Edges = vector<edge<T>>;template <typename T> using WeightedGraph = vector<Edges<T>>;template <typename T> using Matrix = vector<vector<T>>;using Graph = vector<vector<int>>;using tree = vector<vector<int>>;tree getTree(int n, int offset = 1) {tree res(n);for(int i = 0; i < n - 1; i++) {int a, b;cin >> a >> b;a -= offset, b -= offset;res[a].emplace_back(b);res[b].emplace_back(a);}return res;}template <typename T> WeightedTree<T> getWeightedTree(int n, int offset = 1) {WeightedTree<T> res(n);for(int i = 0; i < n - 1; i++) {int a, b;cin >> a >> b;a -= offset, b -= offset;T c;cin >> c;res[a].emplace_back(b, c);res[b].emplace_back(a, c);}return res;}Graph getGraph(int n, int m, int offset = 1) {Graph res(n);for(int i = 0; i < m; ++i) {int a, b;cin >> a >> b;a -= offset, b -= offset;res[a].emplace_back(b);res[b].emplace_back(a);}return res;}template <typename T> WeightedGraph<T> getWeightedGraph(int n, int m, int offset = 1) {WeightedGraph<T> res(n);for(int i = 0; i < m; ++i) {int a, b;cin >> a >> b;T c;cin >> c;res[a].emplace_back(b, c);res[b].emplace_back(a, c);}}struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(15);}} setup_io;#pragma endregion// _________コーディングはここから!!___________template <typename T, typename E> struct LazySegmentTree {typedef function<T(T, T)> F;typedef function<T(T, E)> G;typedef function<E(E, E)> H;typedef function<E(E, int)> P;int n;F f;G g;H h;P p;T d1;E d0;vector<T> dat;vector<E> laz;LazySegmentTree(int n_, F _f, G _g, H _h, T _d1, E _d0, vector<T> v = vector<T>(), P _p = [](E a, int b) { return a; }): f(_f), g(_g), h(_h), d1(_d1), d0(_d0), p(_p) {init(n_);if(n_ == (int)v.size()) build(n_, v);}void init(int n_) {n = 1;while(n < n_) n *= 2;dat.clear();dat.resize(2 * n - 1, d1);laz.clear();laz.resize(2 * n - 1, d0);}void build(int n_, vector<T> v) {for(int i = 0; i < n_; i++) dat[i + n - 1] = v[i];for(int i = n - 2; i >= 0; i--) dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);}inline void eval(int len, int k) {if(laz[k] == d0) return;if(k * 2 + 1 < n * 2 - 1) {laz[k * 2 + 1] = h(laz[k * 2 + 1], laz[k]);laz[k * 2 + 2] = h(laz[k * 2 + 2], laz[k]);}dat[k] = g(dat[k], p(laz[k], len));laz[k] = d0;}T update(int a, int b, E x, int k, int l, int r) {eval(r - l, k);if(r <= a || b <= l) return dat[k];if(a <= l && r <= b) {laz[k] = h(laz[k], x);return g(dat[k], p(laz[k], r - l));}return dat[k] = f(update(a, b, x, k * 2 + 1, l, (l + r) / 2), update(a, b, x, k * 2 + 2, (l + r) / 2, r));}T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }T query(int a, int b, int k, int l, int r) {eval(r - l, k);if(r <= a || b <= l) return d1;if(a <= l && r <= b) return dat[k];T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);return f(vl, vr);}T query(int a, int b) { return query(a, b, 0, 0, n); }void print(int x) {rep(i, x) { cout << query(i, i + 1) << " "; }cout << endl;}};constexpr int N = 301000;//<モノイド,演算子> (要素数,モノイドの合成,モノイドと演算子,演算子と演算子,モノイドの単位元,演算子の単位元,(初期配列),演算子を上に持ってく)// 区間加算区間和// LazySegmentTree<ll, ll> seg(N, plus<ll>(), plus<ll>(), plus<ll>(), 0, 0, vecll(N), multiplies<ll>());main() {INT(n);VEC(ll, a, n);auto f = [](pll x, pll y) { return pll(x.fi + y.fi, x.se + y.se); };auto g = [](pll x, pll y) { return pll(x.fi + x.se * y.fi * 2 + y.fi * y.fi * y.se, x.se + y.fi * y.se); };auto h = [](pll x, pll y) { return pll(x.fi + y.fi, x.se); };auto p = [](pll x, int y) { return pll(x.fi, y); };vpll v(n);rep(i, n) v[i] = pll(a[i] * a[i], a[i]);LazySegmentTree<pll, pll> seg(n, f, g, h, pll(0, 0), pll(0, 0), v, p);INT(Q);while(Q--) {INT(id);if(id - 1) {INT(l, r);cout << seg.query(l - 1, r).fi << endl;} else {LL(l, r, x);seg.update(l - 1, r, pll(x, 1));}}}