oj.uz

Submission #394233

# Submission time Handle Problem Language Result Execution time Memory
394233 2021-04-26T07:58:28 Z Aryan_Raina Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 188 ms 11488 KB 
#include <bits/stdc++.h>
using namespace std; 

#define int long long
#define ld long double
#define ar array
 
const int INF = 1e17;
const int MOD = 998244353;

struct FenwickTree {
    vector<int> s; int res;
    FenwickTree(int n) : s(n) {}
    void modify(int pos, int dif) {
        for(; pos < s.size(); pos|=pos+1) s[pos] += dif;
    }
    int calc(int pos) {
        for(res = 0; pos > 0; pos&=pos-1) res += s[pos-1]; 
        return res;
    }
};

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie();
    int n, q, s, t; cin>>n>>q>>s>>t;
    FenwickTree bit(n+1);
    for (int i = 0, pre = 0, a; i <= n; i++) {
        cin>>a; bit.modify(i, a - pre);
        pre = a;
    }
    int res = 0;
    auto update = [&](int i, int mult) {
        if (i+1 > n) return;
        int dif = bit.calc(i+1) - bit.calc(i+2);
        if (dif < 0) res += mult*s*dif;
        else res += mult*t*dif;
    };
    for (int i = 0; i <= n; i++) update(i, 1);
    while (q--) {
        int l, r, x; cin>>l>>r>>x;
        update(l-1, -1);
        update(r, -1);
        bit.modify(l, x);
        bit.modify(r+1, -x);
        update(l-1, 1);
        update(r, 1);
        cout<<res<<"\n";
    }
}

Compilation message

foehn_phenomena.cpp: In member function 'void FenwickTree::modify(long long int, long long int)':
foehn_phenomena.cpp:15:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for(; pos < s.size(); pos|=pos+1) s[pos] += dif;
      |               ~~~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 8724 KB Output is correct
2 Correct 157 ms 9284 KB Output is correct
3 Correct 159 ms 9924 KB Output is correct
4 Correct 158 ms 9296 KB Output is correct
5 Correct 188 ms 10436 KB Output is correct
6 Correct 115 ms 9424 KB Output is correct
7 Correct 150 ms 9432 KB Output is correct
8 Correct 150 ms 10216 KB Output is correct
9 Correct 159 ms 10576 KB Output is correct
10 Correct 159 ms 9312 KB Output is correct
11 Correct 135 ms 9388 KB Output is correct
12 Correct 129 ms 10052 KB Output is correct
13 Correct 126 ms 10320 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 324 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 328 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 154 ms 8724 KB Output is correct
23 Correct 157 ms 9284 KB Output is correct
24 Correct 159 ms 9924 KB Output is correct
25 Correct 158 ms 9296 KB Output is correct
26 Correct 188 ms 10436 KB Output is correct
27 Correct 115 ms 9424 KB Output is correct
28 Correct 150 ms 9432 KB Output is correct
29 Correct 150 ms 10216 KB Output is correct
30 Correct 159 ms 10576 KB Output is correct
31 Correct 159 ms 9312 KB Output is correct
32 Correct 135 ms 9388 KB Output is correct
33 Correct 129 ms 10052 KB Output is correct
34 Correct 126 ms 10320 KB Output is correct
35 Correct 165 ms 8884 KB Output is correct
36 Correct 173 ms 10200 KB Output is correct
37 Correct 168 ms 11060 KB Output is correct
38 Correct 166 ms 10864 KB Output is correct
39 Correct 158 ms 10916 KB Output is correct
40 Correct 176 ms 10816 KB Output is correct
41 Correct 157 ms 10684 KB Output is correct
42 Correct 159 ms 10820 KB Output is correct
43 Correct 160 ms 10052 KB Output is correct
44 Correct 157 ms 10420 KB Output is correct
45 Correct 159 ms 10496 KB Output is correct
46 Correct 172 ms 11488 KB Output is correct
47 Correct 117 ms 10064 KB Output is correct
48 Correct 128 ms 10064 KB Output is correct
49 Correct 151 ms 9116 KB Output is correct
50 Correct 125 ms 9920 KB Output is correct
51 Correct 117 ms 10328 KB Output is correct
52 Correct 119 ms 10136 KB Output is correct