結果
問題 | No.1290 Addition and Subtraction Operation |
ユーザー | Chanyuh |
提出日時 | 2020-12-31 15:16:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 139 ms / 2,000 ms |
コード長 | 7,447 bytes |
コンパイル時間 | 1,541 ms |
コンパイル使用メモリ | 137,360 KB |
実行使用メモリ | 23,240 KB |
最終ジャッジ日時 | 2024-04-17 20:52:05 |
合計ジャッジ時間 | 7,811 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
14,700 KB |
testcase_01 | AC | 5 ms
15,192 KB |
testcase_02 | AC | 5 ms
13,904 KB |
testcase_03 | AC | 6 ms
15,716 KB |
testcase_04 | AC | 5 ms
14,588 KB |
testcase_05 | AC | 5 ms
14,596 KB |
testcase_06 | AC | 5 ms
14,404 KB |
testcase_07 | AC | 5 ms
13,876 KB |
testcase_08 | AC | 6 ms
14,876 KB |
testcase_09 | AC | 5 ms
14,460 KB |
testcase_10 | AC | 5 ms
14,484 KB |
testcase_11 | AC | 5 ms
14,780 KB |
testcase_12 | AC | 5 ms
14,980 KB |
testcase_13 | AC | 6 ms
14,700 KB |
testcase_14 | AC | 4 ms
14,220 KB |
testcase_15 | AC | 6 ms
15,224 KB |
testcase_16 | AC | 5 ms
14,884 KB |
testcase_17 | AC | 5 ms
14,164 KB |
testcase_18 | AC | 5 ms
14,456 KB |
testcase_19 | AC | 5 ms
14,232 KB |
testcase_20 | AC | 5 ms
15,036 KB |
testcase_21 | AC | 5 ms
14,864 KB |
testcase_22 | AC | 5 ms
14,336 KB |
testcase_23 | AC | 5 ms
14,600 KB |
testcase_24 | AC | 5 ms
14,592 KB |
testcase_25 | AC | 5 ms
14,400 KB |
testcase_26 | AC | 6 ms
14,492 KB |
testcase_27 | AC | 6 ms
15,224 KB |
testcase_28 | AC | 5 ms
14,928 KB |
testcase_29 | AC | 6 ms
13,952 KB |
testcase_30 | AC | 5 ms
15,152 KB |
testcase_31 | AC | 4 ms
14,164 KB |
testcase_32 | AC | 4 ms
14,736 KB |
testcase_33 | AC | 5 ms
15,600 KB |
testcase_34 | AC | 5 ms
15,268 KB |
testcase_35 | AC | 5 ms
14,168 KB |
testcase_36 | AC | 5 ms
14,352 KB |
testcase_37 | AC | 6 ms
15,768 KB |
testcase_38 | AC | 5 ms
14,864 KB |
testcase_39 | AC | 5 ms
14,292 KB |
testcase_40 | AC | 5 ms
14,352 KB |
testcase_41 | AC | 4 ms
14,168 KB |
testcase_42 | AC | 35 ms
19,236 KB |
testcase_43 | AC | 36 ms
18,736 KB |
testcase_44 | AC | 36 ms
18,612 KB |
testcase_45 | AC | 37 ms
19,004 KB |
testcase_46 | AC | 36 ms
19,988 KB |
testcase_47 | AC | 37 ms
19,020 KB |
testcase_48 | AC | 36 ms
19,728 KB |
testcase_49 | AC | 37 ms
19,032 KB |
testcase_50 | AC | 37 ms
18,952 KB |
testcase_51 | AC | 36 ms
19,276 KB |
testcase_52 | AC | 38 ms
19,240 KB |
testcase_53 | AC | 38 ms
20,304 KB |
testcase_54 | AC | 39 ms
19,464 KB |
testcase_55 | AC | 37 ms
19,000 KB |
testcase_56 | AC | 39 ms
18,948 KB |
testcase_57 | AC | 48 ms
19,508 KB |
testcase_58 | AC | 69 ms
20,536 KB |
testcase_59 | AC | 45 ms
19,544 KB |
testcase_60 | AC | 137 ms
23,080 KB |
testcase_61 | AC | 105 ms
21,780 KB |
testcase_62 | AC | 115 ms
22,072 KB |
testcase_63 | AC | 62 ms
20,164 KB |
testcase_64 | AC | 18 ms
18,296 KB |
testcase_65 | AC | 35 ms
19,096 KB |
testcase_66 | AC | 83 ms
21,124 KB |
testcase_67 | AC | 136 ms
23,240 KB |
testcase_68 | AC | 104 ms
21,912 KB |
testcase_69 | AC | 64 ms
20,676 KB |
testcase_70 | AC | 55 ms
19,948 KB |
testcase_71 | AC | 78 ms
21,268 KB |
testcase_72 | AC | 34 ms
18,760 KB |
testcase_73 | AC | 90 ms
21,316 KB |
testcase_74 | AC | 17 ms
18,324 KB |
testcase_75 | AC | 26 ms
19,016 KB |
testcase_76 | AC | 57 ms
20,196 KB |
testcase_77 | AC | 114 ms
22,552 KB |
testcase_78 | AC | 103 ms
21,104 KB |
testcase_79 | AC | 62 ms
19,996 KB |
testcase_80 | AC | 139 ms
22,740 KB |
testcase_81 | AC | 132 ms
22,780 KB |
testcase_82 | AC | 77 ms
20,980 KB |
testcase_83 | AC | 126 ms
22,400 KB |
testcase_84 | AC | 112 ms
22,928 KB |
testcase_85 | AC | 39 ms
18,876 KB |
testcase_86 | AC | 24 ms
18,512 KB |
ソースコード
#include<iostream> #include<array> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<complex> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<tuple> #include<cassert> using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair<int, int> P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define Per(i,sta,n) for(int i=n-1;i>=sta;i--) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair<ll, ll> LP; int dx[4]={1,-1,0,0}; int dy[4]={0,0,1,-1}; template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;} template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()> struct LazySegmentTree {// (*composition)は前が新たな作用素 public: LazySegmentTree() : LazySegmentTree(0) {} LazySegmentTree(int n) : LazySegmentTree(std::vector<S>(n, e())) {} LazySegmentTree(const std::vector<S>& v) : _n(int(v.size())) { log = ceil_pow2(_n); size = 1 << log; d = std::vector<S>(2 * size, e()); lz = std::vector<F>(size, id()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update_(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = x; for (int i = 1; i <= log; i++) update_(p >> i); } S get(int p) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); return d[p]; } S query(int l, int r) { assert(0 <= l && l <= r && r <= _n); if (l == r) return e(); l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push(r >> i); } S sml = e(), smr = e(); while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_query() { return d[1]; } void update(int p, F f) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = mapping(f, d[p]); for (int i = 1; i <= log; i++) update_(p >> i); } void update(int l, int r, F f) { assert(0 <= l && l <= r && r <= _n); if (l == r) return; l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } { int l2 = l, r2 = r; while (l < r) { if (l & 1) all_apply(l++, f); if (r & 1) all_apply(--r, f); l >>= 1; r >>= 1; } l = l2; r = r2; } for (int i = 1; i <= log; i++) { if (((l >> i) << i) != l) update_(l >> i); if (((r >> i) << i) != r) update_((r - 1) >> i); } } template <bool (*g)(S)> int max_right(int l) { return max_right(l, [](S x) { return g(x); }); } template <class G> int max_right(int l, G g) { assert(0 <= l && l <= _n); assert(g(e())); if (l == _n) return _n; l += size; for (int i = log; i >= 1; i--) push(l >> i); S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!g(op(sm, d[l]))) { while (l < size) { push(l); l = (2 * l); if (g(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template <bool (*g)(S)> int min_left(int r) { return min_left(r, [](S x) { return g(x); }); } template <class G> int min_left(int r, G g) { assert(0 <= r && r <= _n); assert(g(e())); if (r == 0) return 0; r += size; for (int i = log; i >= 1; i--) push((r - 1) >> i); S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!g(op(d[r], sm))) { while (r < size) { push(r); r = (2 * r + 1); if (g(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } private: int _n, size, log; std::vector<S> d; std::vector<F> lz; void update_(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } void all_apply(int k, F f) { d[k] = mapping(f, d[k]); if (k < size) lz[k] = composition(f, lz[k]); } void push(int k) { all_apply(2 * k, lz[k]); all_apply(2 * k + 1, lz[k]); lz[k] = id(); } int ceil_pow2(int n) { int x = 0; while ((1U << x) < (unsigned int)(n)) x++; return x; } }; int n,m; ll b[200010];int l[200010],r[200010]; set<int> se[200010]; ll f(ll a,ll b){return min(a,b);} ll e(){return 0;} ll g(ll a,ll b){return a+b;} ll id(){return 0;} void solve(){ cin >> n >> m; rep(i,n) cin >> b[i]; rep(i,m){ cin >> l[i] >> r[i]; l[i]-=1; se[l[i]].insert(r[i]); } LazySegmentTree<ll,f,e,ll,g,g,id> segs[2]={LazySegmentTree<ll,f,e,ll,g,g,id>(n-n/2),LazySegmentTree<ll,f,e,ll,g,g,id>(n/2)}; rep(i,n){ if(!se[i].empty()) { int r=*se[i].begin(); int z=b[i]-segs[i%2].get(i/2); if(i%2==r%2){ segs[i%2].update(i/2,r/2,z); segs[1-i%2].update((i+1)/2,(r+1)/2,-z); } else{ segs[i%2].update(i/2,(r+1)/2,z); segs[1-i%2].update((i+1)/2,r/2,-z); } se[i].erase(se[i].begin()); if(se[i].size()>se[r].size()) swap(se[i],se[r]); for(int t:se[i]){ se[r].insert(t); } } // rep(i,n){ // cout << segs[i%2].get(i/2) << " "; // } // cout << "" << endl; } rep(i,n){ if(segs[i%2].get(i/2)!=b[i]){ cout << "NO" << endl; return; } } cout << "YES" << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); }