제출 #593735

#제출 시각아이디문제언어결과실행 시간메모리
593735FatihSolak전선 연결 (IOI17_wiring)C++17
0 / 100
22 ms5828 KiB
#include "wiring.h" #include <bits/stdc++.h> #define N 205 using namespace std; long long dp[N][N]; vector<int> r,b; long long dist(int i,int j){ long long ret = abs(r[i] - b[j]); return ret; } long long min_total_length(vector<int> r_, vector<int> b_) { r = r_; b = b_; int n = r.size(),m = b.size(); for(int i = 0;i<n;i++){ for(int j = 0;j<m;j++){ dp[i][j] = 1e18; } } dp[0][0] = abs(r[0] - b[0]); for(int i = 0;i<n;i++){ for(int j = 0;j<m;j++){ if(i) dp[i][j] = min(dp[i][j],dp[i-1][j] + dist(i,j)); if(j) dp[i][j] = min(dp[i][j],dp[i][j-1] + dist(i,j)); if(i && j) dp[i][j] = min(dp[i][j],dp[i-1][j-1] + dist(i,j)); if(i+1 != n && j+1 != m && (b[j+1] > r[i+1] && b[j] < r[i+1]))break; } } return dp[n-1][m-1]; }
#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...