Submission #1137919

#	Time	Username	Problem	Language	Result	Execution time	Memory
1137919		thelegendary08	Coin Collecting (JOI19_ho_t4)	C++17	37 / 100	184 ms	339968 KiB

joi2019_ho_t4

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
int dist(pii a, pii b){
	return abs(a.first-b.first) + abs(a.second-b.second);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	n *= 2;
	vpii v;
	f0r(i,n){
		in2(a,b);
		v.pb(mp(a,b));
	}
	sort(all(v));
	vvi dp(n, vi(n/2+1,4e18));
	dp[0][0] = dist(v[0], mp(1,2));
	dp[0][1] = dist(v[0], mp(1,1));
	
	FOR(i, 1, n){
		int ub = min(n/2+1, i+2);
		int lb = (i < n/2) ? 0 : i-n/2+1;
		//out3(i,lb,ub);
		for(int j = lb; j<ub; j++){
			int a = j;
			int b = i - j;
			dp[i][j] = dp[i-1][a] + dist(mp(b+1,2),v[i]);
			
			if(a > 0){
				dp[i][j] = min(dp[i][j], dp[i-1][a-1] + dist(mp(a,1), v[i]));
			}
		}
	}
	/*
	f0r(i,n){
		vout(dp[i]);
	}
	*/
	out(dp[n-1][n/2]);
}

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