結果
問題 | No.1290 Addition and Subtraction Operation |
ユーザー | tokusakurai |
提出日時 | 2020-11-13 23:07:48 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 118 ms / 2,000 ms |
コード長 | 6,082 bytes |
コンパイル時間 | 2,521 ms |
コンパイル使用メモリ | 209,868 KB |
最終ジャッジ日時 | 2025-01-15 23:52:53 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 85 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; #define pq(type, name) priority_queue<type> name #define iq(type, name) priority_queue<type, vector<type>, greater<type>> name const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; const double pi = acos(-1.0); const double EPS = 1e-10; template<typename T> bool chmax(T &x, const T &y){ if(x < y) {x = y; return true;} return false; } template<typename T> bool chmin(T &x, const T &y){ if(x > y) {x = y; return true;} return false; } void in() {} template<typename Head, typename ...Tail> void in(Head &&head, Tail &&...tail){ cin >> head; in(forward<Tail>(tail)...); } void out() {cout << '\n';} template<typename Head, typename ...Tail> void out(Head &&head, Tail &&...tail){ cout << head << ' '; out(forward<Tail>(tail)...); } void outn() {} template<typename Head, typename ...Tail> void outn(Head &&head, Tail &&...tail){ cout << head << '\n'; outn(forward<Tail>(tail)...); } template<typename T, typename U> void in(pair<T, U> &p){ cin >> p.first >> p.second; } template<typename T, typename U> void out(pair<T, U> p){ cout << p.first << ' ' << p.second << '\n'; } using vi = vector<int>; using vll = vector<ll>; #define vec1(type, name, ...) vector<type> name(__VA_ARGS__) #define VEC1(type, ...) vector<type>(__VA_ARGS__) #define vec2(type, name, a, ...) vector<vector<type>> name(a, VEC1(type, __VA_ARGS__)) #define VEC2(type, a, ...) vector<vector<type>>(a, VEC1(type, __VA_ARGS__)) #define vec3(type, name, a, b, ...) vector<vector<vector<type>>> name(a, VEC2(type, b, __VA_ARGS__)) #define VEC3(type, a, b, ...) vector<vector<vector<type>>>(a, VEC2(type, b, __VA_ARGS__)) #define vec4(type, name, a, b, c, ...) vector<vector<vector<vector<type>>>> name(a, VEC3(type, b, c, __VA_ARGS__)) #define VEC4(type, a, b, c, ...) vector<vector<vector<vector<type>>>>(a, VEC3(type, b, c, __VA_ARGS__)) #define vec5(type, name, a, b, c, d, ...) vector<vector<vector<vector<vector<type>>>>> name(a, VEC4(type, b, c, d, __VA_ARGS__)) #define VEC5(type, a, b, c, d, ...) vector<vector<vector<vector<vector<type>>>>>(a, VEC4(type, b, c, d, __VA_ARGS__)) template<typename T> void vin(vector<T> &a){ rep(i, sz(a)) cin >> a[i]; } template<typename T> void vout(const vector<T> &a){ for(auto &e: a) cout << e << ' '; cout << '\n'; } template<typename T> void voutn(const vector<T> &a){ for(auto &e: a) cout << e << '\n'; } template<typename T> void unique(vector<T> &a){ sort(all(a)), a.erase(unique(all(a)), a.end()); } vector<int> iota(int n){ vector<int> ret(n); iota(all(ret), 0); return ret; } template<typename T> vector<int> iota(const vector<T> &a, bool greater = false){ vector<int> ret = iota(sz(a)); sort(all(ret), [&](int i, int j){ return (a[i] < a[j])^greater; }); return ret; } struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; #define VEC(type, name, n) vector<type> name(n); vin(name) #define INT(...) int __VA_ARGS__; in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__; in(__VA_ARGS__) #define CHAR(...) char __VA_ARGS__; in(__VA_ARGS__) #define STR(...) string __VA_ARGS__; in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; in(__VA_ARGS__) const int MOD = 1000000007; //const int MOD = 998244353; template<typename T, typename Operator_Monoid> struct Dual_Segment_Tree{ using G = function<T(T, Operator_Monoid)>; using H = function<Operator_Monoid(Operator_Monoid, Operator_Monoid)>; int n, height; vector<T> seg; vector<Operator_Monoid> lazy; const G g; const H h; const Operator_Monoid e2; Dual_Segment_Tree(const vector<T> &v, const G &g, const H &h, const Operator_Monoid &e2) : g(g), h(h), e2(e2){ int m = sz(v); n = 1, height = 0; while(n < m) n <<= 1, height++; lazy.assign(2*n, e2); seg = v; } inline void eval(int i){ if(i < n && lazy[i] != e2){ lazy[2*i] = h(lazy[2*i], lazy[i]); lazy[2*i+1] = h(lazy[2*i+1], lazy[i]); lazy[i] = e2; } } inline void thrust(int i){ for(int j = height; j > 0; j--) eval(i>>j); } void apply(int l, int r, const Operator_Monoid &x){ if(l >= r) return; l += n, r += n; thrust(l), thrust(r-1); while(l < r){ if(l&1) lazy[l] = h(lazy[l], x), l++; if(r&1) r--, lazy[r] = h(lazy[r], x); l >>= 1, r >>= 1; } } T get(int i){ thrust(i+n); return g(seg[i], lazy[i+n]); } T operator [] (int i) {return get(i);} }; int main(){ INT(N, M); VEC(ll, B, N); vector<int> rs[N]; rep(i, M){ INT(L, R); L--; rs[L].eb(R); } auto g = [](ll a, ll b) {return a+b;}; Dual_Segment_Tree<ll, ll> seg1(vector<ll>(N, 0), g, g, 0), seg2(vector<ll>(N, 0), g, g, 0); rep(i, N){ if(rs[i].empty()){ ll x = (i&1? seg2 : seg1)[i]; if(x != B[i]) out("NO"), exit(0); } else{ unique(rs[i]); int n = sz(rs[i]); rep(j, n-1){ int l = rs[i][j], r = rs[i][j+1]; rs[l].pb(r); } ll x = B[i]-(i&1? seg2 : seg1)[i]; if(i&1){ seg2.apply(i, rs[i][0], x); seg1.apply(i, rs[i][0], -x); } else{ seg1.apply(i, rs[i][0], x); seg2.apply(i, rs[i][0], -x); } } } out("YES"); }