Submission #1051582

#	Time	Username	Problem	Language	Result	Execution time	Memory
1051582		dilanyan	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	30 / 100	1061 ms	4700 KiB

foehn_phenomena

//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------Kargpefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set

void KarginSet(string name = "") {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    if (name.size()) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 1e9 + 7;
const ll inf = 2e18;
 
//-------------------KarginCode-----------------------\\ 
 
const int N = 300006, M = 1000005;

ll a[N], pref[N];

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

int main() {
    KarginSet();
    int test = 1;
    //cin >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
} 

Compilation message (stderr)

foehn_phenomena.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
foehn_phenomena.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
foehn_phenomena.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
foehn_phenomena.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
foehn_phenomena.cpp: In function 'void KarginSet(std::string)':
foehn_phenomena.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 0 / 10
• Subtask 3: 0 / 60