Submission #705777

#	Time	Username	Problem	Language	Result	Execution time	Memory
705777		myrcella	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1 ms	328 KiB

joi2019_ho_t4

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 2e5+10;

int n;
ll x[maxn],y[maxn];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	rep(i,0,2*n) cin>>x[i]>>y[i];
	sort(x,x+2*n),sort(y,y+2*n);
	ll ans = 0;
	rep(i,0,n) {
		ans+=abs(x[2*i]-(i+1))+abs(x[2*i+1]-(i+1));
		ans+=abs(y[i]-1);
		ans+=abs(y[i+n]-2);
	}
	cout<<ans;
	return 0;
}

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