oj.uz

답안 #169088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
169088 2019-12-18T11:13:52 Z srvlt Coin Collecting (JOI19_ho_t4) C++14
37 / 100
 137 ms 55044 KB 
//#pragma GCC target ("avx2,sse2")
//#pragma GCC optimization ("Ofast")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree <pair <ll, int>, null_type, less <pair <ll, int> >, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define db double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define fi first
#define se second
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define endl "\n"

#define left fsdsdfoisf
#define sum dpsdfioppsf
#define assign xcvjlkdjfio
#define trie fksdfkjkfnjuiv
#define next sidlfjsfkl
#define merge sdfksdkfsldf

#define int long long

using namespace std;

void dout() {
    cerr << endl;
}
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;

const int N = 2007, inf = 1e18;
int n, dp[N][N];
vector <pii> v;

void solve(int tc) {
    // check for (int i = 0; i < n; j++)
    cin >> n;
    n *= 2;
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        v.pb({x, y});
    }
    sort(all(v));
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= i; j++) {
            dp[i][j] = inf;
            if (j < i) {
                dp[i][j] = min(dp[i][j], dp[i - 1][j] + abs(2 - v[i - 1].se) + abs(i - j - v[i - 1].fi));
            }
            if (j > 0) {
                dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + abs(1 - v[i - 1].se) + abs(j - v[i - 1].fi));
            }
        }
    }
    cout << dp[n][n / 2];
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 416 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 428 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 380 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 416 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 428 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 380 KB Output is correct
34 Correct 29 ms 23160 KB Output is correct
35 Correct 30 ms 23260 KB Output is correct
36 Correct 29 ms 23160 KB Output is correct
37 Correct 30 ms 23196 KB Output is correct
38 Correct 29 ms 23160 KB Output is correct
39 Correct 30 ms 23160 KB Output is correct
40 Correct 30 ms 23092 KB Output is correct
41 Correct 29 ms 23160 KB Output is correct
42 Correct 30 ms 23160 KB Output is correct
43 Correct 29 ms 23160 KB Output is correct
44 Correct 29 ms 23160 KB Output is correct
45 Correct 30 ms 23160 KB Output is correct
46 Correct 29 ms 23160 KB Output is correct
47 Correct 29 ms 23228 KB Output is correct
48 Correct 30 ms 23160 KB Output is correct
49 Correct 30 ms 23184 KB Output is correct
50 Correct 30 ms 23160 KB Output is correct
51 Correct 30 ms 23160 KB Output is correct
52 Correct 30 ms 23160 KB Output is correct
53 Correct 29 ms 23160 KB Output is correct
54 Correct 29 ms 23160 KB Output is correct
55 Correct 29 ms 23160 KB Output is correct
56 Correct 29 ms 23160 KB Output is correct
57 Correct 30 ms 23160 KB Output is correct
58 Correct 29 ms 23160 KB Output is correct
59 Correct 29 ms 23160 KB Output is correct
60 Correct 29 ms 23160 KB Output is correct
61 Correct 29 ms 23160 KB Output is correct
62 Correct 29 ms 23284 KB Output is correct
63 Correct 29 ms 23160 KB Output is correct
64 Correct 29 ms 23160 KB Output is correct

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 416 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 428 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 380 KB Output is correct
34 Correct 29 ms 23160 KB Output is correct
35 Correct 30 ms 23260 KB Output is correct
36 Correct 29 ms 23160 KB Output is correct
37 Correct 30 ms 23196 KB Output is correct
38 Correct 29 ms 23160 KB Output is correct
39 Correct 30 ms 23160 KB Output is correct
40 Correct 30 ms 23092 KB Output is correct
41 Correct 29 ms 23160 KB Output is correct
42 Correct 30 ms 23160 KB Output is correct
43 Correct 29 ms 23160 KB Output is correct
44 Correct 29 ms 23160 KB Output is correct
45 Correct 30 ms 23160 KB Output is correct
46 Correct 29 ms 23160 KB Output is correct
47 Correct 29 ms 23228 KB Output is correct
48 Correct 30 ms 23160 KB Output is correct
49 Correct 30 ms 23184 KB Output is correct
50 Correct 30 ms 23160 KB Output is correct
51 Correct 30 ms 23160 KB Output is correct
52 Correct 30 ms 23160 KB Output is correct
53 Correct 29 ms 23160 KB Output is correct
54 Correct 29 ms 23160 KB Output is correct
55 Correct 29 ms 23160 KB Output is correct
56 Correct 29 ms 23160 KB Output is correct
57 Correct 30 ms 23160 KB Output is correct
58 Correct 29 ms 23160 KB Output is correct
59 Correct 29 ms 23160 KB Output is correct
60 Correct 29 ms 23160 KB Output is correct
61 Correct 29 ms 23160 KB Output is correct
62 Correct 29 ms 23284 KB Output is correct
63 Correct 29 ms 23160 KB Output is correct
64 Correct 29 ms 23160 KB Output is correct
65 Runtime error 137 ms 55044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
66 Halted 0 ms 0 KB -