Submission #496821

#	Time	Username	Problem	Language	Result	Execution time	Memory
496821		armashka	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1094 ms	332 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n, x[N], y[N];
vector <pair<ll, pll>> v;  

const void solve(/*Armashka*/) {
	cin >> n;
	for (int i = 0; i < n * 2; ++ i) cin >> x[i] >> y[i];
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= 2; ++ j) {
	    	v.pb({(j - 1) * n + i, {i, j}});
		}
	}
	ll ans = inf;
	do {
		ll res = 0;
		for (int i = 0; i < n * 2; ++ i) {
			ll dis = abs(x[i] - v[i].sd.ft) + abs(y[i] - v[i].sd.sd);
			res += dis;
		}			
		ans = min(ans, res);	
	}	
	while(next_permutation(all(v)));
	cout << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Compilation message (stderr)

joi2019_ho_t4.cpp:3: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      |

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