제출 #101902

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101902		briansu	전선 연결 (IOI17_wiring)	C++14	100 / 100	155 ms	16116 KiB

wiring

#include "wiring.h"

//{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef brian
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,multiset<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // brian
//}


const ll MAXn=2e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=ll(1e15);

ll dp[MAXn];

ll mdp(ll x){return min(dp[x], dp[x-1]);}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	vector<ii> v;
	for(ll x:r)v.pb(ii(x, 0));
	for(ll x:b)v.pb(ii(x, 1));
	sort(ALL(v));
	vector<ii> x, y;
	int it;
	for(it = 0;v[it].Y == v[0].Y;it++)x.pb({v[it].X, it+1});
	dp[0] = 0;
	REP1(i, SZ(v))dp[i] = INF;
	while(it != SZ(v))
	{
		ll lst = it;
		for(;it != SZ(v) && v[it].Y == v[lst].Y;it++)y.pb({v[it].X, it+1});
		sort(ALL(x), [](ii a,ii b){return a.X > b.X;});
		sort(ALL(y), [](ii a,ii b){return a.X < b.X;});
		debug(x, y);
		REP1(i, SZ(x) - 1)x[i].X += x[i-1].X;
		multiset<ll> st;
		for(int i = 0;i < SZ(x);i ++)st.insert(y[0].X * (i + 1) - x[i].X + mdp(x[i].Y));
		ll mn = INF, s = 0;
		for(int i = 0;i < SZ(y);i ++)
		{
			if(i < SZ(x))st.erase(st.lower_bound(y[0].X * (i + 1) - x[i].X + mdp(x[i].Y))), mn = min(mn, mdp(x[i].Y) + x[0].X * (i+1) - x[i].X);
			debug(i, mn, st);
			s += y[i].X;
			dp[y[i].Y] = mn + s - (i+1) * x[0].X;
			if(SZ(st))dp[y[i].Y] = min(dp[y[i].Y], (*st.begin()) + s - (i+1) * y[0].X);
		}
		x = y;
		y.clear();
	}
	REP1(i, SZ(v))debug(i, dp[i]);
	return dp[SZ(v)];	
}

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