Submission #637347

#	Time	Username	Problem	Language	Result	Execution time	Memory
637347		boris_mihov	전선 연결 (IOI17_wiring)	C++17	7 / 100	65 ms	5564 KiB

wiring

#include "wiring.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <set>

typedef long long llong;
const int MAXN = 1000 + 10;
const llong INF = 1e15;

int n, m;
llong r[MAXN];
llong b[MAXN];
llong val[MAXN];
bool bl[MAXN][MAXN];
llong dp[MAXN][MAXN];
llong f(int lPtr, int rPtr)
{
    if (lPtr == n && rPtr == m) return 0;
    if (lPtr == n || rPtr == m) return INF;
    if (bl[lPtr][rPtr]) return dp[lPtr][rPtr];

    bl[lPtr][rPtr] = true;
    dp[lPtr][rPtr] = INF;
    llong sum = 0;

    for (int i = lPtr + 1 ; i <= n ; ++i)
    {
        sum += abs(r[i] - b[rPtr + 1]);
        dp[lPtr][rPtr] = std::min(dp[lPtr][rPtr], f(i, rPtr + 1) + sum);
    }

    sum = 0;
    for (int i = rPtr + 1 ; i <= m ; ++i)
    {
        sum += abs(r[lPtr + 1] - b[i]);
        dp[lPtr][rPtr] = std::min(dp[lPtr][rPtr], f(lPtr + 1, i) + sum);
    }

    return dp[lPtr][rPtr];
}

long long min_total_length(std::vector <int> R, std::vector <int> B) 
{
    if (R.size() > B.size()) std::swap(R, B);
    n = R.size();
    m = B.size();
    for (int i = 1 ; i <= n ; ++i)
    {
        r[i] = R[i-1]; 
    }

    for (int i = 1 ; i <= m ; ++i)
    {
        b[i] = B[i-1]; 
    }

    int ptr = 1;
    for (int i = 1 ; i <= m ; ++i)
    {
        while (ptr + 1 <= n && r[ptr + 1] <= b[i]) ptr++;
        val[i] = abs(r[ptr] - b[i]);
        if (ptr + 1 <= n) val[i] = std::min(val[i], llabs(r[ptr + 1] - b[i]));
    }

	return f(0, 0);
}

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