oj.uz

Submission #1051575

# Submission time Handle Problem Language Result Execution time Memory
1051575 2024-08-10T08:18:02 Z Mher777 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 90 ms 7360 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937_64 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 200005;
ll a[N], dif[N];
int n, q;
ll s, t;

void slv() {
    cin >> n >> q >> s >> t;
    ll ans = 0;
    for (int i = 0; i <= n; ++i) {
        cin >> a[i];
        if (i == 0) continue;
        dif[i] = a[i - 1] - a[i];
        if (dif[i] < 0) {
            ans += s * dif[i];
        }
        else {
            ans += t * dif[i];
        }
    }
    while (q--) {
        int l, r;
        ll x;
        cin >> l >> r >> x;
        if (dif[l] < 0) {
            ans += (-s * dif[l]);
        }
        else {
            ans += -(t * dif[l]);
        }
        dif[l] -= x;
        if (dif[l] < 0) {
            ans += s * dif[l];
        }
        else {
            ans += t * dif[l];
        }
        if (r == n) {
            cout << ans << '\n';
            continue;
        }
        l = r + 1;
        if (dif[l] < 0) {
            ans += -(s * dif[l]);
        }
        else {
            ans += -(t * dif[l]);
        }
        dif[l] += x;
        if (dif[l] < 0) {
            ans += s * dif[l];
        }
        else {
            ans += t * dif[l];
        }
        cout << ans << '\n';
    }
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'll range_sum(ll, ll)':
foehn_phenomena.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
foehn_phenomena.cpp: In function 'll bin_to_dec(std::string)':
foehn_phenomena.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 4988 KB Output is correct
2 Correct 82 ms 5408 KB Output is correct
3 Correct 90 ms 5968 KB Output is correct
4 Correct 47 ms 5208 KB Output is correct
5 Correct 51 ms 6096 KB Output is correct
6 Correct 44 ms 6484 KB Output is correct
7 Correct 51 ms 6480 KB Output is correct
8 Correct 55 ms 6488 KB Output is correct
9 Correct 56 ms 6804 KB Output is correct
10 Correct 51 ms 5492 KB Output is correct
11 Correct 41 ms 6484 KB Output is correct
12 Correct 47 ms 6740 KB Output is correct
13 Correct 50 ms 7360 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 51 ms 4988 KB Output is correct
23 Correct 82 ms 5408 KB Output is correct
24 Correct 90 ms 5968 KB Output is correct
25 Correct 47 ms 5208 KB Output is correct
26 Correct 51 ms 6096 KB Output is correct
27 Correct 44 ms 6484 KB Output is correct
28 Correct 51 ms 6480 KB Output is correct
29 Correct 55 ms 6488 KB Output is correct
30 Correct 56 ms 6804 KB Output is correct
31 Correct 51 ms 5492 KB Output is correct
32 Correct 41 ms 6484 KB Output is correct
33 Correct 47 ms 6740 KB Output is correct
34 Correct 50 ms 7360 KB Output is correct
35 Correct 52 ms 4944 KB Output is correct
36 Correct 60 ms 6580 KB Output is correct
37 Correct 56 ms 7148 KB Output is correct
38 Correct 54 ms 7004 KB Output is correct
39 Correct 66 ms 7128 KB Output is correct
40 Correct 65 ms 6996 KB Output is correct
41 Correct 55 ms 6996 KB Output is correct
42 Correct 65 ms 6996 KB Output is correct
43 Correct 61 ms 6240 KB Output is correct
44 Correct 56 ms 6736 KB Output is correct
45 Correct 57 ms 6464 KB Output is correct
46 Correct 60 ms 7156 KB Output is correct
47 Correct 49 ms 7004 KB Output is correct
48 Correct 45 ms 7308 KB Output is correct
49 Correct 46 ms 6228 KB Output is correct
50 Correct 43 ms 6996 KB Output is correct
51 Correct 46 ms 6996 KB Output is correct
52 Correct 44 ms 7120 KB Output is correct