제출 #1061126

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1061126		vjudge1	전선 연결 (IOI17_wiring)	C++17	0 / 100	1 ms	348 KiB

wiring

#include <bits/stdc++.h>

using namespace std;

#define ll long long

ll min_total_length(vector<int> r, vector<int> b)
{
	ll n=r.size(),m=b.size();
	if (n<=200 && m<=200)
	{
		ll dp[n][m],inf = 1e9;
		for (int i=0;i<n;i++)
			for (int j=0;j<m;j++)
				dp[i][j]=inf*n*m;
		dp[0][0]=abs(r[0]-b[0]);
		for (int i=1;i<n;i++)
			dp[i][0]=dp[i-1][0]+abs(r[i]-b[0]);
		for (int i=1;i<m;i++)
			dp[0][i]=dp[0][i-1]+abs(r[0]-b[i]);
		for (int i=1;i<n;i++)
			for (int j=1;j<m;j++)
			{
				ll x=0,y=0;
				for (int k=j;k>=0;k--)
				{
					x+=abs(r[i]-b[k]);
					if (k)
						dp[i][j]=min(dp[i][j],x+dp[i-1][k-1]);
					else
						dp[i][j]=min(dp[i][j],x);
					if (k!=j)
						dp[i][j]=min(dp[i][j],dp[i][k]);
				}
				for (int k=i;k>=0;k--)
				{
					y+=abs(b[j]-r[k]);
					if (k)
						dp[i][j]=min(dp[i][j],y+dp[k-1][j-1]);
					else
						dp[i][j]=min(dp[i][j],y);
					if (k!=i)
						dp[i][j]=min(dp[i][j],dp[k][j]);
				}
			}
		return dp[n-1][m-1];
	}
}

컴파일 시 표준 에러 (stderr) 메시지

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^

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