제출 #704109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
704109		1075508020060209tc	Coin Collecting (JOI19_ho_t4)	C++14	8 / 100	13 ms	16212 KiB

joi2019_ho_t4

//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;
pair<int,int>ar[500005];
int dp[2010][1010];

int cst(pair<int,int>pt,int x,int y){
return abs(pt.X-x)+abs(pt.Y-y);
}

signed main(){

cin>>n;
for(int i=1;i<=n+n;i++){
    cin>>ar[i].X>>ar[i].Y;
}

for(int i=0;i<=2000;i++){
    for(int j=0;j<=1000;j++){
        dp[i][j]=1e12;
    }
}

sort(ar+1,ar+n+n+1);

dp[1][0]=cst(ar[1],1,1);
dp[1][1]=cst(ar[1],1,2);
for(int i=1;i<=n+n;i++){
    for(int j=0;j<=n;j++){
        dp[i+1][j]=min(dp[i+1][j],dp[i][j]+cst(ar[i+1],i+1-j,1));
        dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]+cst(ar[i+1],j+1,2));
    }
}
cout<<dp[n+n][n];

}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63