oj.uz

Submission #738494

# Submission time Handle Problem Language Result Execution time Memory
738494 2023-05-08T20:47:41 Z Vanilla Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 134 ms 13080 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 2e5 + 2;
int64 a[maxn];
int64 diff [maxn];

void solve(int id){
    
    return;
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    int n,m,s,t;
    cin >> n >> m >> s >> t;
    int64 inc = 0, dec = 0;
    for (int i = 0; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) {
        diff[i] = a[i] - a[i-1];
        if (diff[i] > 0) inc+=diff[i];
        else dec-=diff[i];
    }
    // cout << inc << " " << dec << "\n";
    while (m--) {
        int64 l,r,v;
        cin >> l >> r >> v;

        if (diff[l] > 0) inc-=diff[l];
        else dec+=diff[l];

        diff[l]+=v;

        if (diff[l] > 0) inc+=diff[l];
        else dec-=diff[l];

        if (diff[r + 1] > 0) inc-=diff[r + 1];
        else dec+=diff[r + 1];

        if (r != n) diff[r + 1]-=v;

        if (diff[r + 1] > 0) inc+=diff[r + 1];
        else dec-=diff[r + 1];

        cout << inc * -s + dec * t << "\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 2 ms 400 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 400 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 396 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 4812 KB Output is correct
2 Correct 97 ms 10836 KB Output is correct
3 Correct 116 ms 11376 KB Output is correct
4 Correct 97 ms 10768 KB Output is correct
5 Correct 134 ms 11964 KB Output is correct
6 Correct 84 ms 10956 KB Output is correct
7 Correct 85 ms 10916 KB Output is correct
8 Correct 94 ms 11824 KB Output is correct
9 Correct 107 ms 12124 KB Output is correct
10 Correct 128 ms 10828 KB Output is correct
11 Correct 80 ms 10912 KB Output is correct
12 Correct 80 ms 11676 KB Output is correct
13 Correct 81 ms 11808 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 2 ms 400 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 400 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 396 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 328 KB Output is correct
22 Correct 86 ms 4812 KB Output is correct
23 Correct 97 ms 10836 KB Output is correct
24 Correct 116 ms 11376 KB Output is correct
25 Correct 97 ms 10768 KB Output is correct
26 Correct 134 ms 11964 KB Output is correct
27 Correct 84 ms 10956 KB Output is correct
28 Correct 85 ms 10916 KB Output is correct
29 Correct 94 ms 11824 KB Output is correct
30 Correct 107 ms 12124 KB Output is correct
31 Correct 128 ms 10828 KB Output is correct
32 Correct 80 ms 10912 KB Output is correct
33 Correct 80 ms 11676 KB Output is correct
34 Correct 81 ms 11808 KB Output is correct
35 Correct 117 ms 10396 KB Output is correct
36 Correct 100 ms 11752 KB Output is correct
37 Correct 102 ms 12628 KB Output is correct
38 Correct 102 ms 12392 KB Output is correct
39 Correct 100 ms 12412 KB Output is correct
40 Correct 119 ms 12448 KB Output is correct
41 Correct 98 ms 12172 KB Output is correct
42 Correct 134 ms 12296 KB Output is correct
43 Correct 96 ms 11608 KB Output is correct
44 Correct 118 ms 11980 KB Output is correct
45 Correct 94 ms 12000 KB Output is correct
46 Correct 97 ms 13080 KB Output is correct
47 Correct 109 ms 11672 KB Output is correct
48 Correct 79 ms 11596 KB Output is correct
49 Correct 94 ms 10684 KB Output is correct
50 Correct 99 ms 11536 KB Output is correct
51 Correct 77 ms 11852 KB Output is correct
52 Correct 83 ms 11596 KB Output is correct