제출 #1063884

#제출 시각아이디문제언어결과실행 시간메모리
1063884lakshith_전선 연결 (IOI17_wiring)C++14
0 / 100
5 ms8028 KiB
#include <bits/stdc++.h> using namespace std; int d(int x, int y) {return abs(x - y);} long long min_total_length(vector<int> r, vector<int> b) { int n = r.size(), m = b.size(); int dp[100001][20]; dp[0][0] = d(r[0], b[0]); const int block_size = 10; for(int i = 1; i < n; i++) dp[i][0] = dp[i-1][0] + d(r[i], b[0]); for(int i = 1; i < min(m, 10); i++) dp[0][i] = dp[0][i-1] + d(r[0], b[i]); for(int i = 1; i < n; i++) for(int j_index = -block_size; j_index < block_size; j_index++) { if (j_index+i >= 0 && j_index+i < m) { int j = j_index+i; dp[i][j] = min({dp[i-1][j], (j == 0 ? 0 : dp[i][j-1]), (j == 0 ? 0 : dp[i-1][j-1])}) + d(r[i], b[j]); } } 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...