Submission #236215

#	Time	Username	Problem	Language	Result	Execution time	Memory
236215		MarcoMeijer	Wiring (IOI17_wiring)	C++14	7 / 100	1092 ms	5136 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
 
//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e18
#define pb push_back
#define fi first
#define se second
#define sz size()
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;
vi pos, col;
bitset<MX> connected;
int n, m, N;
ll nxtC[MX];
ll dp[MX];
 
int gd(int i, int j) {
    return abs(pos[i] - pos[j]);
}
ll getCost(int x, int y, int cent) {
    ll ans = 0;
    RE(i,cent-x) ans -= pos[x+i];
    RE(i,y-cent+1) ans += pos[y-i];
    if(cent-x < y-cent+1) {
        ans += pos[cent - 1] * (2*cent - x - y - 1);
    } else {
        ans += pos[cent] * (2*cent - x - y - 1);
    } 
    return ans;
}
 
long long min_total_length(std::vector<int> r, std::vector<int> b) {
    n = r.sz, m = b.sz;
    N = n+m;
    {
        int i=0, j=0;
        while(i != n || j != m) {
            if(j == m || (i != n && r[i] < b[j])) {
                pos.pb(r[i++]);
                col.pb(0);
            } else {
                pos.pb(b[j++]);
                col.pb(1);
            }
        }
    }
 
    dp[0] = 0;
    int beg = -1, cent=-1, lastCol=-1;
    ll regionMin = INF;
    REP(i,1,N+1) {
        if(col[i-1] != lastCol) {
            lastCol = col[i-1];
            beg = cent;
            cent = i-1;
            regionMin = dp[i-1];
        }
        dp[i] = INF;
        ll mn = regionMin;
        if(beg == -1) continue;
        REV(j,beg,cent) {
            mn = min(mn, dp[j]);
            ll cst = getCost(j,i-1,cent);
            dp[i] = min(dp[i], mn+cst);
        }
        regionMin = min(regionMin, dp[i]);
    }
	return dp[N];
}

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