제출 #1257709

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

bridge

// #pragma optimize("Ofast")
#include "bits/stdc++.h"
#define int long long
#define FOR(i,x,y) for (int i = x; i < y; i++)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define em emplace_back
#define mp make_pair
#define F first
#define S second

using namespace std;
template<class C>
using vec = vector<C>;
using vi = vector<int>;
using vpi = vector<pair<int, int> >;
using pii = pair<int, int>;
#ifdef LOCAL
const int N = 15;
#else
const int N = 100001;
#endif

int k, n;
int s[N], t[N];
vi p;

int f(int i, int x) {
  return abs(s[i] - x) + abs(t[i] - x);
}

int calc(int x, int y) {
  int res = 0;
  FOR(i, 0, p.size()) {
    res += min(f(p[i], x), f(p[i], y));
  }
  return res;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> k >> n;
  if (k == 2) {
    vi pos;
    int add = 0;
    for (int i = 0, ptr = 0; i < n; i++, ptr++) {
      char a, b;
      cin >> a >> s[ptr] >> b >> t[ptr];
      if (a == b) {
        add += abs(s[ptr] - t[ptr]);
        ptr--;
        continue;
      }
      add += 1;
      pos.pb(s[ptr]);
      pos.pb(t[ptr]);
      p.pb((int)p.size());
    }
    sort(all(p), [&](int i, int j) {
      return s[i]+t[i] < s[j]+t[j];
    });
    sort(all(pos));
    int ans = LLONG_MAX;
    FOR(i, 1, pos.size()) {
      int l = 0, r = i - 1;
      while (l + 2 < r) {
        int mid = (l + r) >> 1;
        if (calc(pos[mid], pos[i]) > calc(pos[mid+1], pos[i]))
          l = mid;
        else
          r = mid;
      }
      FOR(j, l, r + 1)
        ans = min(ans, calc(pos[j], pos[i]));
    }
    if (ans == LLONG_MAX)
      ans = 0;
    cout << ans + add << '\n';
  } else {
    assert(0);
  }
}

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