Submission #416081

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
416081	2021-06-01T23:07:04 Z	meatrow	Coin Collecting (JOI19_ho_t4)	C++17	8 / 100	6 ms	4428 KB

joi2019_ho_t4

// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
 
const int MOD = 1e9 + 7;
 
ll binpow(ll a, ll p, int mod = MOD) {
    ll res = 1;
    while (p) {
        if (p & 1) {
            (res *= a) %= mod;
        }
        p >>= 1;
        (a *= a) %= mod;
    }
    return res;
}
 
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

const int N = 501;

ll dp[N][N];

void solve() {
    int n;
    cin >> n;
    n *= 2;
    vector<pair<ll, ll>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    
    sort(a.begin(), a.end());
    for (int i = 0; i <= n / 2; i++) {
        fill(dp[i], dp[i] + N, 1e18);
    }

    dp[0][0] = 0;
    for (int i = 0; i <= n / 2; i++) {
        for (int j = 0; j <= n / 2; j++) {
            if (i) {
                dp[i][j] = min(dp[i][j], dp[i - 1][j] + abs(a[i + j - 1].first - i) + abs(a[i + j - 1].second - 1));
            }
            if (j) {
                dp[i][j] = min(dp[i][j], dp[i][j - 1] + abs(a[i + j - 1].first - j) + abs(a[i + j - 1].second - 2));
            }
        }
    }

    cout << dp[n / 2][n / 2] << '\n';
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin >> T;
    for (int tc = 1; tc <= T; tc++) {
        // cout << "Case #" << tc << ": ";
        solve();
    }
    return 0;
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	472 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	324 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	2 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	324 KB	Output is correct
24	Correct	1 ms	324 KB	Output is correct
25	Correct	1 ms	324 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	328 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	320 KB	Output is correct
30	Correct	1 ms	328 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct

Subtask #2

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	472 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	324 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	2 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	324 KB	Output is correct
24	Correct	1 ms	324 KB	Output is correct
25	Correct	1 ms	324 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	328 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	320 KB	Output is correct
30	Correct	1 ms	328 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Runtime error	6 ms	4428 KB	Execution killed with signal 11
35	Halted	0 ms	0 KB	-

Subtask #3

0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	472 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	324 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	2 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	324 KB	Output is correct
24	Correct	1 ms	324 KB	Output is correct
25	Correct	1 ms	324 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	328 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	320 KB	Output is correct
30	Correct	1 ms	328 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Runtime error	6 ms	4428 KB	Execution killed with signal 11
35	Halted	0 ms	0 KB	-