oj.uz

답안 #251199

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251199 2020-07-20T14:47:03 Z ryansee 모임들 (IOI18_meetings) C++14
100 / 100
 3774 ms 604136 KB 
#include "meetings.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (750006)
ll n, A[MAXN];
pi sp[20][MAXN];
void build(){
	FOR(i,0,n-1)sp[0][i]=pi(A[i],i);
	FOR(h,1,19){
		for(ll i=0;i+(1<<h)<=n;++i){
			sp[h][i]=max(sp[h-1][i],sp[h-1][i+(1<<(h-1))]);
		}
	}
}
ll qry(ll x,ll y){
	ll h=__builtin_clz(y-x+1)^31;
	return max(sp[h][x],sp[h][y-(1<<h)+1]).s;
}
struct node {
	int s,e,m;
	pi v;
	ll add;
	node*l,*r;
	node(int S,int E){
		s=S,e=E,m=(s+e)>>1;
		v = pi(0, LLINF);
		add=0;
		if(s^e)l=new node(s,m),r=new node(m+1,e);
	}
	void update(int x,int y,ll nval){
		value();
		if(s==x&&e==y){
			add+=nval;
			return;
		}
		if(x>m)r->update(x,y,nval);
		else if(y<=m)l->update(x,y,nval);
		else l->update(x,m,nval),r->update(m+1,y,nval);
	}
	ll f(ll x,pi line) { return line.f*x+line.s; }
	void ins(int x,int y,pi line){
		value();
		if(s==x&&e==y){
			bool one=f(s,v) > f(s,line);
			bool two=f(m,v) > f(m,line);
			if(two) swap(v,line);
			if(s==e) return;
			if(f(s,v) <= f(s,line) && f(e,v) <= f(e,line))return;
			if(one==two){//right
				r->ins(m+1,y,line);
			}else{
				l->ins(x,m,line);
			}
			return;
		}
		if(x>m) r->ins(x,y,line);
		else if(y<=m) l->ins(x,y,line);
		else l->ins(x,m,line), r->ins(m+1,y,line);
	}
	ll rmq(int x){
		value();
		if(s==e) return f(x,v);
		if(x>m) return min(f(x,v),r->rmq(x));
		else return min(f(x,v),l->rmq(x));
	}
	void value(){
		v.s += add;
		if(s^e)l->add+=add,r->add+=add;
		add=0;
	}
} *l, *r;
vector<ll> ans;
vector<spi> v[MAXN];
void dnc(int s,int e){
	if(s>e) return;
	int m=qry(s,e);
	dnc(s,m-1), dnc(m+1,e);
	l->insert(m,m,pi(0,0)), r->insert(m,m,pi(0,0));
	for(auto i:v[m]){
		ans[i.f] = min(l->rmq(i.s.f)+(i.s.s-m+1)*A[m],r->rmq(i.s.s)+(m-i.s.f+1)*A[m]);
	}
	l->update(s,m,(e-m+1)*A[m]);
	l->ins(s,m,pi(-A[m],(m == e ? 0 : l->rmq(m+1))+(m+1)*A[m]));
	r->update(m,e,(m-s+1)*A[m]);
	r->ins(m,e,pi(A[m],(s == m ? 0 : r->rmq(m-1))-(m-1)*A[m]));
}
vector<ll> minimum_costs(std::vector<int> H, std::vector<int> L, std::vector<int> R) {
	n = H.size();
	FOR(i,0,n-1)A[i]=H[i];
	build();
	FOR(i,0,siz(L)-1)v[qry(L[i],R[i])].eb(i, pi(L[i],R[i]));		
	l=new node(0,n-1), r=new node(0,n-1);
	ans.resize(siz(L));
	dnc(0, n-1);
	return ans;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 17920 KB Output is correct
2 Correct 18 ms 19328 KB Output is correct
3 Correct 18 ms 19328 KB Output is correct
4 Correct 16 ms 19328 KB Output is correct
5 Correct 18 ms 19328 KB Output is correct
6 Correct 18 ms 19584 KB Output is correct
7 Correct 18 ms 19328 KB Output is correct
8 Correct 15 ms 19712 KB Output is correct
9 Correct 19 ms 19456 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 17920 KB Output is correct
2 Correct 18 ms 19328 KB Output is correct
3 Correct 18 ms 19328 KB Output is correct
4 Correct 16 ms 19328 KB Output is correct
5 Correct 18 ms 19328 KB Output is correct
6 Correct 18 ms 19584 KB Output is correct
7 Correct 18 ms 19328 KB Output is correct
8 Correct 15 ms 19712 KB Output is correct
9 Correct 19 ms 19456 KB Output is correct
10 Correct 26 ms 20680 KB Output is correct
11 Correct 25 ms 20672 KB Output is correct
12 Correct 26 ms 20736 KB Output is correct
13 Correct 24 ms 20736 KB Output is correct
14 Correct 23 ms 21120 KB Output is correct
15 Correct 25 ms 20736 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 17920 KB Output is correct
2 Correct 70 ms 26360 KB Output is correct
3 Correct 347 ms 85624 KB Output is correct
4 Correct 330 ms 77560 KB Output is correct
5 Correct 285 ms 85384 KB Output is correct
6 Correct 291 ms 86264 KB Output is correct
7 Correct 340 ms 89136 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 17920 KB Output is correct
2 Correct 70 ms 26360 KB Output is correct
3 Correct 347 ms 85624 KB Output is correct
4 Correct 330 ms 77560 KB Output is correct
5 Correct 285 ms 85384 KB Output is correct
6 Correct 291 ms 86264 KB Output is correct
7 Correct 340 ms 89136 KB Output is correct
8 Correct 341 ms 78600 KB Output is correct
9 Correct 263 ms 77792 KB Output is correct
10 Correct 278 ms 78596 KB Output is correct
11 Correct 317 ms 77648 KB Output is correct
12 Correct 263 ms 76848 KB Output is correct
13 Correct 276 ms 77816 KB Output is correct
14 Correct 331 ms 85640 KB Output is correct
15 Correct 340 ms 77228 KB Output is correct
16 Correct 350 ms 85496 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 17920 KB Output is correct
2 Correct 18 ms 19328 KB Output is correct
3 Correct 18 ms 19328 KB Output is correct
4 Correct 16 ms 19328 KB Output is correct
5 Correct 18 ms 19328 KB Output is correct
6 Correct 18 ms 19584 KB Output is correct
7 Correct 18 ms 19328 KB Output is correct
8 Correct 15 ms 19712 KB Output is correct
9 Correct 19 ms 19456 KB Output is correct
10 Correct 26 ms 20680 KB Output is correct
11 Correct 25 ms 20672 KB Output is correct
12 Correct 26 ms 20736 KB Output is correct
13 Correct 24 ms 20736 KB Output is correct
14 Correct 23 ms 21120 KB Output is correct
15 Correct 25 ms 20736 KB Output is correct
16 Correct 11 ms 17920 KB Output is correct
17 Correct 70 ms 26360 KB Output is correct
18 Correct 347 ms 85624 KB Output is correct
19 Correct 330 ms 77560 KB Output is correct
20 Correct 285 ms 85384 KB Output is correct
21 Correct 291 ms 86264 KB Output is correct
22 Correct 340 ms 89136 KB Output is correct
23 Correct 341 ms 78600 KB Output is correct
24 Correct 263 ms 77792 KB Output is correct
25 Correct 278 ms 78596 KB Output is correct
26 Correct 317 ms 77648 KB Output is correct
27 Correct 263 ms 76848 KB Output is correct
28 Correct 276 ms 77816 KB Output is correct
29 Correct 331 ms 85640 KB Output is correct
30 Correct 340 ms 77228 KB Output is correct
31 Correct 350 ms 85496 KB Output is correct
32 Correct 3214 ms 482400 KB Output is correct
33 Correct 2175 ms 480856 KB Output is correct
34 Correct 2340 ms 486416 KB Output is correct
35 Correct 3022 ms 485596 KB Output is correct
36 Correct 2131 ms 481164 KB Output is correct
37 Correct 2374 ms 486544 KB Output is correct
38 Correct 3025 ms 546916 KB Output is correct
39 Correct 2954 ms 547024 KB Output is correct
40 Correct 2807 ms 494708 KB Output is correct
41 Correct 3306 ms 602172 KB Output is correct
42 Correct 3774 ms 604108 KB Output is correct
43 Correct 3617 ms 604136 KB Output is correct
44 Correct 3460 ms 546736 KB Output is correct