제출 #637325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
637325		boris_mihov	Wiring (IOI17_wiring)	C++17	0 / 100	17 ms	2772 KiB

wiring

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

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

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

    bl[lPtr][rPtr] = true;
    dp[lPtr][rPtr] = INF;
    dp[lPtr][rPtr] = std::min(dp[lPtr][rPtr], f(lPtr, rPtr + 1) + abs(r[lPtr] - b[rPtr]));
    dp[lPtr][rPtr] = std::min(dp[lPtr][rPtr], f(lPtr + 1, rPtr + 1) + abs(r[lPtr + 1] - b[rPtr]));
    
    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]; 
    }

	return f(1, 1);
}

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