oj.uz

Submission #87887

# Submission time Handle Problem Language Result Execution time Memory
87887 2018-12-03T02:12:58 Z tieunhi Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 227 ms 22728 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define PB push_back
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define ll long long
#define mid (r + l)/2
#define N 2000005
#define LN 19
#define maxc 1000000007

using namespace std;

int n, numQ, S, T;
ll valUp, valDown;

struct BIT
{
    ll t[N];
    void upd(int x, ll val)
    {
        for (; x < N; x += (x & -x)) t[x] += val;
    }
    void upd(int l, int r, ll val)
    {
        upd(l, val);
        upd(r+1, -val);
    }
    ll get(int x)
    {
        ll ans = 0;
        for (; x; x -= (x & -x)) ans += t[x];
        return ans;
    }
}t;

void update(int u, int sign)
{
    if (u == n) return;
    ll val = 0;
    ll x = t.get(u);
    ll y = t.get(u+1);
    if (x < y) valUp += sign*abs(y-x);
    else valDown += sign*abs(y-x);
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("INP.TXT", "r", stdin);
    cin >> n >> numQ >> S >> T; n++;
    FOR(i, 1, n)
    {
        int x; cin >> x;
        t.upd(i, i, x);
    }
    FOR(i, 1, n-1) update(i, 1);
    while (numQ--)
    {
        int u, v, val; cin >> u >> v >> val; u++; v++;
        update(u-1, -1);
        update(v, -1);
        t.upd(u, v, val);
        update(u-1, 1);
        update(v, 1);
        cout <<valDown*T - valUp*S<<'\n';
    }
}

Compilation message

foehn_phenomena.cpp: In function 'void update(int, int)':
foehn_phenomena.cpp:43:8: warning: unused variable 'val' [-Wunused-variable]
     ll val = 0;
        ^~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 548 KB Output is correct
3 Correct 4 ms 688 KB Output is correct
4 Correct 4 ms 940 KB Output is correct
5 Correct 4 ms 940 KB Output is correct
6 Correct 5 ms 1056 KB Output is correct
7 Correct 4 ms 1056 KB Output is correct
8 Correct 4 ms 1256 KB Output is correct
9 Correct 4 ms 1256 KB Output is correct
10 Correct 4 ms 1256 KB Output is correct
11 Correct 4 ms 1264 KB Output is correct
12 Correct 4 ms 1344 KB Output is correct
13 Correct 4 ms 1400 KB Output is correct
14 Correct 4 ms 1444 KB Output is correct
15 Correct 4 ms 1496 KB Output is correct
16 Correct 4 ms 1532 KB Output is correct
17 Correct 4 ms 1676 KB Output is correct
18 Correct 4 ms 1676 KB Output is correct
19 Correct 2 ms 1676 KB Output is correct
20 Correct 2 ms 1676 KB Output is correct
21 Correct 0 ms 1676 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 9936 KB Output is correct
2 Correct 197 ms 15924 KB Output is correct
3 Correct 195 ms 21544 KB Output is correct
4 Correct 188 ms 21544 KB Output is correct
5 Correct 193 ms 21544 KB Output is correct
6 Correct 163 ms 21896 KB Output is correct
7 Correct 161 ms 21916 KB Output is correct
8 Correct 201 ms 21916 KB Output is correct
9 Correct 207 ms 22164 KB Output is correct
10 Correct 192 ms 22164 KB Output is correct
11 Correct 159 ms 22164 KB Output is correct
12 Correct 162 ms 22372 KB Output is correct
13 Correct 161 ms 22684 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 548 KB Output is correct
3 Correct 4 ms 688 KB Output is correct
4 Correct 4 ms 940 KB Output is correct
5 Correct 4 ms 940 KB Output is correct
6 Correct 5 ms 1056 KB Output is correct
7 Correct 4 ms 1056 KB Output is correct
8 Correct 4 ms 1256 KB Output is correct
9 Correct 4 ms 1256 KB Output is correct
10 Correct 4 ms 1256 KB Output is correct
11 Correct 4 ms 1264 KB Output is correct
12 Correct 4 ms 1344 KB Output is correct
13 Correct 4 ms 1400 KB Output is correct
14 Correct 4 ms 1444 KB Output is correct
15 Correct 4 ms 1496 KB Output is correct
16 Correct 4 ms 1532 KB Output is correct
17 Correct 4 ms 1676 KB Output is correct
18 Correct 4 ms 1676 KB Output is correct
19 Correct 2 ms 1676 KB Output is correct
20 Correct 2 ms 1676 KB Output is correct
21 Correct 0 ms 1676 KB Output is correct
22 Correct 190 ms 9936 KB Output is correct
23 Correct 197 ms 15924 KB Output is correct
24 Correct 195 ms 21544 KB Output is correct
25 Correct 188 ms 21544 KB Output is correct
26 Correct 193 ms 21544 KB Output is correct
27 Correct 163 ms 21896 KB Output is correct
28 Correct 161 ms 21916 KB Output is correct
29 Correct 201 ms 21916 KB Output is correct
30 Correct 207 ms 22164 KB Output is correct
31 Correct 192 ms 22164 KB Output is correct
32 Correct 159 ms 22164 KB Output is correct
33 Correct 162 ms 22372 KB Output is correct
34 Correct 161 ms 22684 KB Output is correct
35 Correct 209 ms 22684 KB Output is correct
36 Correct 209 ms 22684 KB Output is correct
37 Correct 216 ms 22728 KB Output is correct
38 Correct 208 ms 22728 KB Output is correct
39 Correct 227 ms 22728 KB Output is correct
40 Correct 208 ms 22728 KB Output is correct
41 Correct 221 ms 22728 KB Output is correct
42 Correct 213 ms 22728 KB Output is correct
43 Correct 217 ms 22728 KB Output is correct
44 Correct 203 ms 22728 KB Output is correct
45 Correct 187 ms 22728 KB Output is correct
46 Correct 200 ms 22728 KB Output is correct
47 Correct 165 ms 22728 KB Output is correct
48 Correct 170 ms 22728 KB Output is correct
49 Correct 180 ms 22728 KB Output is correct
50 Correct 163 ms 22728 KB Output is correct
51 Correct 163 ms 22728 KB Output is correct
52 Correct 166 ms 22728 KB Output is correct