제출 #407567

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

wiring

#include "wiring.h"

#include <bits/stdc++.h>
#define BALBIT
using namespace std;
#define ll long long
#define int ll
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif


const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 2e5+5;

int x[maxn];
bool tp[maxn];
int close[maxn];
int dp[maxn];

long long min_total_length(std::vector<signed> r, std::vector<signed> b) {
    vector<pii> gogo;
    int n = SZ(r), m = SZ(b);
    int N = n+m;
    REP(i,n) gogo.pb({r[i], 0});
    REP(i,m) gogo.pb({b[i], 1});
    sort(ALL(gogo));
    n = N;
    REP(i,N ) {
        x[i] = gogo[i].f; tp[i] = gogo[i].s;
    }
    ll c0 = -inf, c1 = -inf;
    REP(i,n) {
        if (tp[i] == 0) c0 = x[i], close[i] = x[i] - c1;
        else c1 = x[i], close[i] = x[i] - c0;
    }
    c0=c1=inf;
    RREP(i,n) {
        if (tp[i] == 0) c0 = x[i], MN(close[i] , c1 - x[i]);
        else c1 = x[i], MN(close[i], c0 - x[i]);
    }
    memset(dp, 0x3f, sizeof dp);
    dp[0] = 0;
    REP(i,n) {

        MN(dp[i+1], close[i] + dp[i]);
        ll tmp = 0;
        for (int j = 1; i+j<n && tp[i+j] != tp[i] && i-j+1>=0 && tp[i-j+1] == tp[i]; ++j) {
            tmp += x[i+j] - x[i-j+1];
            MN(dp[i+j+1], tmp + dp[i-j+1]);
        }
//        bug(dp[i+1],i);
    }

	return dp[n];
}

/*
4 5
1 2 3 7
0 4 5 9 10
*/

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