oj.uz

Submission #531729

# Submission time Handle Problem Language Result Execution time Memory
531729 2022-03-01T10:43:10 Z Danilo21 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 103 ms 11512 KB 
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) __builtin_popcountll(a)
#define bithigh(a) 63-__builtin_clzll(a)
#define lg bithigh
ll highpow(ll a) { return 1LL << (ll)lg(a); }

using namespace std;

const ll LINF = 4e18;
const int mxN = 2e5+10, INF = 2e9, mod = (1 ? 1e9+7 : 998244353);
ll n, m, ans, a[mxN];
array<ll, 2> T;

int sig(ll x) { return (x < 0 ? -1 : 1); }

void update(int i, ll x){

    if (i == n) return;
    ans += (-a[i]) * (a[i] < 0 ? T[0] : T[1]);
    ans += (a[i] + x) * (a[i] + x < 0 ? T[0] : T[1]);
    a[i] += x;
}

void Solve(){

    cin >> n >> m >> T[0] >> T[1];
    for (int i = 0; i < n+1; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++)
        a[i] = a[i] - a[i+1];
    for (int i = 0; i < n; i++)
        ans += (a[i] < 0 ? T[0] : T[1]) * a[i];
    while (m--){
        ri(l); ri(r); rl(x);
        update(l-1, -x);
        update(r, x);
        cout << ans << en;
    }
}

int main(){

    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0); cerr.tie(0);
    cout << setprecision(12) << fixed;
    cerr << setprecision(12) << fixed;
    cerr << "Started!" << endl;

    int t = 1;
    //cin >> t;
    while (t--)
        Solve();

    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'long long int highpow(long long int)':
foehn_phenomena.cpp:26:22: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   26 | #define bithigh(a) 63-__builtin_clzll(a)
      |                      ^
foehn_phenomena.cpp:27:12: note: in expansion of macro 'bithigh'
   27 | #define lg bithigh
      |            ^~~~~~~
foehn_phenomena.cpp:28:38: note: in expansion of macro 'lg'
   28 | ll highpow(ll a) { return 1LL << (ll)lg(a); }
      |                                      ^~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8600 KB Output is correct
2 Correct 91 ms 9308 KB Output is correct
3 Correct 91 ms 9972 KB Output is correct
4 Correct 83 ms 9200 KB Output is correct
5 Correct 93 ms 10440 KB Output is correct
6 Correct 80 ms 9440 KB Output is correct
7 Correct 79 ms 9360 KB Output is correct
8 Correct 88 ms 10260 KB Output is correct
9 Correct 94 ms 10556 KB Output is correct
10 Correct 99 ms 9380 KB Output is correct
11 Correct 75 ms 9264 KB Output is correct
12 Correct 82 ms 10052 KB Output is correct
13 Correct 78 ms 10312 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 90 ms 8600 KB Output is correct
23 Correct 91 ms 9308 KB Output is correct
24 Correct 91 ms 9972 KB Output is correct
25 Correct 83 ms 9200 KB Output is correct
26 Correct 93 ms 10440 KB Output is correct
27 Correct 80 ms 9440 KB Output is correct
28 Correct 79 ms 9360 KB Output is correct
29 Correct 88 ms 10260 KB Output is correct
30 Correct 94 ms 10556 KB Output is correct
31 Correct 99 ms 9380 KB Output is correct
32 Correct 75 ms 9264 KB Output is correct
33 Correct 82 ms 10052 KB Output is correct
34 Correct 78 ms 10312 KB Output is correct
35 Correct 99 ms 8844 KB Output is correct
36 Correct 92 ms 10200 KB Output is correct
37 Correct 98 ms 11080 KB Output is correct
38 Correct 91 ms 10840 KB Output is correct
39 Correct 99 ms 10844 KB Output is correct
40 Correct 89 ms 10820 KB Output is correct
41 Correct 94 ms 10692 KB Output is correct
42 Correct 103 ms 10820 KB Output is correct
43 Correct 92 ms 10052 KB Output is correct
44 Correct 90 ms 10408 KB Output is correct
45 Correct 99 ms 10528 KB Output is correct
46 Correct 91 ms 11512 KB Output is correct
47 Correct 86 ms 10176 KB Output is correct
48 Correct 78 ms 10048 KB Output is correct
49 Correct 85 ms 9092 KB Output is correct
50 Correct 76 ms 9936 KB Output is correct
51 Correct 87 ms 10280 KB Output is correct
52 Correct 78 ms 10124 KB Output is correct