oj.uz

답안 #372370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372370 2021-02-27T21:40:16 Z crackersamdjam Fire (JOI20_ho_t5) C++17
14 / 100
 1000 ms 51276 KB 
#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#endif

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()

using namespace std;
using ll = long long;
const int MM = 2e5+5, NN = 400, SZ = 500, LOG = 18;

struct query{
	int t, l, r, id;
	bool operator<(const query &o) const{
		return t < o.t;
	}
} q[MM];

int n, qs;
ll a[MM], ans[MM], sp[LOG][MM];

ll qu(int l, int r){
	int k = __lg(r-l+1);
	return max(sp[k][l], sp[k][r-(1<<k)+1]);
}

stack<pair<int, ll>> st;
vector<pair<int, ll>> slope[NN];
ll curslope[NN], cursum[NN];
//at time i, slope changes by x
//changes sum by something

int ls[MM], rs[MM];
//rs how far will cover
//ls how far until covered

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	memset(ls, -0x3f, sizeof ls);
	cin>>n>>qs;

	for(int i = 1; i <= n; i++){
		cin>>a[i];
		sp[0][i] = a[i];
		while(size(st) and st.top().second <= a[i]){
			auto [j, v] = st.top();
			st.pop();
			rs[j] = i;
		}

		if(size(st)){
			auto [j, v] = st.top();
			ls[i] = j;
		}

		st.emplace(i, a[i]);
	}

	while(size(st)){
		auto [j, v] = st.top();
		st.pop();
		rs[j] = n+1;
	}

	for(int i = 1; i <= n; i++){
		//this one overwrites
		int id = i/SZ;
		int rid = rs[i]/SZ;

		slope[id].emplace_back(i-i, a[i]);
		slope[rid].emplace_back(rs[i]-i, -a[i]);
		for(int j = id; j <= rid; j++){
			if(j != id)
				slope[j].emplace_back(j*SZ-i, a[i]);
			
			if(j != rid)
				slope[j].emplace_back(j*SZ+SZ-i, -a[i]);
		}

		//when another starts to cover a[i]
		//and when it ends covering a[i]
		// i-ls[i] to rs[i]-ls[i]

		slope[id].emplace_back(i-ls[i], -a[i]);
		slope[rid].emplace_back(rs[i]-ls[i], a[i]);
		for(int j = id; j <= rid; j++){
			if(j != id)
				slope[j].emplace_back(j*SZ-ls[i], -a[i]);
			
			if(j != rid)
				slope[j].emplace_back(j*SZ+SZ-ls[i], a[i]);
		}
	}

	for(int k = 1; k <= __lg(n); k++){	
		for(int i = 1; i+(1<<k)-1 <= n; i++){
			sp[k][i] = max(sp[k-1][i], sp[k-1][i+(1<<(k-1))]);
		}
	}

	for(int i = 0; i <= n/SZ; i++){
		sort(all(slope[i]), greater<pair<int, ll>>());
	}
	
	for(int i = 0; i < qs; i++){
		cin>>q[i].t>>q[i].l>>q[i].r;
		q[i].id = i;
	}
	sort(q, q+qs);
	int t = -1;
	for(int tt = 0; tt < qs; tt++){
		auto [nt, l, r, qi] = q[tt];

		for(int j = t+1; j <= nt; j++){
			for(int i = 0; i <= n/SZ; i++){
				while(size(slope[i]) and slope[i].back().first <= j){
					curslope[i] += slope[i].back().second;
					slope[i].pop_back();
				}
				cursum[i] += curslope[i];
			}
		}
		t = nt;

		r++;
		int li = ((l+SZ-1)/SZ), ri = ((r)/SZ);

		if(li >= ri){
			for(int i = l; i < r; i++)
				ans[qi] += qu(max(1, i-t), i);
		}
		else{
			for(int i = l; i < li*SZ; i++)
				ans[qi] += qu(max(1, i-t), i);

			for(int i = ri*SZ; i < r; i++)
				ans[qi] += qu(max(1, i-t), i);

			for(int i = li; i < ri; i++)
				ans[qi] += cursum[i];
		}
	}

	for(int i = 0; i < qs; i++)
		cout<<ans[i]<<'\n';
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1260 KB Output is correct
3 Correct 1 ms 1260 KB Output is correct
4 Correct 1 ms 1260 KB Output is correct
5 Correct 1 ms 1260 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1260 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 2 ms 1260 KB Output is correct
11 Correct 1 ms 1260 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 1 ms 1260 KB Output is correct
15 Correct 1 ms 1260 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 1 ms 1260 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 1 ms 1260 KB Output is correct
21 Correct 1 ms 1260 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 1 ms 1260 KB Output is correct
24 Correct 1 ms 1260 KB Output is correct
25 Correct 1 ms 1260 KB Output is correct
26 Correct 1 ms 1260 KB Output is correct
27 Correct 2 ms 1260 KB Output is correct
28 Correct 2 ms 1260 KB Output is correct
29 Correct 1 ms 1260 KB Output is correct
30 Correct 1 ms 1260 KB Output is correct
31 Correct 1 ms 1260 KB Output is correct
32 Correct 1 ms 1260 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 997 ms 50144 KB Output is correct
3 Correct 860 ms 49576 KB Output is correct
4 Correct 870 ms 50188 KB Output is correct
5 Correct 924 ms 50968 KB Output is correct
6 Correct 716 ms 50456 KB Output is correct
7 Correct 977 ms 50544 KB Output is correct
8 Correct 791 ms 51276 KB Output is correct
9 Correct 753 ms 51052 KB Output is correct
10 Correct 746 ms 49644 KB Output is correct
11 Correct 881 ms 50864 KB Output is correct
12 Correct 808 ms 49772 KB Output is correct
13 Correct 684 ms 50664 KB Output is correct
14 Correct 725 ms 51052 KB Output is correct
15 Correct 821 ms 51048 KB Output is correct
16 Correct 702 ms 50668 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 575 ms 49344 KB Output is correct
3 Correct 553 ms 48364 KB Output is correct
4 Correct 660 ms 50540 KB Output is correct
5 Correct 454 ms 49004 KB Output is correct
6 Correct 582 ms 49340 KB Output is correct
7 Correct 448 ms 49260 KB Output is correct
8 Correct 446 ms 48620 KB Output is correct
9 Correct 458 ms 48108 KB Output is correct
10 Correct 616 ms 47600 KB Output is correct
11 Correct 702 ms 49644 KB Output is correct
12 Correct 448 ms 49260 KB Output is correct
13 Correct 715 ms 49516 KB Output is correct
14 Correct 584 ms 48236 KB Output is correct
15 Correct 475 ms 49772 KB Output is correct
16 Correct 791 ms 49388 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1038 ms 45556 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1260 KB Output is correct
3 Correct 1 ms 1260 KB Output is correct
4 Correct 1 ms 1260 KB Output is correct
5 Correct 1 ms 1260 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1260 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 2 ms 1260 KB Output is correct
11 Correct 1 ms 1260 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 1 ms 1260 KB Output is correct
15 Correct 1 ms 1260 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 1 ms 1260 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 1 ms 1260 KB Output is correct
21 Correct 1 ms 1260 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 1 ms 1260 KB Output is correct
24 Correct 1 ms 1260 KB Output is correct
25 Correct 1 ms 1260 KB Output is correct
26 Correct 1 ms 1260 KB Output is correct
27 Correct 2 ms 1260 KB Output is correct
28 Correct 2 ms 1260 KB Output is correct
29 Correct 1 ms 1260 KB Output is correct
30 Correct 1 ms 1260 KB Output is correct
31 Correct 1 ms 1260 KB Output is correct
32 Correct 1 ms 1260 KB Output is correct
33 Correct 997 ms 50144 KB Output is correct
34 Correct 860 ms 49576 KB Output is correct
35 Correct 870 ms 50188 KB Output is correct
36 Correct 924 ms 50968 KB Output is correct
37 Correct 716 ms 50456 KB Output is correct
38 Correct 977 ms 50544 KB Output is correct
39 Correct 791 ms 51276 KB Output is correct
40 Correct 753 ms 51052 KB Output is correct
41 Correct 746 ms 49644 KB Output is correct
42 Correct 881 ms 50864 KB Output is correct
43 Correct 808 ms 49772 KB Output is correct
44 Correct 684 ms 50664 KB Output is correct
45 Correct 725 ms 51052 KB Output is correct
46 Correct 821 ms 51048 KB Output is correct
47 Correct 702 ms 50668 KB Output is correct
48 Correct 575 ms 49344 KB Output is correct
49 Correct 553 ms 48364 KB Output is correct
50 Correct 660 ms 50540 KB Output is correct
51 Correct 454 ms 49004 KB Output is correct
52 Correct 582 ms 49340 KB Output is correct
53 Correct 448 ms 49260 KB Output is correct
54 Correct 446 ms 48620 KB Output is correct
55 Correct 458 ms 48108 KB Output is correct
56 Correct 616 ms 47600 KB Output is correct
57 Correct 702 ms 49644 KB Output is correct
58 Correct 448 ms 49260 KB Output is correct
59 Correct 715 ms 49516 KB Output is correct
60 Correct 584 ms 48236 KB Output is correct
61 Correct 475 ms 49772 KB Output is correct
62 Correct 791 ms 49388 KB Output is correct
63 Execution timed out 1038 ms 45556 KB Time limit exceeded
64 Halted 0 ms 0 KB -