oj.uz

Submission #237839

# Submission time Handle Problem Language Result Execution time Memory
237839 2020-06-09T01:39:24 Z wiwiho Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 392 ms 16504 KB 
//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a + b - 1) / b)
#define tomax(a, b) (a = max(a, b))
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

//#define TEST

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

int lowbit(int x){
    return x & -x;
}

struct BIT{

    vector<ll> bit;

    explicit BIT(int sz = 0){
        bit.resize(sz + 2);
    }

    void modify(int x, ll v){
        for(; x < bit.size(); x += lowbit(x)){
            bit[x] += v;
        }
    }

    ll query(int x){
        ll ans = 0;
        for(; x > 0; x -= lowbit(x)){
            ans += bit[x];
        }
        return ans;
    }

    ll query(int l, int r){
        return query(r) - query(l - 1);
    }

};

struct RUBIT{

    BIT bit1;
    BIT bit2;

    explicit RUBIT(int sz){
        bit1 = BIT(sz + 1);
        bit2 = BIT(sz + 1);
    }

    void modify(int l, int r, ll v){
        bit1.modify(l, v);
        bit1.modify(r + 1, -v);
        bit2.modify(l, l * v);
        bit2.modify(r + 1, -(r + 1) * v);
    }

    ll query(int x){
        return (x + 1) * bit1.query(x) - bit2.query(x);
    }

    ll query(int l, int r){
        return query(r) - query(l - 1);
    }

};

int main(){
    StarBurstStream

    int n, q, s, t;
    cin >> n >> q >> s >> t;

    RUBIT alt(n);
    BIT dec(n), inc(n);

    for(int i = 0; i <= n; i++){
        int a;
        cin >> a;
        if(i != 0) alt.modify(i, i, a);
    }

    for(int i = 1; i <= n; i++){
        if(alt.query(i - 1, i - 1) < alt.query(i, i)){
            dec.modify(i, alt.query(i, i) - alt.query(i - 1, i - 1));
        }
        else{
            inc.modify(i, alt.query(i, i) - alt.query(i - 1, i - 1));
        }
    }

    while(q--){

        int l, r, x;
        cin >> l >> r >> x;

        if(alt.query(l - 1, l - 1) < alt.query(l, l)) dec.modify(l, -(alt.query(l, l) - alt.query(l - 1, l - 1)));
        else inc.modify(l, -(alt.query(l, l) - alt.query(l - 1, l - 1)));
        if(alt.query(r, r) < alt.query(r + 1, r + 1)) dec.modify(r + 1, -(alt.query(r + 1, r + 1) - alt.query(r, r)));
        else inc.modify(r + 1, -(alt.query(r + 1, r + 1) - alt.query(r, r)));

        alt.modify(l, r, x);
        if(alt.query(l - 1, l - 1) < alt.query(l, l)) dec.modify(l, (alt.query(l, l) - alt.query(l - 1, l - 1)));
        else inc.modify(l, (alt.query(l, l) - alt.query(l - 1, l - 1)));
        if(alt.query(r, r) < alt.query(r + 1, r + 1)) dec.modify(r + 1, (alt.query(r + 1, r + 1) - alt.query(r, r)));
        else inc.modify(r + 1, (alt.query(r + 1, r + 1) - alt.query(r, r)));

//        for(int i = 0; i <= n; i++) cerr << alt.query(i, i) << " ";
//        cerr << "\n";
//        for(int i = 0; i <= n; i++) cerr << dec.query(i, i) << " ";
//        cerr << "\n";
//        for(int i = 0; i <= n; i++) cerr << inc.query(i, i) << " ";
//        cerr << "\n";

        cout << -dec.query(n) * s - inc.query(n) * t << "\n";

    }

    return 0;
}

Compilation message

foehn_phenomena.cpp: In member function 'void BIT::modify(int, ll)':
foehn_phenomena.cpp:65:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(; x < bit.size(); x += lowbit(x)){
               ~~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 7 ms 512 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 640 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 13536 KB Output is correct
2 Correct 351 ms 14176 KB Output is correct
3 Correct 359 ms 14712 KB Output is correct
4 Correct 339 ms 14200 KB Output is correct
5 Correct 367 ms 15440 KB Output is correct
6 Correct 254 ms 14200 KB Output is correct
7 Correct 233 ms 14456 KB Output is correct
8 Correct 392 ms 15108 KB Output is correct
9 Correct 362 ms 15452 KB Output is correct
10 Correct 313 ms 14072 KB Output is correct
11 Correct 209 ms 14072 KB Output is correct
12 Correct 230 ms 14840 KB Output is correct
13 Correct 239 ms 15096 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 7 ms 512 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 640 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 344 ms 13536 KB Output is correct
23 Correct 351 ms 14176 KB Output is correct
24 Correct 359 ms 14712 KB Output is correct
25 Correct 339 ms 14200 KB Output is correct
26 Correct 367 ms 15440 KB Output is correct
27 Correct 254 ms 14200 KB Output is correct
28 Correct 233 ms 14456 KB Output is correct
29 Correct 392 ms 15108 KB Output is correct
30 Correct 362 ms 15452 KB Output is correct
31 Correct 313 ms 14072 KB Output is correct
32 Correct 209 ms 14072 KB Output is correct
33 Correct 230 ms 14840 KB Output is correct
34 Correct 239 ms 15096 KB Output is correct
35 Correct 350 ms 13560 KB Output is correct
36 Correct 361 ms 15228 KB Output is correct
37 Correct 367 ms 15864 KB Output is correct
38 Correct 359 ms 15608 KB Output is correct
39 Correct 364 ms 15868 KB Output is correct
40 Correct 391 ms 15736 KB Output is correct
41 Correct 385 ms 15564 KB Output is correct
42 Correct 361 ms 15736 KB Output is correct
43 Correct 360 ms 14840 KB Output is correct
44 Correct 357 ms 15224 KB Output is correct
45 Correct 344 ms 15432 KB Output is correct
46 Correct 355 ms 16504 KB Output is correct
47 Correct 237 ms 15004 KB Output is correct
48 Correct 249 ms 14840 KB Output is correct
49 Correct 322 ms 13944 KB Output is correct
50 Correct 222 ms 14712 KB Output is correct
51 Correct 247 ms 15224 KB Output is correct
52 Correct 222 ms 14840 KB Output is correct