Submission #127197

#TimeUsernameProblemLanguageResultExecution timeMemory
127197RockyBCoin Collecting (JOI19_ho_t4)C++17
8 / 100
12 ms8316 KiB
/// In The Name Of God //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define f first #define s second #define pb push_back #define pp pop_back #define mp make_pair #define sz(x) (int)x.size() #define sqr(x) ((x) * 1ll * (x)) #define all(x) x.begin(), x.end() #define rep(i, l, r) for (int i = (l); i <= (r); i++) #define per(i, l, r) for (int i = (l); i >= (r); i--) #define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); #define nl '\n' #define ioi exit(0); typedef long long ll; typedef long double ld; typedef unsigned long long ull; const int N = (int)1000 + 7; const int inf = (int)1e9 + 7; const int mod = (int)1e9 + 7; const ll linf = (ll)1e18 + 7; const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}; const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1}; using namespace std; int n; pair <ll, ll> a[N]; ll dp[N][N]; ll dst(pair <ll, ll> x, pair <ll, ll> y) { return abs(x.f - y.f) + abs(x.s - y.s); } ll calc(int i = 0, int j = 0) { if (i == n && j == n) return 0; if (~dp[i][j]) return dp[i][j]; ll res = linf; pair <ll, ll> x = a[i + j + 1]; if (i < n) { res = min(res, calc(i + 1, j) + dst(x, {i + 1, 1})); } if (j < n) { res = min(res, calc(i, j + 1) + dst(x, {j + 1, 2})); } return dp[i][j] = res; } int main() { #ifdef IOI freopen ("in.txt", "r", stdin); #endif Kazakhstan cin >> n; rep(i, 1, n << 1) { cin >> a[i].f >> a[i].s; } sort (a + 1, a + n + n + 1); memset(dp, -1, sizeof(dp)); cout << calc(); ioi }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...