제출 #659007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659007		ssense	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	100 / 100	114 ms	13260 KiB

foehn_phenomena

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu

int sign(int x) {
    return (x > 0) - (x < 0);
}

int n, q, s, t;

int get(int old, int now)
{
    int change = 0;
    if(old > 0)
    {
        change+=s*old;
    }
    else
    {
        change+=t*old;
    }
    if(now > 0)
    {
        change-=s*now;
    }
    else
    {
        change-=t*now;
    }
    return change;
}

void solve()
{
    cin >> n >> q >> s >> t;
    vint a = read(n+1);
    vint darr;
    int now = 0;
    for(int i = 1; i <= n; i++)
    {
        darr.pb(a[i]-a[i-1]);
        if(darr.back() > 0)
        {
            now-=s*darr.back();
        }
        else
        {
            now-=t*darr.back();
        }
    }
    for(int i = 0; i < q; i++)
    {
        int l, r, x;
        cin >> l >> r >> x;
        now+=get(darr[l-1], darr[l-1]+x);
        darr[l-1]+=x;
        if(r != n)
        {
            now+=get(darr[r], darr[r]-x);
            darr[r]-=x;
        }
        cout << now << endl;
    }
}

int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
3 5 1 2
0
4
1
8
1 2 2
1 1 -2
2 3 5
1 2 -1
1 3 5
 

 */

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

foehn_phenomena.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
foehn_phenomena.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

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