제출 #1063975

#제출 시각아이디문제언어결과실행 시간메모리
1063975IgnutWiring (IOI17_wiring)C++17
7 / 100
131 ms262144 KiB
// Ignut #include <bits/stdc++.h> using namespace std; using ll = long long; const ll INF = 1e18 + 123; ll min_total_length(vector<int> r, vector<int> b) { int n = r.size(), m = b.size(); ll dp[n + 1][m + 1]; for (int i = 0; i <= n; i ++) for (int j = 0; j <= m; j ++) dp[i][j] = INF; dp[0][0] = 0; for (int i = 0; i <= n; i ++) { for (int j = 0; j <= m; j ++) { if (i < n && j > 0) dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + abs(r[i] - b[j - 1])); if (j < m && i > 0) dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + abs(r[i - 1] - b[j])); if (i < n && j < m) dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + abs(r[i] - b[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...