oj.uz

답안 #533245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533245 2022-03-05T07:45:26 Z koioi.org-koosaga Dungeon 3 (JOI21_ho_t5) C++17
11 / 100
 4000 ms 11196 KB 
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long lint;
typedef pair<lint, lint> pi;
const int mod = 1e9 + 7;
const int MAXN = 200050;
const int MAXT = 530000;

struct intv{
	int s, e; lint x;
};

struct seg{
	int tree[MAXT], lim;
	void init(int n){
		for(lim = 1; lim <= n; lim <<= 1);
	}
	void upd(int x, int v){
		for(int i = x+lim; i; i >>= 1){
			tree[i] = max(tree[i], v);
		}
	}
	int query(int s, int e){
		s += lim;
		e += lim;
		int ret = 0;
		while(s < e){
			if(s%2 == 1) ret = max(ret, tree[s++]);
			if(e%2 == 0) ret = max(ret, tree[e--]);
			s >>= 1;
			e >>= 1;
		}
		if(s == e) ret = max(ret, tree[s]);
		return ret;
	}
}seg;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m;
	cin >> n >> m;
	vector<lint> a(n + 1), b(n);
	seg.init(n);
	for(int i = 1; i <= n; i++){
		cin >> a[i], a[i] += a[i - 1];
		seg.upd(i, a[i] - a[i-1]);
	}
	for(int i = 0; i < n; i++) cin >> b[i];
	vector<intv> v;
	{
		vector<int> stk;
		vector<int> l(n), r(n);
		for(int i = 0; i < n; i++){
			while(sz(stk) && b[stk.back()] > b[i]){
				stk.pop_back();
			}
			l[i] = (sz(stk) ? stk.back() : -1);
			stk.push_back(i);
		}
		stk.clear();
		for(int i = n-1; i >= 0; i--){
			while(sz(stk) && b[stk.back()] >= b[i]){
				stk.pop_back();
			}
			r[i] = (sz(stk) ? stk.back() : n);
			stk.push_back(i);
		}
		stk.clear();
		for(int i = 0; i < n; i++){
			lint lo = 0;
			if(l[i] >= 0) lo = max(lo, b[l[i]]);
			if(r[i] < n) lo = max(lo, b[r[i]]);
			v.push_back({l[i] + 2, r[i], b[i] - lo});
		}
	}
	for(int i = 0; i < m; i++){
		int s, e; lint x;
		cin >> s >> e >> x;
		e--;
		if(seg.query(s, e) > x){
			cout << "-1\n";
			continue;
		}
		lint ret = 0;
		for(auto &j : v){
			if(j.s <= s){
				if(j.e >= e) ret += j.x * (a[e] - a[s - 1]);
				else if(j.e >= s) ret += j.x * (a[j.e] - a[s - 1]);
			}
			else{
				if(j.e >= e) ret += j.x * max(0ll, a[e] - a[j.s - 2] - x);
				else ret += j.x * max(0ll, a[j.e] - a[j.s - 2] - x);
			}
		}
		cout << ret << "\n";
	}
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 588 KB Output is correct
2 Correct 16 ms 676 KB Output is correct
3 Correct 14 ms 664 KB Output is correct
4 Correct 16 ms 648 KB Output is correct
5 Correct 15 ms 588 KB Output is correct
6 Correct 16 ms 688 KB Output is correct
7 Correct 21 ms 604 KB Output is correct
8 Correct 18 ms 588 KB Output is correct
9 Correct 14 ms 668 KB Output is correct
10 Correct 14 ms 632 KB Output is correct
11 Correct 13 ms 588 KB Output is correct
12 Correct 14 ms 664 KB Output is correct
13 Correct 15 ms 588 KB Output is correct
14 Correct 18 ms 668 KB Output is correct
15 Correct 19 ms 644 KB Output is correct
16 Correct 16 ms 588 KB Output is correct
17 Correct 13 ms 588 KB Output is correct
18 Correct 12 ms 640 KB Output is correct
19 Correct 11 ms 588 KB Output is correct
20 Correct 17 ms 664 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3315 ms 4040 KB Output is correct
2 Execution timed out 4035 ms 5028 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

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

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 588 KB Output is correct
2 Correct 16 ms 676 KB Output is correct
3 Correct 14 ms 664 KB Output is correct
4 Correct 16 ms 648 KB Output is correct
5 Correct 15 ms 588 KB Output is correct
6 Correct 16 ms 688 KB Output is correct
7 Correct 21 ms 604 KB Output is correct
8 Correct 18 ms 588 KB Output is correct
9 Correct 14 ms 668 KB Output is correct
10 Correct 14 ms 632 KB Output is correct
11 Correct 13 ms 588 KB Output is correct
12 Correct 14 ms 664 KB Output is correct
13 Correct 15 ms 588 KB Output is correct
14 Correct 18 ms 668 KB Output is correct
15 Correct 19 ms 644 KB Output is correct
16 Correct 16 ms 588 KB Output is correct
17 Correct 13 ms 588 KB Output is correct
18 Correct 12 ms 640 KB Output is correct
19 Correct 11 ms 588 KB Output is correct
20 Correct 17 ms 664 KB Output is correct
21 Correct 3315 ms 4040 KB Output is correct
22 Execution timed out 4035 ms 5028 KB Time limit exceeded
23 Halted 0 ms 0 KB -