oj.uz

답안 #533266

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533266 2022-03-05T08:17:35 Z koioi.org-koosaga Dungeon 3 (JOI21_ho_t5) C++17
11 / 100
 4000 ms 27760 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 query{
	int s, e; lint x; int idx;
};

struct bit{
	lint tree[MAXN];
	void add(int x, lint v){
		for(int i = x; i < MAXN; i += i & -i) tree[i] += v;
	}
	lint query(int x){
		lint ret = 0;
		for(int i = x; i; i -= i & -i) ret += tree[i];
		return ret;
	}
	lint query(int s, int e){ return query(e) - query(s - 1); }
}bit1, bit2;

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;

vector<lint> a, b;

void dnc1(vector<intv> &v, vector<query> &w, int s1, int e1, int s2, int e2, vector<lint> &ans){
	int j = 0;
	for(auto &q : w){
		while(j < sz(v) && a[v[j].e] - a[v[j].s - 2] < q.x) j++;
		for(int k = j; k < sz(v); k++){
			if(v[k].s > q.s && v[k].e <= q.e){
				ans[q.idx] += v[k].x * (a[v[k].e] - a[v[k].s - 2] - q.x);
			}
		}
	}
}

void dnc2(vector<intv> &v, vector<query> &w, int s1, int e1, int s2, int e2, vector<lint> &ans){
	int j = 0;
	for(auto &q : w){
		while(j < sz(v) && a[q.e] - q.x > a[v[j].s - 2]) j++;
		for(int k = 0; k < j; k++){
			if(v[k].s > q.s && v[k].e > q.e){
				ans[q.idx] += v[k].x * (a[q.e] - a[v[k].s - 2] - q.x);
			}
		}
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m;
	cin >> n >> m;
	a.resize(n + 1);
	b.resize(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});
		}
	}
	vector<lint> ans(m);
	vector<query> qry;
	for(int i = 0; i < m; i++){
		int s, e; lint x;
		cin >> s >> e >> x;
		e--;
		if(seg.query(s, e) > x){
			ans[i] = -1;
			continue;
		}
		qry.push_back({s, e, x, i});
	}
	sort(all(v), [&](const intv &a, const intv &b){
		return a.s < b.s;
	});
	sort(all(qry), [&](const query &a, const query &b){
		return a.s < b.s;
	});
	int pv = 0, pq = 0;
	for(int i = 1; i <= n; i++){
		while(pv < sz(v) && v[pv].s == i){
			bit1.add(v[pv].e, v[pv].x);
			bit2.add(v[pv].e, v[pv].x * a[v[pv].e]);
			pv++;
		}
		while(pq < sz(qry) && qry[pq].s == i){
			auto Q = qry[pq++];
			ans[Q.idx] += (a[Q.e] - a[Q.s - 1]) * bit1.query(Q.e, n);
			ans[Q.idx] += bit2.query(Q.s, Q.e - 1);
			ans[Q.idx] -= a[Q.s - 1] * bit1.query(Q.s, Q.e - 1);
		}
	}
	{
		vector<intv> nv;
		for(auto &i : v){
			if(i.s > 1) nv.push_back(i);
		}
		v = nv;
	}
	sort(all(v), [&](const intv &i, const intv &j){
		return a[i.e] - a[i.s - 2] < a[j.e] - a[j.s - 2];
	});
	sort(all(qry), [&](const query &a, const query &b){
		return a.x < b.x;
	});
	dnc1(v, qry, 0, sz(v) - 1, 0, sz(qry) - 1, ans);
	sort(all(v), [&](const intv &i, const intv &j){
		return i.s < j.s;
	});
	sort(all(qry), [&](const query &i, const query &j){
		return a[i.e] - i.x < a[j.e] - j.x;
	});
	dnc2(v, qry, 0, sz(v) - 1, 0, sz(qry) - 1, ans);
	for(auto &a : ans) cout << a << "\n";
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 804 KB Output is correct
2 Correct 21 ms 852 KB Output is correct
3 Correct 4 ms 840 KB Output is correct
4 Correct 19 ms 908 KB Output is correct
5 Correct 22 ms 864 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 16 ms 844 KB Output is correct
8 Correct 21 ms 856 KB Output is correct
9 Correct 4 ms 864 KB Output is correct
10 Correct 16 ms 852 KB Output is correct
11 Correct 24 ms 872 KB Output is correct
12 Correct 4 ms 880 KB Output is correct
13 Correct 18 ms 900 KB Output is correct
14 Correct 16 ms 920 KB Output is correct
15 Correct 16 ms 844 KB Output is correct
16 Correct 24 ms 856 KB Output is correct
17 Correct 14 ms 876 KB Output is correct
18 Correct 18 ms 844 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 30 ms 864 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
0 / 31.0

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

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 804 KB Output is correct
2 Correct 21 ms 852 KB Output is correct
3 Correct 4 ms 840 KB Output is correct
4 Correct 19 ms 908 KB Output is correct
5 Correct 22 ms 864 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 16 ms 844 KB Output is correct
8 Correct 21 ms 856 KB Output is correct
9 Correct 4 ms 864 KB Output is correct
10 Correct 16 ms 852 KB Output is correct
11 Correct 24 ms 872 KB Output is correct
12 Correct 4 ms 880 KB Output is correct
13 Correct 18 ms 900 KB Output is correct
14 Correct 16 ms 920 KB Output is correct
15 Correct 16 ms 844 KB Output is correct
16 Correct 24 ms 856 KB Output is correct
17 Correct 14 ms 876 KB Output is correct
18 Correct 18 ms 844 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 30 ms 864 KB Output is correct
21 Execution timed out 4006 ms 8004 KB Time limit exceeded
22 Halted 0 ms 0 KB -