oj.uz

답안 #485087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
485087 2021-11-06T06:50:23 Z wwdd 사탕 분배 (IOI21_candies) C++17
100 / 100
 793 ms 37104 KB 
#include "candies.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pl;
// bruh
class ST {
	private:
		int n,h;
		vl sa,sb,lz;
		const ll STA = -1LL<<62;
		const ll STB = 1LL<<62;
		int log2(int v) {
			if(v <= 1) return 1;
			return log2(v/2)+1;
		}
		void ap(int p, ll val) {
			sa[p] += val;
			sb[p] += val;
			if(p < n) {lz[p] += val;}
		}
		void build(int p) {
			while(p > 1) {
				p >>= 1;
				if(p >= n) continue;
				sa[p] = max(sa[p<<1],sa[p<<1|1])+lz[p];
				sb[p] = min(sb[p<<1],sb[p<<1|1])+lz[p];
			}
		}
		void psh(int p) {
			for(int s=h;s>0;s--) {
				int i = p>>s;
				if(lz[i] != 0) {
					ap(i<<1,lz[i]);
					ap(i<<1|1,lz[i]);
					lz[i] = 0;
				}
			}
		}
	public:
		ST(int _n) {
			n = _n;
			h = log2(n);
			sa.assign(2*n,0);
			sb.assign(2*n,0);
			lz.assign(n,0);
		}
		void up(int l, int r, ll val) {
			if(l >= r) return;
			l += n;r += n;
			int li = l,ri = r;
			for(;l<r;l>>=1,r>>=1) {
				if(l&1) {ap(l++,val);
				}
				if(r&1) {ap(--r,val);
				}
			}
			build(li);build(ri-1);
		}
		pl get(int l, int r) {
			l += n;r += n;
			psh(l);psh(r-1);
			ll ra = STA;
			ll rb = STB;
			for(;l<r;l>>=1,r>>=1) {
				if(l&1) {
					ra = max(ra,sa[l]);
					rb = min(rb,sb[l]);
					l++;
				}
				if(r&1) {
					--r;
					ra = max(ra,sa[r]);
					rb = min(rb,sb[r]);
				}
			}
			return {ra,rb};
		}
};



std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size();
	l.insert(l.begin(),0);
	l.insert(l.begin(),0);
	r.insert(r.begin(),n-1);
	r.insert(r.begin(),n-1);
	v.insert(v.begin(),-(1e9+7));
	v.insert(v.begin(),1e9+7);
	ll q = l.size();
	ST st(q);
	vector<vector<pl> > ops(n+1);
	for(int i=0;i<q;i++) {
		ops[l[i]].emplace_back(i,v[i]);
		ops[r[i]+1].emplace_back(i,-v[i]);
	}
    std::vector<int> ans(n);
	for(int i=0;i<n;i++) {
		for(const auto& op: ops[i]) {
			st.up(op.first,q,op.second);
		}
		ll fv = st.get(q-1,q).first;
		ll sv = 0,ev = q-1;
		ll ls = 0;
		while(sv <= ev) {
			ll m = (sv+ev)/2;
			pl val = st.get(m,q);
			if(val.first-val.second > c[i]) {
				ls = m;
				sv = m+1;
			} else {
				ev = m-1;
			}
		}
		pl val = st.get(ls,q);
		ll los = st.get(ls,ls+1).first;
		if(los == val.first) {
			ans[i] = fv-val.second;
		} else {
			ans[i] = fv-val.first+c[i];
		}
	}
    return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 588 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 736 ms 35180 KB Output is correct
2 Correct 782 ms 34416 KB Output is correct
3 Correct 793 ms 34324 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 219 ms 24740 KB Output is correct
3 Correct 148 ms 9792 KB Output is correct
4 Correct 665 ms 36260 KB Output is correct
5 Correct 732 ms 36656 KB Output is correct
6 Correct 705 ms 37104 KB Output is correct
7 Correct 668 ms 36388 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 114 ms 23096 KB Output is correct
4 Correct 136 ms 8672 KB Output is correct
5 Correct 443 ms 30216 KB Output is correct
6 Correct 416 ms 30828 KB Output is correct
7 Correct 395 ms 31492 KB Output is correct
8 Correct 444 ms 30096 KB Output is correct
9 Correct 448 ms 31620 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 736 ms 35180 KB Output is correct
7 Correct 782 ms 34416 KB Output is correct
8 Correct 793 ms 34324 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 219 ms 24740 KB Output is correct
11 Correct 148 ms 9792 KB Output is correct
12 Correct 665 ms 36260 KB Output is correct
13 Correct 732 ms 36656 KB Output is correct
14 Correct 705 ms 37104 KB Output is correct
15 Correct 668 ms 36388 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 114 ms 23096 KB Output is correct
19 Correct 136 ms 8672 KB Output is correct
20 Correct 443 ms 30216 KB Output is correct
21 Correct 416 ms 30828 KB Output is correct
22 Correct 395 ms 31492 KB Output is correct
23 Correct 444 ms 30096 KB Output is correct
24 Correct 448 ms 31620 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 149 ms 8808 KB Output is correct
27 Correct 214 ms 24324 KB Output is correct
28 Correct 740 ms 34964 KB Output is correct
29 Correct 736 ms 35276 KB Output is correct
30 Correct 737 ms 35540 KB Output is correct
31 Correct 684 ms 35704 KB Output is correct
32 Correct 671 ms 35944 KB Output is correct