oj.uz

Submission #361985

# Submission time Handle Problem Language Result Execution time Memory
361985 2021-02-01T14:03:13 Z Olerinskiy Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 173 ms 8812 KB 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert> 
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>
#include <limits>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template<typename T> ostream& operator<< (ostream& out, const vector<T>& a) {
    for (auto k : a) out << k << " ";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << endl;
    const long long INF = 1e18;
    // const long long mod = 2600000069;
    // const long long p = 10;
#else
    #define dbg(x) 57
    const long long INF = 1e18;
    // const long long mod = 2600000069;  
    // const long long p = 179;
#endif

const ld PI = 4 * atan(1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 2e5 + 10;

int n, q, s, t;
int a[N];

int f[N];

void add(int pos, int x) {
    pos++;
    for (; pos <= n; pos += pos & -pos) {
        f[pos] += x;
    }
}

int ask(int l) {
    l++;
    int ans = 0;
    for (; l > 0; l -= l & -l) {
        ans += f[l];
    }
    return ans;
}

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

int d(int a, int b) {
    if (a < b) return (a - b) * s;
    return (a - b) * t;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> q >> s >> t;
    n++;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int ans = 0;
    for (int i = 1; i < n; i++) {
        ans += d(a[i - 1], a[i]);
        add(i, a[i] - a[i - 1]);
    }
    while (q--) {
        int l, r, x;
        cin >> l >> r >> x;
        if (l > 0) {
            ans -= d(ask(l - 1), ask(l));
        }
        if (r < n - 1) {
            ans -= d(ask(r), ask(r + 1));
        }
        add(l, x);
        add(r + 1, -x);
        if (l > 0) {
            ans += d(ask(l - 1), ask(l));
        }
        if (r < n - 1) {
            ans += d(ask(r), ask(r + 1));
        }
        cout << ans << "\n";
    }
}
/*
3 5 1 2 
0 4 1 8 
1 2 2 
1 1 -2 
2 3 5 
1 2 -1 
1 3 5

2 2 5 5 
0 6 -1 
1 1 4 
1 2 8
*/

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 6508 KB Output is correct
2 Correct 156 ms 7148 KB Output is correct
3 Correct 160 ms 7660 KB Output is correct
4 Correct 147 ms 6892 KB Output is correct
5 Correct 160 ms 7660 KB Output is correct
6 Correct 113 ms 8044 KB Output is correct
7 Correct 112 ms 7916 KB Output is correct
8 Correct 142 ms 7916 KB Output is correct
9 Correct 166 ms 8236 KB Output is correct
10 Correct 172 ms 7020 KB Output is correct
11 Correct 116 ms 8044 KB Output is correct
12 Correct 117 ms 8452 KB Output is correct
13 Correct 114 ms 8812 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 155 ms 6508 KB Output is correct
23 Correct 156 ms 7148 KB Output is correct
24 Correct 160 ms 7660 KB Output is correct
25 Correct 147 ms 6892 KB Output is correct
26 Correct 160 ms 7660 KB Output is correct
27 Correct 113 ms 8044 KB Output is correct
28 Correct 112 ms 7916 KB Output is correct
29 Correct 142 ms 7916 KB Output is correct
30 Correct 166 ms 8236 KB Output is correct
31 Correct 172 ms 7020 KB Output is correct
32 Correct 116 ms 8044 KB Output is correct
33 Correct 117 ms 8452 KB Output is correct
34 Correct 114 ms 8812 KB Output is correct
35 Correct 155 ms 6508 KB Output is correct
36 Correct 160 ms 7916 KB Output is correct
37 Correct 168 ms 8684 KB Output is correct
38 Correct 162 ms 8684 KB Output is correct
39 Correct 173 ms 8608 KB Output is correct
40 Correct 158 ms 8556 KB Output is correct
41 Correct 168 ms 8428 KB Output is correct
42 Correct 158 ms 8556 KB Output is correct
43 Correct 153 ms 7532 KB Output is correct
44 Correct 157 ms 8044 KB Output is correct
45 Correct 159 ms 7788 KB Output is correct
46 Correct 157 ms 8428 KB Output is correct
47 Correct 124 ms 8300 KB Output is correct
48 Correct 125 ms 8572 KB Output is correct
49 Correct 152 ms 7532 KB Output is correct
50 Correct 116 ms 8172 KB Output is correct
51 Correct 118 ms 8428 KB Output is correct
52 Correct 116 ms 8044 KB Output is correct