Submission #889857

#	Time	Username	Problem	Language	Result	Execution time	Memory
889857		vjudge1	Coin Collecting (JOI19_ho_t4)	C++17	37 / 100	14 ms	17756 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")


typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back

const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+10;
const long long inf = 2e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }

ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}


void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

struct point {
	int x, y;
} a[2005];

ll distance(point a, point b) {
	return (ll)abs(a.x - b.x) + abs(a.y - b.y);
}

bool comp(point a, point b) {
	if(a.x == b.x) return a.y < b.y;
	return a.x < b.x;
}

ll dp[2005][2005];

void Baizho() {	
	int n; cin>>n;
	ll ans = 0;
	for(int i = 1; i <= n + n; i ++) {
		cin>>a[i].x>>a[i].y;
	}
	sort(a + 1, a + n + n + 1, comp);
	for(int i = 0; i <= n; i ++) for(int j = 0; j <= n; j ++) dp[i][j] = inf;
	dp[0][0] = 0;
	for(int i = 1; i <= n + n; i ++) {
		for(int x = 0; x <= min(i, n); x ++) {
			int y = i - x;
			if(x) dp[x][y] = min(dp[x][y], dp[x-1][y] + abs(a[i].x - x) + abs(a[i].y - 1));
			if(y) dp[x][y] = min(dp[x][y], dp[x][y - 1] + abs(a[i].x - y) + abs(a[i].y - 2));
		}
	}
//	for(int i = 0; i <= n; i ++) {
//		for(int j = 0; j <= n; j ++) cout<<dp[i][j]<<" ";
//		cout<<"\n";
//	}
	cout<<dp[n][n];
	
}
 
signed main() {		
 
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) { Baizho(); }
}

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'void Baizho()':
joi2019_ho_t4.cpp:54:5: warning: unused variable 'ans' [-Wunused-variable]
   54 |  ll ans = 0;
      |     ^~~
joi2019_ho_t4.cpp: In function 'void Freopen(std::string)':
joi2019_ho_t4.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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