Submission #406722

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
406722	2021-05-18T03:41:41 Z	arwaeystoamneg	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	497 ms	17760 KB

foehn_phenomena

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
template<class T>class segment_tree
{
	struct item
	{
		T sum;
	};
	item single(T i)
	{
		return { i };
	}
	item merge(item x, item y)
	{
		item ans;
		ans.sum = x.sum + y.sum;
		return ans;
	}
	vector<item> tree;
	vector<item>A;
	int height;
	item neutral = { 0 };
public:void build(vector<T>& B)
{
	int	n = B.size();
	height = log2(n + 1) + 1;
	A.rsz(n);
	tree.rsz((1 << height + 1) - 1);
	F0R(i, n)A[i] = single(B[i]);
	A.rsz(1 << height, neutral);
	build(A, 0, 0, (1 << height) - 1);
}
	  void build(vector<item>& A, int v, int tl, int tr)
	  {
		  if (tl == tr)
			  tree[v] = A[tl];
		  else
		  {
			  int mid = (tl + tr) / 2;
			  build(A, 2 * v + 1, tl, mid);
			  build(A, 2 * v + 2, mid + 1, tr);
			  tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
		  }
	  }
public:T query(int l, int r)
{
	return query(0, 0, (1 << height) - 1, l, r).sum;
}
	  item query(int v, int tl, int tr, int l, int r)
	  {
		  if (r<tl || l>tr)return neutral;
		  if (l <= tl && r >= tr)
		  {
			  return tree[v];
		  }
		  int mid = (tl + tr) / 2;
		  return merge(query(2 * v + 1, tl, mid, l, r), query(2 * v + 2, mid + 1, tr, l, r));
	  }
	  //assign
public:void update(int pos, T val)
{
	update(0, 0, (1 << height) - 1, pos, single(val));
}
	  void update(int v, int tl, int tr, int pos, item val)
	  {
		  if (tl == tr)
		  {
			  tree[v] = merge(tree[v], val);
		  }
		  else
		  {
			  int mid = (tl + tr) / 2;
			  if (pos <= mid)
				  update(2 * v + 1, tl, mid, pos, val);
			  else
				  update(2 * v + 2, mid + 1, tr, pos, val);
			  tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
		  }
	  }
};
int n, q, s, t;
ll ans = 0;
vll a;
segment_tree < ll >sum;
ll count(int i)
{
	ll v1 = sum.query(0, i), v2 = sum.query(0, i + 1);
	return (v1 < v2 ? s : t) * abs(v1 - v2);
}
int main()
{
	setIO("test1");
	cin >> n >> q >> s >> t;
	s = -s;
	a.rsz(n + 2);
	F0R(i, n + 1)cin >> a[i];
	a[0] = 0, a[n + 1] = linf;
	F0R(i, n + 1)a[i] = a[i + 1] - a[i];
	R0F(i, n + 1)a[i + 1] = a[i];
	a[0] = 0;
	sum.build(a);
	F0R(i, n)ans += count(i);
	while (q--)
	{
		int x, y, z;
		cin >> x >> y >> z;
		ans -= count(x - 1);
		sum.update(x, z);
		ans += count(x - 1);
		if (y < n)
			ans -= count(y);
		sum.update(y + 1, -z);
		if (y < n)
			ans += count(y);
		cout << ans << endl;
	}
}

Compilation message

foehn_phenomena.cpp: In instantiation of 'void segment_tree<T>::build(std::vector<_Tp>&) [with T = long long int]':
foehn_phenomena.cpp:153:13:   required from here
foehn_phenomena.cpp:80:24: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   80 |  tree.rsz((1 << height + 1) - 1);
      |                 ~~~~~~~^~~

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	540 KB	Output is correct
2	Correct	4 ms	460 KB	Output is correct
3	Correct	4 ms	460 KB	Output is correct
4	Correct	4 ms	460 KB	Output is correct
5	Correct	4 ms	448 KB	Output is correct
6	Correct	4 ms	460 KB	Output is correct
7	Correct	4 ms	444 KB	Output is correct
8	Correct	4 ms	460 KB	Output is correct
9	Correct	4 ms	460 KB	Output is correct
10	Correct	4 ms	460 KB	Output is correct
11	Correct	4 ms	460 KB	Output is correct
12	Correct	4 ms	460 KB	Output is correct
13	Correct	3 ms	432 KB	Output is correct
14	Correct	3 ms	448 KB	Output is correct
15	Correct	4 ms	460 KB	Output is correct
16	Correct	3 ms	460 KB	Output is correct
17	Correct	3 ms	452 KB	Output is correct
18	Correct	3 ms	460 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	486 ms	14904 KB	Output is correct
2	Correct	478 ms	15552 KB	Output is correct
3	Correct	478 ms	15984 KB	Output is correct
4	Correct	478 ms	15456 KB	Output is correct
5	Correct	473 ms	16740 KB	Output is correct
6	Correct	254 ms	15664 KB	Output is correct
7	Correct	262 ms	15656 KB	Output is correct
8	Correct	436 ms	16368 KB	Output is correct
9	Correct	425 ms	16808 KB	Output is correct
10	Correct	401 ms	15520 KB	Output is correct
11	Correct	332 ms	15596 KB	Output is correct
12	Correct	255 ms	16300 KB	Output is correct
13	Correct	264 ms	16488 KB	Output is correct

Subtask #3

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	540 KB	Output is correct
2	Correct	4 ms	460 KB	Output is correct
3	Correct	4 ms	460 KB	Output is correct
4	Correct	4 ms	460 KB	Output is correct
5	Correct	4 ms	448 KB	Output is correct
6	Correct	4 ms	460 KB	Output is correct
7	Correct	4 ms	444 KB	Output is correct
8	Correct	4 ms	460 KB	Output is correct
9	Correct	4 ms	460 KB	Output is correct
10	Correct	4 ms	460 KB	Output is correct
11	Correct	4 ms	460 KB	Output is correct
12	Correct	4 ms	460 KB	Output is correct
13	Correct	3 ms	432 KB	Output is correct
14	Correct	3 ms	448 KB	Output is correct
15	Correct	4 ms	460 KB	Output is correct
16	Correct	3 ms	460 KB	Output is correct
17	Correct	3 ms	452 KB	Output is correct
18	Correct	3 ms	460 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	486 ms	14904 KB	Output is correct
23	Correct	478 ms	15552 KB	Output is correct
24	Correct	478 ms	15984 KB	Output is correct
25	Correct	478 ms	15456 KB	Output is correct
26	Correct	473 ms	16740 KB	Output is correct
27	Correct	254 ms	15664 KB	Output is correct
28	Correct	262 ms	15656 KB	Output is correct
29	Correct	436 ms	16368 KB	Output is correct
30	Correct	425 ms	16808 KB	Output is correct
31	Correct	401 ms	15520 KB	Output is correct
32	Correct	332 ms	15596 KB	Output is correct
33	Correct	255 ms	16300 KB	Output is correct
34	Correct	264 ms	16488 KB	Output is correct
35	Correct	485 ms	15044 KB	Output is correct
36	Correct	478 ms	16396 KB	Output is correct
37	Correct	487 ms	17272 KB	Output is correct
38	Correct	487 ms	17064 KB	Output is correct
39	Correct	491 ms	17004 KB	Output is correct
40	Correct	479 ms	17072 KB	Output is correct
41	Correct	496 ms	16828 KB	Output is correct
42	Correct	497 ms	16976 KB	Output is correct
43	Correct	479 ms	16148 KB	Output is correct
44	Correct	489 ms	16548 KB	Output is correct
45	Correct	490 ms	16612 KB	Output is correct
46	Correct	478 ms	17760 KB	Output is correct
47	Correct	264 ms	16220 KB	Output is correct
48	Correct	327 ms	16296 KB	Output is correct
49	Correct	474 ms	15392 KB	Output is correct
50	Correct	327 ms	16048 KB	Output is correct
51	Correct	254 ms	16424 KB	Output is correct
52	Correct	313 ms	16296 KB	Output is correct