제출 #1149334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1149334		gazizmadi11	Coin Collecting (JOI19_ho_t4)	C++20	0 / 100	0 ms	328 KiB

joi2019_ho_t4

//gm  --- akezhon
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
#define int long long
using namespace std;

const int N=3e5+7;
const int mod=1e9+7;
const int inf=2e18;

void AlemAmenov(){
	int ans=0;
	int n;
	cin >> n;
	vector<pii>v, v2;
	for(int x, y, i=1; i <= n*2; i++){
		cin >> x >> y;
		if(y<=1){
			ans+=1-y;
			if(x < 1){
				ans += 1-x;
				v.pb({1, 1});
			}
			else if(n < x){
				ans += x-n;
				v.pb({n, 1});
			}
			else{
				v.pb({x, 1});
			}
		}
		else{
			ans+=y-2;
			if(x < 1){
				ans += 1-x;
				v.pb({1, 2});
			}
			else if(n < x){
				ans += x-n;
				v.pb({n, 2});
			}
			else{
				v.pb({x, 2});
			}
		}
	}
	sort(all(v));
	for(int i=0; i < n; i++){
		if(v[i*2].S == v[i*2+1].S)ans++;
		ans += abs(i+1 - v[i*2].F);
		ans += abs(i+1 - v[i*2+1].F);
	}
	cout << ans;
}
signed main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int RealName=1;
	// cin >> RealNam;
	// srand(time(0));

	while(RealName--)
		AlemAmenov();
	
return 0;
}

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