제출 #1161800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1161800		Zero_OP	Coin Collecting (JOI19_ho_t4)	C++20	8 / 100	703 ms	488 KiB

joi2019_ho_t4

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r) - 1; i >= (l); --i)

#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))

#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
bool minimize(T& a, const T& b){
      if(a > b) return a = b, true;
      return false;
}

template<typename T>
bool maximize(T& a, const T& b){
      if(a < b) return a = b, true;
      return false;
}

using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;

using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;

using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vd = vector<db>;

using vpi = vector<pi>;
using vpl = vector<pl>;

void setIO(){
      ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
      freopen("task.inp", "r", stdin);
      freopen("task.ans", "w", stdout);
#endif // LOCAL
}

ll dist(ll x1, ll y1, ll x2, ll y2){
      return abs(x1 - x2) + abs(y1 - y2);
}

int main(){
      setIO();

      int N;
      cin >> N;

      vi X(2 * N), Y(2 * N);
      ll base = 0;

      FOR(i, 0, 2*N){
            cin >> X[i] >> Y[i];

            tuple<ll, int, int> best(1e18, 0, 0);
            if(1 <= X[i] && X[i] <= N){
                  tuple<ll, int, int> U(dist(X[i], 2, X[i], Y[i]), X[i], 2);
                  tuple<ll, int, int> D(dist(X[i], 1, X[i], Y[i]), X[i], 1);
                  best = min(U, D);
            } else{
                  tuple<ll, int, int> DL(dist(1, 1, X[i], Y[i]), 1, 1);
                  tuple<ll, int, int> DR(dist(N, 1, X[i], Y[i]), N, 1);
                  tuple<ll, int, int> UL(dist(1, 2, X[i], Y[i]), 1, 2);
                  tuple<ll, int, int> UR(dist(N, 2, X[i], Y[i]), N, 2);

                  best = min({DL, DR, UL, UR});
            }

            ll cost; int x, y;
            tie(cost, x, y) = best;
            X[i] = x;
            Y[i] = y;
            base += cost;
      }

      vector<array<int, 2>> cnt(N);

      ll ans = LLONG_MAX;
      FOR(mask, 0, (1 << (2 * N))){
            vi a, b;
            ll result = 0;
            FOR(i, 0, 2 * N){
                  if(mask >> i & 1){
                        if(Y[i] == 2) a.pb(X[i]);
                        else b.pb(X[i]);
                        ++result;
                  } else{
                        if(Y[i] == 1) a.pb(X[i]);
                        else b.pb(X[i]);
                  }
            }

            if(sz(a) == N && sz(b) == N){
                  sort(all(a));
                  sort(all(b));

                  FOR(i, 0, N){
                        result += abs(i+1 - a[i]);
                        result += abs(i+1 - b[i]);
                  }
                  minimize(ans, result);
            }
      }
      cout << ans + base << '\n';

      return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63