Submission #496924

#	Time	Username	Problem	Language	Result	Execution time	Memory
496924		armashka	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1 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], cnt[N][3], ans;
vector <pll> v;
bool pr[N][3];

const void solve(/*Armashka*/) {
	cin >> n;
	//cout << "\n";
	for (int i = 1; i <= 2 * n; ++ i) {
		cin >> x[i] >> y[i];
		if (y[i] > 2) ans += abs(y[i] - 2), y[i] = 2;
		if (y[i] < 1) ans += abs(y[i] - 1), y[i] = 1;
		if (x[i] > n) ans += abs(x[i] - n), x[i] = n;
		if (x[i] < 1) ans += abs(x[i] - 1), x[i] = 1;
		++ cnt[x[i]][y[i]];
		//cout << x[i] << " " << y[i] << "\n";
		v.pb({y[i], x[i]});
	}
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= 2; ++ j) {
			pr[i][j] = pr[i - 1][j];
			if (cnt[i][j] > 1) pr[i][j] = 1;
		}
	}
	sort(all(v));
	//cout << ans << "\n";
	for (int k = 0; k < 2 * n; ++ k) {
		ll x = v[k].sd, y = v[k].ft;
		for (int i = 1; i <= n; ++ i) {
			if (cnt[i][y]) continue;
			if (cnt[x][y] == 1) break;
			++ cnt[i][y];
			-- cnt[x][y];
			ans += abs(x - i);
			if (cnt[x][y] == 1) break;
			ll y2 = 1;
			if (y == 1) y2 = 2;
			if (!pr[i][y2] && !cnt[i][y2]) {
				++ cnt[i][y2];
				-- cnt[x][y];
				ans += abs(x - i) + 1;
			}			
		}
		ll y2 = 1;
		if (y == 1) y2 = 2;		
		for (int i = 1; i <= n; ++ i) {
			if (cnt[i][y2]) continue;
			if (cnt[x][y] == 1) break;
			++ cnt[i][y2];
			-- cnt[x][y];
			ans += abs(x - i) + 1;			
		}
	}
	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
*/

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