제출 #362012

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
362012		HoneyBadger	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	184 ms	7532 KiB

foehn_phenomena

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 200010;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int a[MX];
int f[MX];

void upd(int i, int x) {
	for (++i; i < MX; i += i & -i)
		f[i] += x;
}

int get(int i) {
	int ans = 0;
	for (++i; i > 0; i -= i & -i)
		ans += f[i];
	return ans;
} 

void updlr(int l, int r, int x) {
	upd(l, x);
	upd(r + 1, -x);
} 

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, q, s, t;
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; ++i) {
   	 	cin >> a[i];
   	 	updlr(i, i, a[i]);
    }
    auto calc = [&](int i) {
    	if (i < 0 || i == n)
    		return 0ll;
    	int x = get(i);
    	int y = get(i + 1);
    	if (x < y)
    		return (x - y) * s;
    	return (x - y) * t;
    };
   	int ans = 0;
   	for (int i = 0; i < n; ++i) {
   		ans += calc(i);
   	}
   	while (q--) {
   		int l, r, x;
   		cin >> l >> r >> x;
   		int delta = 0;
   		delta -= calc(l - 1);
   		delta -= calc(r);
   		updlr(l, r, x);
   		delta += calc(l - 1);
   		delta += calc(r);
   		ans += delta;
   		cout << ans << '\n';
   		/*cout << "a: ";
   		for (int i = 0; i <= n; ++i)
   			cout << get(i) << ' ';
   		cout << '\n';*/
   	}
}

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