oj.uz

Submission #767410

# Submission time Handle Problem Language Result Execution time Memory
767410 2023-06-26T18:04:39 Z raysh07 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 89 ms 13068 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    vector <int> a(n + 1), d(n);
    int c1 = 0, c2 = 0;
    for (int i = 0; i <= n; i++){
        cin >> a[i];
        if (i != 0) {
            d[i - 1] = a[i] - a[i - 1];
            if (d[i - 1] > 0) c1 += d[i - 1];
            else c2 += d[i - 1];
        }
    }
    s = -s;
    
    while (q--){
        int l, r, k; cin >> l >> r >> k;
        
        if (d[l - 1] > 0) c1 -= d[l - 1];
        else c2 -= d[l - 1];
        d[l - 1] += k;
        if (d[l - 1] > 0) c1 += d[l - 1];
        else c2 += d[l - 1];
        
        if (r != n){
            if (d[r] > 0) c1 -= d[r];
            else c2 -= d[r];
            d[r] -= k;
            if (d[r] > 0) c1 += d[r];
            else c2 += d[r];
        }
        
        cout << c1 * s - c2 * t << "\n";
    }
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 10276 KB Output is correct
2 Correct 76 ms 10916 KB Output is correct
3 Correct 75 ms 11392 KB Output is correct
4 Correct 71 ms 10876 KB Output is correct
5 Correct 77 ms 11972 KB Output is correct
6 Correct 72 ms 11000 KB Output is correct
7 Correct 64 ms 10960 KB Output is correct
8 Correct 77 ms 11772 KB Output is correct
9 Correct 76 ms 12108 KB Output is correct
10 Correct 74 ms 10852 KB Output is correct
11 Correct 61 ms 10876 KB Output is correct
12 Correct 63 ms 11664 KB Output is correct
13 Correct 65 ms 11900 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 408 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 72 ms 10276 KB Output is correct
23 Correct 76 ms 10916 KB Output is correct
24 Correct 75 ms 11392 KB Output is correct
25 Correct 71 ms 10876 KB Output is correct
26 Correct 77 ms 11972 KB Output is correct
27 Correct 72 ms 11000 KB Output is correct
28 Correct 64 ms 10960 KB Output is correct
29 Correct 77 ms 11772 KB Output is correct
30 Correct 76 ms 12108 KB Output is correct
31 Correct 74 ms 10852 KB Output is correct
32 Correct 61 ms 10876 KB Output is correct
33 Correct 63 ms 11664 KB Output is correct
34 Correct 65 ms 11900 KB Output is correct
35 Correct 77 ms 10360 KB Output is correct
36 Correct 75 ms 11852 KB Output is correct
37 Correct 78 ms 12612 KB Output is correct
38 Correct 87 ms 12520 KB Output is correct
39 Correct 89 ms 12400 KB Output is correct
40 Correct 79 ms 12388 KB Output is correct
41 Correct 82 ms 12232 KB Output is correct
42 Correct 78 ms 12292 KB Output is correct
43 Correct 80 ms 11624 KB Output is correct
44 Correct 77 ms 11980 KB Output is correct
45 Correct 73 ms 12028 KB Output is correct
46 Correct 74 ms 13068 KB Output is correct
47 Correct 66 ms 11684 KB Output is correct
48 Correct 67 ms 11672 KB Output is correct
49 Correct 74 ms 10700 KB Output is correct
50 Correct 63 ms 11512 KB Output is correct
51 Correct 64 ms 11812 KB Output is correct
52 Correct 62 ms 11616 KB Output is correct