제출 #293451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293451		Dovran	모임들 (IOI18_meetings)	C++11	0 / 100	1 ms	384 KiB

meetings

#include <bits/stdc++.h>
#include "meetings.h"
#define N 100009
#define LL 1000000009
#define pii pair <int, int>
#define ff first
#define ss second
#define sz size
#define pb push_back
#define ll long long

using namespace std;

int n, v[N];
pii t[4*N];
pii T[N*4];

void bld(int nd, int l, int r){
	if(l==r){
		t[nd].ff=v[l];
		T[nd].ff=v[l];
		t[nd].ss=l;
		return;
	}
	
	int md=(l+r)/2;
	bld(nd*2, l, md);
	bld(nd*2+1, md+1, r);
	
	if(t[nd*2]<=t[nd*2+1])
		t[nd].ss=t[nd*2].ss;
	else
		t[nd].ss=t[nd*2+1].ss;
	
	t[nd].ff=min(t[nd*2].ff, t[nd*2+1].ff);
	T[nd].ff=max(T[nd*2].ff, T[nd*2+1].ff);
}

pii tap(int nd, int l, int r, int x, int y, int tp){
	if(l>=x and r<=y){
		if(!tp) return t[nd];
		return T[nd];
	}
	if(l>y or r<x){
		if(tp) return {0, 0};
		return {LL, LL};
	}

	int md=(l+r)/2;
	if(tp) return max(tap(nd*2, l, md, x, y, tp), tap(nd*2+1, md+1, r, x, y, tp));
		
	return min(tap(nd*2, l, md, x, y, tp), tap(nd*2+1, md+1, r, x, y, tp));
}

std::vector<ll> minimum_costs(std::vector<int>H, std::vector<int>L, std::vector<int>R){
	n=H.sz();
	for(int i=0; i<n; i++)
		v[i]=H[i];
	bld(1, 0, n-1);
	vector<ll>e;
	for(int i=0; i<(int)L.size(); i++){
		int l=L[i], r=R[i];
		ll ans=0;
		pii p=tap(1, 0, n-1, l, r, 0);
		for(int j=l; j<=r+1; j++)
			if(j<p.ss)
				ans+=tap(1, 0, n-1, j, p.ss-1, 1).ff;
			else if(j>p.ss)
				ans+=tap(1, 0, n-1, p.ss+1, j, 1).ff;
		e.pb(ans);
	}
	return e;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40