Submission #208099

#	Time	Username	Problem	Language	Result	Execution time	Memory
208099		ToMmyDong	Coin Collecting (JOI19_ho_t4)	C++11	8 / 100	1077 ms	632 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#define Y second
#ifdef tmd
#define IOS()
#define debug(...) fprintf(stderr,"#%d: %s = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
template<typename It> ostream& _printRng(ostream &os,It bg,It ed)
{
    os<<"{";
    for(It it=bg;it!=ed;it++) {
        os<<(it==bg?"":",")<<*it;
    }
    os<<"}";
    return os;
}
template<typename T> ostream &operator << (ostream &os,vector<T> &v){return _printRng(os,v.begin(), v.end());}
template<typename T> void pary(T bg, T ed){_printRng(cerr,bg,ed);cerr<<endl;}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(...)
#define pary(...)
#endif

const int MAXN = 100005;
const ll MOD = 1000000007;

int n;
vector<pll> pos;

void solve (vector<int> x, ll &res) {
    sort(ALL(x));

    for (int i=1; i<=n; i++) {
        res += abs(x[i-1] - i);
    }
}

/*********************GoodLuck***********************/
int main () {
    IOS();

    cin >> n;

    vector<int> par;
    REP (i, n*2) {
        par.eb(i&1);
        int x, y;
        cin >> x >> y;
        pos.eb(x, y);
    }

    sort(ALL(par));

    ll ans = 0x3f3f3f3f3f3f3f3f;
    do {

        ll res = 0;
        vector<int> u, d;

        REP (i, n*2) {
            if (par[i]) {
                res += abs(pos[i].Y-1);
                u.eb(pos[i].X);
            } else {
                res += abs(pos[i].Y-2);
                d.eb(pos[i].X);
            }
        }

        solve(u,res);
        solve(d,res);

        ans = min(ans, res);


    } while (next_permutation(ALL(par)));

    cout << ans << endl;


}

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