제출 #531729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531729		Danilo21	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	100 / 100	103 ms	11512 KiB

foehn_phenomena

#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) __builtin_popcountll(a)
#define bithigh(a) 63-__builtin_clzll(a)
#define lg bithigh
ll highpow(ll a) { return 1LL << (ll)lg(a); }

using namespace std;

const ll LINF = 4e18;
const int mxN = 2e5+10, INF = 2e9, mod = (1 ? 1e9+7 : 998244353);
ll n, m, ans, a[mxN];
array<ll, 2> T;

int sig(ll x) { return (x < 0 ? -1 : 1); }

void update(int i, ll x){

    if (i == n) return;
    ans += (-a[i]) * (a[i] < 0 ? T[0] : T[1]);
    ans += (a[i] + x) * (a[i] + x < 0 ? T[0] : T[1]);
    a[i] += x;
}

void Solve(){

    cin >> n >> m >> T[0] >> T[1];
    for (int i = 0; i < n+1; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++)
        a[i] = a[i] - a[i+1];
    for (int i = 0; i < n; i++)
        ans += (a[i] < 0 ? T[0] : T[1]) * a[i];
    while (m--){
        ri(l); ri(r); rl(x);
        update(l-1, -x);
        update(r, x);
        cout << ans << en;
    }
}

int main(){

    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0); cerr.tie(0);
    cout << setprecision(12) << fixed;
    cerr << setprecision(12) << fixed;
    cerr << "Started!" << endl;

    int t = 1;
    //cin >> t;
    while (t--)
        Solve();

    return 0;
}

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

foehn_phenomena.cpp: In function 'long long int highpow(long long int)':
foehn_phenomena.cpp:26:22: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   26 | #define bithigh(a) 63-__builtin_clzll(a)
      |                      ^
foehn_phenomena.cpp:27:12: note: in expansion of macro 'bithigh'
   27 | #define lg bithigh
      |            ^~~~~~~
foehn_phenomena.cpp:28:38: note: in expansion of macro 'lg'
   28 | ll highpow(ll a) { return 1LL << (ll)lg(a); }
      |                                      ^~

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