제출 #862218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862218		green_gold_dog	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	99 ms	13328 KiB

foehn_phenomena

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, q, S, T;
        cin >> n >> q >> S >> T;
        vector<ll> arr(n + 1, 0);
        for (ll i = 0; i <= n; i++) {
                cin >> arr[i];
        }
        vector<ll> ra;
        for (ll i = 1; i <= n; i++) {
                ra.push_back(arr[i] - arr[i - 1]);
        }
        ll ans = 0;
        for (auto i : ra) {
                if (i > 0) {
                        ans += S * i;
                } else {
                        ans += T * i;
                }
        }
        for (ll i = 0; i < q; i++) {
                ll l, r, x;
                cin >> l >> r >> x;
                l--;
                if (ra[l] > 0){
                        ans -= S * ra[l];
                } else {
                        ans -= T * ra[l];
                }
                ra[l] += x;
                if (ra[l] > 0) {
                        ans += S * ra[l];
                } else {
                        ans += T * ra[l];
                }
                if (r != n) {
                        if (ra[r] > 0) {
                                ans -= S * ra[r];
                        } else {
                                ans -= T * ra[r];
                        }
                        ra[r] -= x;
                        if (ra[r] > 0) {
                                ans += S * ra[r];
                        } else {
                                ans += T * ra[r];
                        }
                }
                cout << -ans << '\n';
        }
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

컴파일 시 표준 에러 (stderr) 메시지

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:103:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
foehn_phenomena.cpp:104:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

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