oj.uz

답안 #817883

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817883 2023-08-09T18:39:08 Z denniskim Dungeon 3 (JOI21_ho_t5) C++17
100 / 100
 679 ms 178868 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

struct gujo
{
	ll S, T, U;
	ll num;
	
	bool operator < (const gujo &xx) const
	{
		return S > xx.S;
	}
};

ll n, m;
ll a[5000010], b[5000010];
gujo Q[5000010];
ll X[5000010];
ll L[5000010], R[5000010];
vector<ll> yL[5000010];
vector<ll> zip;
ll siz;
ll ans[5000010];

void getL(void)
{
	stack<pll> stk;
	stack<ll> nstk;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		while(!stk.empty() && stk.top().fi >= b[i])
		{
			stk.pop();
			nstk.pop();
		}
		
		if(stk.empty())
			L[i] = -INF;
		
		else
		{
			L[i] = stk.top().se;
			yL[nstk.top()].push_back(i);
		}
		
		stk.push({b[i], X[i]});
		nstk.push(i);
	}
}

void getR(void)
{
	stack<pll> stk;
	
	for(ll i = n ; i >= 1 ; i--)
	{
		while(!stk.empty() && stk.top().fi > b[i])
			stk.pop();
		
		if(stk.empty())
			R[i] = X[n + 1];
		else
			R[i] = stk.top().se;
		
		stk.push({b[i], X[i]});
	}
}

struct segtree
{
	ll seg[10000010];
	
	void update(ll no, ll s, ll e, ll w, ll v)
	{
		if(e < w || w < s)
			return;
		
		if(s == e)
		{
			seg[no] = v;
			return;
		}
		
		update(no << 1, s, (s + e) >> 1, w, v);
		update(no << 1 | 1, ((s + e) >> 1) + 1, e, w, v);
		
		seg[no] = max(seg[no << 1], seg[no << 1 | 1]);
	}
	
	ll query(ll no, ll s, ll e, ll l, ll r)
	{
		if(e < l || r < s)
			return MIN;
		
		if(l <= s && e <= r)
			return seg[no];
		
		return max(query(no << 1, s, (s + e) >> 1, l, r), query(no << 1 | 1, ((s + e) >> 1) + 1, e, l, r));
	}
}segt;

struct segtree2
{
	ll seg[10000010];
	
	void update(ll no, ll s, ll e, ll w, ll v)
	{
		if(e < w || w < s)
			return;
		
		if(s == e)
		{
			seg[no] = v;
			return;
		}
		
		update(no << 1, s, (s + e) >> 1, w, v);
		update(no << 1 | 1, ((s + e) >> 1) + 1, e, w, v);
		
		if(b[seg[no << 1]] <= b[seg[no << 1 | 1]])
			seg[no] = seg[no << 1];
		else
			seg[no] = seg[no << 1 | 1];
	}
	
	ll query(ll no, ll s, ll e, ll l, ll r)
	{
		if(e < l || r < s)
			return MIN;
		
		if(l <= s && e <= r)
			return seg[no];
		
		ll gap1 = query(no << 1, s, (s + e) >> 1, l, r);
		ll gap2 = query(no << 1 | 1, ((s + e) >> 1) + 1, e, l, r);
		
		if(gap1 == MIN)
			return gap2;
		
		if(gap2 == MIN)
			return gap1;
		
		if(b[gap1] <= b[gap2])
			return gap1;
		
		return gap2;
	}
}segt2;

struct fenwicktree
{
	ll bit[10000010];
	
	void update(ll w, ll v)
	{
		for(ll i = w ; i <= siz ; i += (i & (-i)))
			bit[i] += v;
	}
	
	ll query(ll w)
	{
		ll ret = 0;
		
		for(ll i = w ; i > 0 ; i -= (i & (-i)))
			ret += bit[i];
		
		return ret;
	}
}ABIT, BBIT;

int main(void)
{
	fastio
	
	cin >> n >> m;
	
	for(ll i = 1 ; i <= n ; i++)
		cin >> a[i];
	
	for(ll i = 1 ; i <= n ; i++)
		cin >> b[i];
	
	for(ll i = 1 ; i <= m ; i++)
	{
		cin >> Q[i].S >> Q[i].T >> Q[i].U;
		Q[i].num = i;
	}
	
	X[1] = 0;
	
	for(ll i = 2 ; i <= n + 1 ; i++)
		X[i] = X[i - 1] + a[i - 1];
	
	getL();
	getR();
	
	zip.push_back(0);
	zip.push_back(INF);
	
	for(ll i = 1 ; i <= n ; i++)
	{
		if(L[i] != -INF)
		{
			zip.push_back(X[i] - L[i]);
			zip.push_back(R[i] - L[i]);
		}
		
		zip.push_back(R[i] - X[i]);
	}
	
	compress(zip);
	siz = (ll)zip.size() + 2;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		segt.update(1, 1, n, i, a[i]);
		segt2.update(1, 1, n, i, i);
	}
	
	ll p = n;
	ll ccc = m;
	
	for(ll i = 1 ; i <= m ; i++)
	{
		if(segt.query(1, 1, n, Q[i].S, Q[i].T - 1) > Q[i].U)
			continue;
		
		ll l = Q[i].S, r = Q[i].T - 1;
		
		while(l <= r)
		{
			ll mid = (l + r) / 2;
			
			if(X[mid] + Q[i].U < X[Q[i].T])
				l = mid + 1;
			else
				r = mid - 1;
		}
		
		ccc++;
		
		ll qry = segt2.query(1, 1, n, l, Q[i].T - 1);

		ans[Q[i].num] += (X[Q[i].T] - X[qry]) * b[qry];
		Q[ccc].S = qry;
		Q[ccc].num = -Q[i].num;
		Q[ccc].U = Q[i].U;
	}
	
	sort(Q + 1, Q + 1 + ccc);
	
	for(ll i = 1 ; i <= ccc ; i++)
	{
		if(Q[i].num > 0 && segt.query(1, 1, n, Q[i].S, Q[i].T - 1) > Q[i].U)
		{
			ans[Q[i].num] = -1;
			continue;
		}

		while(p >= Q[i].S)
		{
			ll w = R[p] - X[p];
			ll idx = lower_bound(zip.begin(), zip.end(), w) - zip.begin() + 1;
			
			if(p)
			{
				ABIT.update(1, b[p]);
				ABIT.update(idx, -b[p]);
				BBIT.update(idx, b[p] * w);
			}
			
			for(auto &j : yL[p])
			{
				w = X[j] - L[j];
				idx = lower_bound(zip.begin(), zip.end(), w) - zip.begin() + 1;
				ll w2 = R[j] - L[j];
				ll idx2 = lower_bound(zip.begin(), zip.end(), w2) - zip.begin() + 1;
				ll w3 = R[j] - X[j];
				ll idx3 = lower_bound(zip.begin(), zip.end(), w3) - zip.begin() + 1;
				
				ABIT.update(1, -b[j]);
				ABIT.update(idx3, b[j]);
				BBIT.update(idx3, -b[j] * w3);
				
				if(w < w3)
				{
					ABIT.update(1, b[j]);
					ABIT.update(idx, -b[j]);
					BBIT.update(idx, b[j] * w);
					BBIT.update(idx3, -b[j] * w);
					ABIT.update(idx3, -b[j]);
					BBIT.update(idx3, b[j] * w2);
					ABIT.update(idx2, b[j]);
					BBIT.update(idx2, -b[j] * w2);
				}
				
				else
				{
					ABIT.update(1, b[j]);
					ABIT.update(idx3, -b[j]);
					BBIT.update(idx3, b[j] * w3);
					BBIT.update(idx, -b[j] * w3);
					ABIT.update(idx, -b[j]);
					BBIT.update(idx, b[j] * w2);
					ABIT.update(idx2, b[j]);
					BBIT.update(idx2, -b[j] * w2);
				}
			}
			
			p--;
		}
		
		ll idx = lower_bound(zip.begin(), zip.end(), Q[i].U) - zip.begin();
		ll A = ABIT.query(idx);
		ll B = BBIT.query(idx);
		
		if(Q[i].num > 0)
			ans[Q[i].num] += A * Q[i].U + B;
		else
			ans[-Q[i].num] += -A * Q[i].U - B;
	}
	
	for(ll i = 1 ; i <= m ; i++)
		cout << ans[i] en;
	
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 118732 KB Output is correct
2 Correct 56 ms 118732 KB Output is correct
3 Correct 54 ms 118452 KB Output is correct
4 Correct 55 ms 118656 KB Output is correct
5 Correct 56 ms 118768 KB Output is correct
6 Correct 61 ms 118448 KB Output is correct
7 Correct 57 ms 118616 KB Output is correct
8 Correct 55 ms 118732 KB Output is correct
9 Correct 56 ms 118476 KB Output is correct
10 Correct 56 ms 118644 KB Output is correct
11 Correct 57 ms 118788 KB Output is correct
12 Correct 62 ms 118392 KB Output is correct
13 Correct 56 ms 118732 KB Output is correct
14 Correct 55 ms 118656 KB Output is correct
15 Correct 57 ms 118728 KB Output is correct
16 Correct 56 ms 118744 KB Output is correct
17 Correct 56 ms 118604 KB Output is correct
18 Correct 55 ms 118752 KB Output is correct
19 Correct 53 ms 118332 KB Output is correct
20 Correct 53 ms 118784 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 131476 KB Output is correct
2 Correct 156 ms 131264 KB Output is correct
3 Correct 167 ms 133284 KB Output is correct
4 Correct 131 ms 128884 KB Output is correct
5 Correct 173 ms 131264 KB Output is correct
6 Correct 480 ms 171556 KB Output is correct
7 Correct 533 ms 169440 KB Output is correct
8 Correct 563 ms 178868 KB Output is correct
9 Correct 484 ms 161456 KB Output is correct
10 Correct 549 ms 175640 KB Output is correct
11 Correct 528 ms 175040 KB Output is correct
12 Correct 449 ms 158736 KB Output is correct
13 Correct 613 ms 165964 KB Output is correct
14 Correct 567 ms 165984 KB Output is correct
15 Correct 385 ms 174648 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 518 ms 163084 KB Output is correct
2 Correct 463 ms 171996 KB Output is correct
3 Correct 341 ms 156152 KB Output is correct
4 Correct 503 ms 165292 KB Output is correct
5 Correct 448 ms 166480 KB Output is correct
6 Correct 447 ms 171384 KB Output is correct
7 Correct 454 ms 159860 KB Output is correct
8 Correct 411 ms 169652 KB Output is correct
9 Correct 293 ms 153120 KB Output is correct
10 Correct 368 ms 172852 KB Output is correct
11 Correct 483 ms 165644 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 118732 KB Output is correct
2 Correct 56 ms 118732 KB Output is correct
3 Correct 54 ms 118452 KB Output is correct
4 Correct 55 ms 118656 KB Output is correct
5 Correct 56 ms 118768 KB Output is correct
6 Correct 61 ms 118448 KB Output is correct
7 Correct 57 ms 118616 KB Output is correct
8 Correct 55 ms 118732 KB Output is correct
9 Correct 56 ms 118476 KB Output is correct
10 Correct 56 ms 118644 KB Output is correct
11 Correct 57 ms 118788 KB Output is correct
12 Correct 62 ms 118392 KB Output is correct
13 Correct 56 ms 118732 KB Output is correct
14 Correct 55 ms 118656 KB Output is correct
15 Correct 57 ms 118728 KB Output is correct
16 Correct 56 ms 118744 KB Output is correct
17 Correct 56 ms 118604 KB Output is correct
18 Correct 55 ms 118752 KB Output is correct
19 Correct 53 ms 118332 KB Output is correct
20 Correct 53 ms 118784 KB Output is correct
21 Correct 160 ms 131476 KB Output is correct
22 Correct 156 ms 131264 KB Output is correct
23 Correct 167 ms 133284 KB Output is correct
24 Correct 131 ms 128884 KB Output is correct
25 Correct 173 ms 131264 KB Output is correct
26 Correct 480 ms 171556 KB Output is correct
27 Correct 533 ms 169440 KB Output is correct
28 Correct 563 ms 178868 KB Output is correct
29 Correct 484 ms 161456 KB Output is correct
30 Correct 549 ms 175640 KB Output is correct
31 Correct 528 ms 175040 KB Output is correct
32 Correct 449 ms 158736 KB Output is correct
33 Correct 613 ms 165964 KB Output is correct
34 Correct 567 ms 165984 KB Output is correct
35 Correct 385 ms 174648 KB Output is correct
36 Correct 518 ms 163084 KB Output is correct
37 Correct 463 ms 171996 KB Output is correct
38 Correct 341 ms 156152 KB Output is correct
39 Correct 503 ms 165292 KB Output is correct
40 Correct 448 ms 166480 KB Output is correct
41 Correct 447 ms 171384 KB Output is correct
42 Correct 454 ms 159860 KB Output is correct
43 Correct 411 ms 169652 KB Output is correct
44 Correct 293 ms 153120 KB Output is correct
45 Correct 368 ms 172852 KB Output is correct
46 Correct 483 ms 165644 KB Output is correct
47 Correct 679 ms 165256 KB Output is correct
48 Correct 606 ms 177664 KB Output is correct
49 Correct 442 ms 157868 KB Output is correct
50 Correct 652 ms 169488 KB Output is correct
51 Correct 523 ms 168372 KB Output is correct
52 Correct 630 ms 174748 KB Output is correct
53 Correct 516 ms 163596 KB Output is correct
54 Correct 510 ms 173752 KB Output is correct
55 Correct 426 ms 156524 KB Output is correct
56 Correct 416 ms 175644 KB Output is correct
57 Correct 590 ms 169388 KB Output is correct