제출 #842974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
842974		tch1cherin	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	392 KiB

bridge

#include <bits/stdc++.h>
using namespace std;

int main() {
  int K, N;
  cin >> K >> N;
  vector<int> P(N), Q(N);
  vector<int> A, B;
  long long ans = 0, tot = LLONG_MAX;
  vector<int> D;
  for (int i = 0; i < N; i++) {
    char X, Y;
    cin >> X >> P[i] >> Y >> Q[i];
    if (X > Y) {
      swap(X, Y);
    }
    if (X == Y) {
      ans += abs(P[i] - Q[i]);
    } else {
      D.push_back(P[i]);
      D.push_back(Q[i]);
      A.push_back(P[i]);
      B.push_back(Q[i]);
    }
  }
  P = A, Q = B;
  N = (int)P.size();
  if (K == 1) {
    for (int x : D) {
      long long res = 0;
      for (int i = 0; i < N; i++) {
        res += abs(P[i] - x) + abs(Q[i] - x) + 1;
      }
      tot = min(tot, ans + res);
    }
  } else {
    for (int x : D) {
      for (int y : D) {
        long long res = 0;
        for (int i = 0; i < N; i++) {
          res += min(abs(P[i] - x) + abs(Q[i] - x), abs(P[i] - y) + abs(Q[i] - y)) + 1; 
        }
        tot = min(tot, ans + res);
      }
    }
  }
  cout << tot << "\n";
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37