제출 #71009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
71009		funcsr	전선 연결 (IOI17_wiring)	C++17	7 / 100	217 ms	17192 KiB

wiring

#include "wiring.h"
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define INF (1LL<<60)
#define _1 first
#define _2 second
using namespace std;
typedef pair<int, int> P;
inline void chmin(long long &x, long long v) { if(x>v)x=v; }

int N;
long long dp[2][401][401];
long long cost[401];

long long min_total_length(vector<int> R, vector<int> B) {
  vector<P> all;
  for (int x : R) all.pb(P(x, 0));
  for (int x : B) all.pb(P(x, 1));
  sort(all(all));
  N = all.size();
  rep(i, N) {
    cost[i] = INF;
    if (all[i]._2 == 0) {
      auto it = lower_bound(all(B), all[i]._1);
      if (it != B.end()) chmin(cost[i], *it-all[i]._1);
      if (it != B.begin()) chmin(cost[i], all[i]._1-*(--it));
    }
    else {
      auto it = lower_bound(all(R), all[i]._1);
      if (it != R.end()) chmin(cost[i], *it-all[i]._1);
      if (it != R.begin()) chmin(cost[i], all[i]._1-*(--it));
    }
  }
  //rep(i,N)cout<<cost[i]<<",";cout<<"\n";

  rep(j, N+1) rep(k, N+1) dp[0][j][k] = INF;
  dp[0][0][0] = 0;
  rep(i, N) {
    rep(j, N+1) rep(k, N+1) dp[1][j][k] = INF;
    int pos = all[i]._1, color = all[i]._2;
    rep(j, N) {
      rep(k, N) {
        if (j > 0 && k > 0) continue;
        // [
        if (color == 0) chmin(dp[1][j+1][k], dp[0][j][k]-pos);
        if (color == 1) chmin(dp[1][j][k+1], dp[0][j][k]-pos);
        // ]
        if (color == 1 && j > 0) chmin(dp[1][j-1][k], dp[0][j][k]+pos);
        if (color == 0 && k > 0) chmin(dp[1][j][k-1], dp[0][j][k]+pos);
        // .
        chmin(dp[1][j][k], dp[0][j][k] + cost[i]);
      }
    }
    swap(dp[0], dp[1]);
  }
  return dp[0][0][0];
}

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