oj.uz

Submission #288539

# Submission time Handle Problem Language Result Execution time Memory
288539 2020-09-01T15:36:09 Z Hehehe Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 162 ms 12072 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e6 + 11;
const int X = 1e6;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

int n, a[N], d[N], s, tt, q;

int rs(int x){
    if(x > 0)return -s*x;
    return -x*tt;
}

void solve(){

    cin >> n >> q >> s >> tt;

    int ans = 0;

    for(int i = 0; i <= n; i++){
        cin >> a[i];
    }

    for(int i = 1; i <= n; i++){
        d[i] = a[i] - a[i - 1];
        ans += rs(d[i]);
    }


    while(q--){
        int L, R, x;

        cin >> L >> R >> x;

        ans += rs(d[L] + x) - rs(d[L]);
        if(R < n)ans += rs(d[R + 1] - x) - rs(d[R + 1]);

        d[L] += x;
        if(R < n)d[R + 1] -= x;

        cout << ans << '\n';
    }
}

int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 5240 KB Output is correct
2 Correct 114 ms 5880 KB Output is correct
3 Correct 121 ms 6520 KB Output is correct
4 Correct 116 ms 5624 KB Output is correct
5 Correct 112 ms 6264 KB Output is correct
6 Correct 105 ms 7032 KB Output is correct
7 Correct 99 ms 6776 KB Output is correct
8 Correct 120 ms 6776 KB Output is correct
9 Correct 121 ms 7356 KB Output is correct
10 Correct 116 ms 5852 KB Output is correct
11 Correct 94 ms 6904 KB Output is correct
12 Correct 96 ms 7288 KB Output is correct
13 Correct 96 ms 7672 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 113 ms 5240 KB Output is correct
23 Correct 114 ms 5880 KB Output is correct
24 Correct 121 ms 6520 KB Output is correct
25 Correct 116 ms 5624 KB Output is correct
26 Correct 112 ms 6264 KB Output is correct
27 Correct 105 ms 7032 KB Output is correct
28 Correct 99 ms 6776 KB Output is correct
29 Correct 120 ms 6776 KB Output is correct
30 Correct 121 ms 7356 KB Output is correct
31 Correct 116 ms 5852 KB Output is correct
32 Correct 94 ms 6904 KB Output is correct
33 Correct 96 ms 7288 KB Output is correct
34 Correct 96 ms 7672 KB Output is correct
35 Correct 117 ms 5368 KB Output is correct
36 Correct 124 ms 6904 KB Output is correct
37 Correct 150 ms 11640 KB Output is correct
38 Correct 147 ms 11492 KB Output is correct
39 Correct 126 ms 11384 KB Output is correct
40 Correct 126 ms 11384 KB Output is correct
41 Correct 120 ms 11256 KB Output is correct
42 Correct 120 ms 11256 KB Output is correct
43 Correct 122 ms 10616 KB Output is correct
44 Correct 121 ms 10988 KB Output is correct
45 Correct 162 ms 11000 KB Output is correct
46 Correct 129 ms 12072 KB Output is correct
47 Correct 101 ms 10616 KB Output is correct
48 Correct 104 ms 10632 KB Output is correct
49 Correct 114 ms 9620 KB Output is correct
50 Correct 94 ms 10488 KB Output is correct
51 Correct 99 ms 10876 KB Output is correct
52 Correct 98 ms 10624 KB Output is correct