oj.uz

Submission #361971

# Submission time Handle Problem Language Result Execution time Memory
361971 2021-02-01T13:02:05 Z Galebickosikasa Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 204 ms 13164 KB 
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map 
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

using namespace std;

#ifdef LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
#else 
	#define dbg(x)
#endif

//tg: @runningcherry
 
template <typename T1, typename T2> ostream& operator << (ostream& out, const pair<T1, T2>& v) {
	out << v.fi << ", " << v.se;
	return out;
}

template<typename T> ostream& operator << (ostream& out, const vector<T>& v) {
	for (auto& x: v) out << x << " ";
	return out;
}

template <typename T1, typename T2> ostream& operator << (ostream& out, const map<T1, T2>& v) {
	for (auto& x: v) out << x << '\n';
	return out;
}

template<typename T> ostream& operator << (ostream& out, const set<T>& v) {
	for (auto& x: v) out << x << " ";
	return out;
}

template<typename T> ostream& operator << (ostream& out, const multiset<T>& v) {
	for (auto& x: v) out << x << " ";
	return out;
}

template <typename T1, typename T2> istream& operator >> (istream& in, pair<T1, T2>& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

const int maxn = 2e5 + 20;

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

struct fenw {
	vector<int> t;

	fenw (int n) {
		t = vector<int> (n);
	}

	inline void add (int i, int x) {
		for (; i < sz (t); i += i & -i) t[i] += x;
	}

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

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n, q, s, t;
	cin >> n >> q >> s >> t;
	vector<int> goo (n + 1);
	cinv (goo);
	fenw fen (n + 10);
	int res = 0;
	fl (i, 1, n + 1) {
		fen.add (i, goo[i] - goo[i - 1]);
		if (goo[i - 1] < goo[i]) {
			res -= s * (goo[i] - goo[i - 1]);
		} else {
			res += t * (goo[i - 1] - goo[i]);
		}
	}
	dbg (res);
	while (q--) {
		int l, r, x;
		cin >> l >> r >> x;
		int a = fen.get (l - 1);
		int b = fen.get (l);
		if (a < b) res += s * (b - a);
		else res -= t * (a - b);
		if (r != n) {
			a = fen.get (r);
			b = fen.get (r + 1);
			if (a < b) res += s * (b - a);
			else res -= t * (a - b);
		}
		fen.add (l, x);
		fen.add (r + 1, -x);
		a = fen.get (l - 1);
		b = fen.get (l);
		if (a < b) res -= s * (b - a);
		else res += t * (a - b);
		if (r != n) {
			a = fen.get (r);
			b = fen.get (r + 1);
			if (a < b) res -= s * (b - a);
			else res += t * (a - b);
		}
		cout << res << '\n';
	}





}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 10348 KB Output is correct
2 Correct 164 ms 11116 KB Output is correct
3 Correct 158 ms 11628 KB Output is correct
4 Correct 159 ms 10988 KB Output is correct
5 Correct 160 ms 12012 KB Output is correct
6 Correct 125 ms 11116 KB Output is correct
7 Correct 116 ms 11116 KB Output is correct
8 Correct 166 ms 12140 KB Output is correct
9 Correct 153 ms 12288 KB Output is correct
10 Correct 147 ms 10988 KB Output is correct
11 Correct 115 ms 11116 KB Output is correct
12 Correct 116 ms 11756 KB Output is correct
13 Correct 116 ms 12140 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 158 ms 10348 KB Output is correct
23 Correct 164 ms 11116 KB Output is correct
24 Correct 158 ms 11628 KB Output is correct
25 Correct 159 ms 10988 KB Output is correct
26 Correct 160 ms 12012 KB Output is correct
27 Correct 125 ms 11116 KB Output is correct
28 Correct 116 ms 11116 KB Output is correct
29 Correct 166 ms 12140 KB Output is correct
30 Correct 153 ms 12288 KB Output is correct
31 Correct 147 ms 10988 KB Output is correct
32 Correct 115 ms 11116 KB Output is correct
33 Correct 116 ms 11756 KB Output is correct
34 Correct 116 ms 12140 KB Output is correct
35 Correct 152 ms 10604 KB Output is correct
36 Correct 204 ms 11884 KB Output is correct
37 Correct 159 ms 12780 KB Output is correct
38 Correct 162 ms 12652 KB Output is correct
39 Correct 164 ms 12528 KB Output is correct
40 Correct 162 ms 12652 KB Output is correct
41 Correct 162 ms 12396 KB Output is correct
42 Correct 161 ms 12396 KB Output is correct
43 Correct 155 ms 11628 KB Output is correct
44 Correct 158 ms 12140 KB Output is correct
45 Correct 170 ms 12268 KB Output is correct
46 Correct 156 ms 13164 KB Output is correct
47 Correct 126 ms 11756 KB Output is correct
48 Correct 129 ms 11756 KB Output is correct
49 Correct 155 ms 10860 KB Output is correct
50 Correct 123 ms 11500 KB Output is correct
51 Correct 132 ms 11884 KB Output is correct
52 Correct 119 ms 11756 KB Output is correct