제출 #282927

#제출 시각아이디문제언어결과실행 시간메모리
282927MKopchev전선 연결 (IOI17_wiring)C++14
7 / 100
65 ms6524 KiB
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2e2+42;

long long dp[nmax][nmax];

int n,red[nmax],m,blue[nmax];

long long min_total_length(std::vector<int> r, std::vector<int> b)
{
	n=r.size();
	m=b.size();

	for(int i=0;i<n;i++)
        red[i+1]=r[i];

    for(int j=0;j<m;j++)
        blue[j+1]=b[j];

    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++)
            if(i==0||j==0)
            {
                if(i==0&&j==0)dp[i][j]=0;
                else dp[i][j]=1e18;
            }
            else
            {
                dp[i][j]=abs(red[i]-blue[j])+min(dp[i-1][j-1],min(dp[i][j-1],dp[i-1][j]));
            }
    return dp[n][m];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...