oj.uz

답안 #162300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
162300 2019-11-07T14:08:10 Z kostia244 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 426 ms 11640 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 33;
struct fenwick {
	int n;
	ll tree[maxn];
	void init(int sz) {
		n = sz;
		memset(tree, 0, sizeof tree);
	}
	void _add(int i, ll x) {
		while (i <= n) {
			tree[i] += x;
			i += i & -i;
		}
	}
	void add(int l, int r, ll x) {
		_add(l, x);
		_add(r + 1, -x);
	}
	ll get(int i) {
		ll res = 0;
		while (i) {
			res += tree[i];
			i -= i & -i;
		}
		return res;
	}
};
ll n, q, s, t;
fenwick f;
ll val(int i) {
	if(i>n) return 0;
	ll diff = f.get(i - 1) - f.get(i);
	if (diff < 0)
		return s * diff;
	return t * diff;
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> q >> s >> t;
	f.init(n);
	int tmp;
	cin >> tmp;
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		cin >> tmp;
		f.add(i, i, tmp);
		ans += val(i);
	}
	ll l, r, x;
	while (q--) {
		cin >> l >> r >> x;
		ans -= val(l), ans -= val(r+1);
		f.add(l, r, x);
		ans += val(l), ans += val(r+1);
		cout << ans << "\n";
	}
}

Compilation message

foehn_phenomena.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2168 KB Output is correct
2 Correct 5 ms 2040 KB Output is correct
3 Correct 5 ms 2040 KB Output is correct
4 Correct 5 ms 2040 KB Output is correct
5 Correct 5 ms 2040 KB Output is correct
6 Correct 5 ms 2040 KB Output is correct
7 Correct 5 ms 2040 KB Output is correct
8 Correct 5 ms 2040 KB Output is correct
9 Correct 5 ms 2044 KB Output is correct
10 Correct 6 ms 2040 KB Output is correct
11 Correct 5 ms 2040 KB Output is correct
12 Correct 5 ms 2048 KB Output is correct
13 Correct 6 ms 2040 KB Output is correct
14 Correct 5 ms 2040 KB Output is correct
15 Correct 5 ms 2040 KB Output is correct
16 Correct 5 ms 1976 KB Output is correct
17 Correct 5 ms 2040 KB Output is correct
18 Correct 5 ms 2040 KB Output is correct
19 Correct 4 ms 1912 KB Output is correct
20 Correct 3 ms 1912 KB Output is correct
21 Correct 6 ms 1912 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 193 ms 8860 KB Output is correct
2 Correct 206 ms 9436 KB Output is correct
3 Correct 209 ms 10096 KB Output is correct
4 Correct 210 ms 9400 KB Output is correct
5 Correct 203 ms 10616 KB Output is correct
6 Correct 139 ms 9592 KB Output is correct
7 Correct 140 ms 9592 KB Output is correct
8 Correct 186 ms 10360 KB Output is correct
9 Correct 189 ms 10744 KB Output is correct
10 Correct 189 ms 9572 KB Output is correct
11 Correct 154 ms 9464 KB Output is correct
12 Correct 137 ms 10232 KB Output is correct
13 Correct 138 ms 10420 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2168 KB Output is correct
2 Correct 5 ms 2040 KB Output is correct
3 Correct 5 ms 2040 KB Output is correct
4 Correct 5 ms 2040 KB Output is correct
5 Correct 5 ms 2040 KB Output is correct
6 Correct 5 ms 2040 KB Output is correct
7 Correct 5 ms 2040 KB Output is correct
8 Correct 5 ms 2040 KB Output is correct
9 Correct 5 ms 2044 KB Output is correct
10 Correct 6 ms 2040 KB Output is correct
11 Correct 5 ms 2040 KB Output is correct
12 Correct 5 ms 2048 KB Output is correct
13 Correct 6 ms 2040 KB Output is correct
14 Correct 5 ms 2040 KB Output is correct
15 Correct 5 ms 2040 KB Output is correct
16 Correct 5 ms 1976 KB Output is correct
17 Correct 5 ms 2040 KB Output is correct
18 Correct 5 ms 2040 KB Output is correct
19 Correct 4 ms 1912 KB Output is correct
20 Correct 3 ms 1912 KB Output is correct
21 Correct 6 ms 1912 KB Output is correct
22 Correct 193 ms 8860 KB Output is correct
23 Correct 206 ms 9436 KB Output is correct
24 Correct 209 ms 10096 KB Output is correct
25 Correct 210 ms 9400 KB Output is correct
26 Correct 203 ms 10616 KB Output is correct
27 Correct 139 ms 9592 KB Output is correct
28 Correct 140 ms 9592 KB Output is correct
29 Correct 186 ms 10360 KB Output is correct
30 Correct 189 ms 10744 KB Output is correct
31 Correct 189 ms 9572 KB Output is correct
32 Correct 154 ms 9464 KB Output is correct
33 Correct 137 ms 10232 KB Output is correct
34 Correct 138 ms 10420 KB Output is correct
35 Correct 190 ms 8900 KB Output is correct
36 Correct 197 ms 10340 KB Output is correct
37 Correct 201 ms 11268 KB Output is correct
38 Correct 199 ms 11000 KB Output is correct
39 Correct 197 ms 11032 KB Output is correct
40 Correct 192 ms 11000 KB Output is correct
41 Correct 196 ms 10744 KB Output is correct
42 Correct 210 ms 10852 KB Output is correct
43 Correct 200 ms 10168 KB Output is correct
44 Correct 194 ms 10588 KB Output is correct
45 Correct 426 ms 10616 KB Output is correct
46 Correct 193 ms 11640 KB Output is correct
47 Correct 145 ms 10140 KB Output is correct
48 Correct 152 ms 10232 KB Output is correct
49 Correct 177 ms 9336 KB Output is correct
50 Correct 149 ms 10076 KB Output is correct
51 Correct 140 ms 10364 KB Output is correct
52 Correct 147 ms 10188 KB Output is correct