oj.uz

Submission #46641

# Submission time Handle Problem Language Result Execution time Memory
46641 2018-04-22T12:39:43 Z golub Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 163 ms 7592 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("unroll-all-loops")

#include <bits/stdc++.h>

//#define TASK "lca"

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
#define int long long
#define pii pair<int, int>

typedef long long ll;
//typedef long double ld;

using namespace std;

const int INF = 1e18;
const int MAXN = 1e8;
const int MOD = 1e9 + 7;
const double EPS = 1e-12;

//char buf[(int)1e9];
//size_t p_ = 0;
//
//inline void *operator new(size_t n_) {
//    p_ += n_;
//    return buf + p_ - n_;
//}
//inline void operator delete(void*) {};

ll power(ll x, ll n, ll mod = 1e9 + 7) {
    if (n == 0) return 1ll;
    if (n & 1ll) return power(x, n - 1ll, mod) * x % mod;
    ll tmp = power(x, n >> 1ll, mod);
    return (tmp * tmp) % mod;
}

ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd (b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

signed main() {
#ifndef LOCAL
#ifdef TASK
    freopen(TASK".in", "r", stdin);
    freopen(TASK".out", "w", stdout);
#endif
#endif
#ifdef LOCAL
    //freopen("/Users/alekseygolub/Desktop/с++/ABS/ABS/input.txt", "r", stdin);
#endif
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(924653523);
    // == SOLUTION == //
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    vector<int> a(n + 1);
    for (int i = 0; i < n + 1; i++) {
        cin >> a[i];
    }
    vector<int> d(n);
    int ans = 0;
    for (int i = 0; i < n; i++) {
        d[i] = a[i + 1] - a[i];
        if (d[i] > 0) ans -= s * d[i];
        if (d[i] <= 0) ans += abs(t * d[i]);
    }
    //cout << ans << '\n';
    for (int i = 0; i < q; i++) {
        int l, r, x;
        cin >> l >> r >> x;
        l--; r;
        if (l >= 0) {
            if (d[l] > 0) {
                ans += s * d[l];
            } else {
                ans -= abs(t * d[l]);
            }
            d[l] += x;
            if (d[l] > 0) ans -= s * d[l];
            if (d[l] <= 0) ans += abs(t * d[l]);
        }
        if (r < n) {
            if (d[r] > 0) {
                ans += s * d[r];
            } else {
                ans -= abs(t * d[r]);
            }
            d[r] -= x;
            if (d[r] > 0) ans -= s * d[r];
            if (d[r] <= 0) ans += abs(t * d[r]);
        }
//        for (auto aa: d) cout << aa << " ";
//        cout << "\n";
        cout << ans << "\n";
    }
    
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:85:15: warning: statement has no effect [-Wunused-value]
         l--; r;
               ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 5260 KB Output is correct
2 Correct 163 ms 5804 KB Output is correct
3 Correct 143 ms 6356 KB Output is correct
4 Correct 132 ms 6356 KB Output is correct
5 Correct 142 ms 6356 KB Output is correct
6 Correct 110 ms 6716 KB Output is correct
7 Correct 115 ms 6716 KB Output is correct
8 Correct 140 ms 6716 KB Output is correct
9 Correct 146 ms 7052 KB Output is correct
10 Correct 136 ms 7052 KB Output is correct
11 Correct 109 ms 7052 KB Output is correct
12 Correct 115 ms 7148 KB Output is correct
13 Correct 111 ms 7500 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 4 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 3 ms 728 KB Output is correct
6 Correct 3 ms 728 KB Output is correct
7 Correct 3 ms 728 KB Output is correct
8 Correct 3 ms 728 KB Output is correct
9 Correct 3 ms 728 KB Output is correct
10 Correct 3 ms 728 KB Output is correct
11 Correct 3 ms 752 KB Output is correct
12 Correct 3 ms 812 KB Output is correct
13 Correct 3 ms 812 KB Output is correct
14 Correct 4 ms 812 KB Output is correct
15 Correct 3 ms 812 KB Output is correct
16 Correct 4 ms 812 KB Output is correct
17 Correct 3 ms 812 KB Output is correct
18 Correct 3 ms 812 KB Output is correct
19 Correct 2 ms 812 KB Output is correct
20 Correct 2 ms 812 KB Output is correct
21 Correct 2 ms 812 KB Output is correct
22 Correct 139 ms 5260 KB Output is correct
23 Correct 163 ms 5804 KB Output is correct
24 Correct 143 ms 6356 KB Output is correct
25 Correct 132 ms 6356 KB Output is correct
26 Correct 142 ms 6356 KB Output is correct
27 Correct 110 ms 6716 KB Output is correct
28 Correct 115 ms 6716 KB Output is correct
29 Correct 140 ms 6716 KB Output is correct
30 Correct 146 ms 7052 KB Output is correct
31 Correct 136 ms 7052 KB Output is correct
32 Correct 109 ms 7052 KB Output is correct
33 Correct 115 ms 7148 KB Output is correct
34 Correct 111 ms 7500 KB Output is correct
35 Correct 132 ms 7500 KB Output is correct
36 Correct 143 ms 7500 KB Output is correct
37 Correct 143 ms 7592 KB Output is correct
38 Correct 140 ms 7592 KB Output is correct
39 Correct 146 ms 7592 KB Output is correct
40 Correct 142 ms 7592 KB Output is correct
41 Correct 142 ms 7592 KB Output is correct
42 Correct 144 ms 7592 KB Output is correct
43 Correct 142 ms 7592 KB Output is correct
44 Correct 142 ms 7592 KB Output is correct
45 Correct 132 ms 7592 KB Output is correct
46 Correct 137 ms 7592 KB Output is correct
47 Correct 114 ms 7592 KB Output is correct
48 Correct 118 ms 7592 KB Output is correct
49 Correct 118 ms 7592 KB Output is correct
50 Correct 108 ms 7592 KB Output is correct
51 Correct 112 ms 7592 KB Output is correct
52 Correct 117 ms 7592 KB Output is correct