제출 #1112599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1112599		SalihSahin	전선 연결 (IOI17_wiring)	C++14	0 / 100	201 ms	262144 KiB

wiring

#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#include "wiring.h"

const long long inf = 1e17;
 
long long min_total_length(vector<int> r, vector<int> b) {
   int n = r.size(), m = b.size();
   vector<long long> mndisr(n), mndisb(m);
   int indb = 0, indr = 0;
   for(int i = 0; i < n; i++){
      while(indb + 1 < m && b[indb+1] < r[i]) indb++;
      mndisr[i] = min((long long)abs(r[i] - b[indb]), (indb + 1 < m ? (long long)abs(r[i] - b[indb+1]) : inf));
   }
 
   for(int i = 0; i < m; i++){
      while(indr + 1 < n && r[indr+1] < b[i]) indr++;
      mndisb[i] = min((long long)abs(b[i] - r[indr]), (indr + 1 < n ? (long long)abs(b[i] - r[indr+1]) : inf));
   }
 
   vector<vector<long long> > dp(n+1, vector<long long>(m+1, inf));
   dp[0][0] = 0;
   for(int i = 0; i <= n; i++){
      for(int j = 0; j <= m; j++){
         if(i == n && j == m) continue;
         if(j == m) dp[i+1][j] = min(dp[i+1][j], dp[i][j] + mndisr[i]);
         else if(i == n) dp[i][j+1] = min(dp[i][j+1], dp[i][j] + mndisb[j]);
         else 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];
}

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