Submission #1035795

#	Time	Username	Problem	Language	Result	Execution time	Memory
1035795		ReLice	Wiring (IOI17_wiring)	C++17	0 / 100	2 ms	2652 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
#define ll int
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
template<class S,class T>
bool chmin(S &a,const T &b) {
	return a>b?(a=b)==b:false;
}
template<class S,class T>
bool chmax(S &a,const T &b) {
	return a<b?(a=b)==b:false;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e9;
const ll mod=1e9+7;
const ll N=3e5+7;
const ld eps=1e-9;
long long dp[N];
vll r,b,v;
ll c[N];
ll pref[N],suf[N];
ll dis(ll x,ll y){
	return abs(v[x]-v[y]);
}
long long min_total_length(vector<int> R, vector<int> B) {
	ll i;
	//setting up stuff
	r=R,b=B;
	for(auto i : r) v.pb(i);
	for(auto i : b) v.pb(i);
	r.pb(-1);
	b.pb(-1);
	sort(all(r));
	sort(all(b)); 
	v.pb(-1);
	sort(all(v));
	deque<pair<ll,ll>> seg;
	for(i=1;i<(ll)v.sz;i++){
		ll low=lb(all(r),v[i])-r.begin();
		if(low<(ll)r.sz && r[low]==v[i])c[i]=1;
		if(seg.sz==0 || c[i]!=c[i-1])seg.pb({i,i});
		else seg.bc.sc++;
	}
	
	memset(dp,0x3f,sizeof(dp));
	dp[0]=0;
	while(seg.sz>1){
		ll a=seg[0].fr,b=seg[0].sc,c=seg[1].fr,d=seg[1].sc;
		suf[b]=0;
		for(i=b-1;i>=a;i--){
			suf[i]=suf[i+1]+dis(i,b);
		}
		for(i=a;i<=b;i++){
			suf[i]+=dp[i-1];
			pref[i]=(i-a+1)*dis(b,c)+suf[i];
		}
		pref[c]=0;
		for(i=c;i<=d;i++){
			if(i<d)pref[i+1]=pref[i]+dis(i+1,c);
			if(b-(i-c)-1 >= a) dp[i]=pref[i]+min(suf[max(a,b-(i-c))]+dis(b,c)*(i-c+1), pref[b-(i-c)-1]);
			else dp[i]=pref[i]+suf[max(a,b-(i-c))]+dis(b,c)*(i-c+1);
		}
		seg.pof;
	}
	
	return dp[v.sz-1];
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45