oj.uz

Submission #99215

# Submission time Handle Problem Language Result Execution time Memory
99215 2019-03-01T18:16:21 Z eriksuenderhauf Wiring (IOI17_wiring) C++11
100 / 100
 133 ms 13380 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "wiring.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
const int MAXN = 4e5 + 5;
const double eps = 1e-9;
int n, m;
ll dp[2005][2005];
ll dp2[MAXN], sA[MAXN], sB[MAXN];
pii a[MAXN];
int vis[MAXN], tmp[MAXN];

long long min_total_length(vi r, vi b) {
    n = r.size(), m = b.size();
    if (n <= 2000 && m <= 2000) {
        for (int i = 1; i <= 2005; i++)
            dp[0][i] = INF, dp[i][0] = INF;
        dp[0][0] = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                dp[i][j] = min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1])) + abs(r[i - 1] - b[j - 1]);
        return dp[n][m];
    } else if (r.back() < b.front()) {
        ll ret = 0;
        for (int i = 0; i < n; i++)
            ret += r[n - 1] - r[i];
        for (int j = 0; j < m; j++)
            ret += b[j] - b[0];
        ret -= max(n, m) * ((ll) r.back() - (ll) b.front());
        return ret;
    }
    for (int i = 0; i < n; i++)
        a[i+1] = {r[i], -1}, vis[i+1] = -1, tmp[i+1] = -1;
    for (int j = 0; j < m; j++)
        a[j+1 + n] = {b[j], 1}, vis[j+1 + n] = -1, tmp[j+1 + n] = -1;
    for (int i = n + m + 1; i <= 2 * (n + m); i++)
        tmp[i] = vis[i] = -1;
    sort(a + 1, a + 1 + n + m);
    int cur = n + m;
    vis[n + m] = 0;
    for (int i = 1; i <= n + m; i++) {
        sA[i] = sA[i - 1], sB[i] = sB[i - 1];
        if (a[i].se == -1)
            sA[i] += a[i].fi, cur++;
        else
            sB[i] += a[i].fi, cur--;
        if (vis[cur] >= 0)
            tmp[i] = vis[cur];
        vis[cur] = i;
    }
    for (int i = 1; i <= n + m; i++) {
        int ret = 2e9;
        if (a[i].se == -1) {
            auto it = lower_bound(b.begin(), b.end(), a[i].fi);
            if (it != b.end())
                ret = min(ret, *it - a[i].fi);
            if (it != b.begin())
                ret = min(ret, a[i].fi - *(--it));
        } else {
            auto it = lower_bound(r.begin(), r.end(), a[i].fi);
            if (it != r.end())
                ret = min(ret, *it - a[i].fi);
            if (it != r.begin())
                ret = min(ret, a[i].fi - *(--it));
        }
        dp2[i] = dp2[i - 1] + ret;
        if (tmp[i] != -1)
            dp2[i] = min(dp2[i], dp2[tmp[i]] + abs(sA[i] - sA[tmp[i]] - sB[i] + sB[tmp[i]]));
    }
    return dp2[n + m];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:41:22: warning: iteration 2004 invokes undefined behavior [-Waggressive-loop-optimizations]
             dp[0][i] = INF, dp[i][0] = INF;
             ~~~~~~~~~^~~~~
wiring.cpp:40:27: note: within this loop
         for (int i = 1; i <= 2005; i++)
                         ~~^~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8448 KB Output is correct
2 Correct 8 ms 8448 KB Output is correct
3 Correct 10 ms 8448 KB Output is correct
4 Correct 8 ms 8448 KB Output is correct
5 Correct 8 ms 8448 KB Output is correct
6 Correct 8 ms 8448 KB Output is correct
7 Correct 9 ms 8704 KB Output is correct
8 Correct 9 ms 8704 KB Output is correct
9 Correct 9 ms 8704 KB Output is correct
10 Correct 9 ms 8704 KB Output is correct
11 Correct 10 ms 8708 KB Output is correct
12 Correct 8 ms 8704 KB Output is correct
13 Correct 10 ms 8704 KB Output is correct
14 Correct 10 ms 8704 KB Output is correct
15 Correct 9 ms 8704 KB Output is correct
16 Correct 10 ms 8704 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8448 KB Output is correct
2 Correct 8 ms 8576 KB Output is correct
3 Correct 30 ms 2936 KB Output is correct
4 Correct 29 ms 3064 KB Output is correct
5 Correct 29 ms 3064 KB Output is correct
6 Correct 51 ms 3832 KB Output is correct
7 Correct 37 ms 3832 KB Output is correct
8 Correct 38 ms 3832 KB Output is correct
9 Correct 62 ms 3832 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8512 KB Output is correct
2 Correct 8 ms 8448 KB Output is correct
3 Correct 75 ms 13240 KB Output is correct
4 Correct 72 ms 12920 KB Output is correct
5 Correct 9 ms 8576 KB Output is correct
6 Correct 10 ms 8420 KB Output is correct
7 Correct 10 ms 8476 KB Output is correct
8 Correct 8 ms 8448 KB Output is correct
9 Correct 8 ms 8448 KB Output is correct
10 Correct 9 ms 8576 KB Output is correct
11 Correct 8 ms 8448 KB Output is correct
12 Correct 8 ms 8448 KB Output is correct
13 Correct 8 ms 8472 KB Output is correct
14 Correct 9 ms 8448 KB Output is correct
15 Correct 8 ms 8448 KB Output is correct
16 Correct 9 ms 8576 KB Output is correct
17 Correct 9 ms 8548 KB Output is correct
18 Correct 67 ms 13248 KB Output is correct
19 Correct 74 ms 13228 KB Output is correct
20 Correct 76 ms 13380 KB Output is correct
21 Correct 80 ms 13176 KB Output is correct
22 Correct 85 ms 13176 KB Output is correct
23 Correct 76 ms 13260 KB Output is correct
24 Correct 71 ms 13276 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8448 KB Output is correct
2 Correct 56 ms 12536 KB Output is correct
3 Correct 67 ms 12504 KB Output is correct
4 Correct 72 ms 12536 KB Output is correct
5 Correct 66 ms 12540 KB Output is correct
6 Correct 8 ms 8448 KB Output is correct
7 Correct 8 ms 8448 KB Output is correct
8 Correct 9 ms 8448 KB Output is correct
9 Correct 9 ms 8448 KB Output is correct
10 Correct 8 ms 8448 KB Output is correct
11 Correct 9 ms 8448 KB Output is correct
12 Correct 9 ms 8448 KB Output is correct
13 Correct 10 ms 8448 KB Output is correct
14 Correct 8 ms 8448 KB Output is correct
15 Correct 9 ms 8548 KB Output is correct
16 Correct 8 ms 8448 KB Output is correct
17 Correct 9 ms 8576 KB Output is correct
18 Correct 68 ms 12508 KB Output is correct
19 Correct 63 ms 12564 KB Output is correct
20 Correct 65 ms 12568 KB Output is correct
21 Correct 63 ms 12592 KB Output is correct
22 Correct 58 ms 12536 KB Output is correct
23 Correct 58 ms 12536 KB Output is correct
24 Correct 59 ms 12532 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8448 KB Output is correct
2 Correct 8 ms 8448 KB Output is correct
3 Correct 10 ms 8448 KB Output is correct
4 Correct 8 ms 8448 KB Output is correct
5 Correct 8 ms 8448 KB Output is correct
6 Correct 8 ms 8448 KB Output is correct
7 Correct 9 ms 8704 KB Output is correct
8 Correct 9 ms 8704 KB Output is correct
9 Correct 9 ms 8704 KB Output is correct
10 Correct 9 ms 8704 KB Output is correct
11 Correct 10 ms 8708 KB Output is correct
12 Correct 8 ms 8704 KB Output is correct
13 Correct 10 ms 8704 KB Output is correct
14 Correct 10 ms 8704 KB Output is correct
15 Correct 9 ms 8704 KB Output is correct
16 Correct 10 ms 8704 KB Output is correct
17 Correct 8 ms 8448 KB Output is correct
18 Correct 8 ms 8576 KB Output is correct
19 Correct 30 ms 2936 KB Output is correct
20 Correct 29 ms 3064 KB Output is correct
21 Correct 29 ms 3064 KB Output is correct
22 Correct 51 ms 3832 KB Output is correct
23 Correct 37 ms 3832 KB Output is correct
24 Correct 38 ms 3832 KB Output is correct
25 Correct 62 ms 3832 KB Output is correct
26 Correct 8 ms 8512 KB Output is correct
27 Correct 8 ms 8448 KB Output is correct
28 Correct 75 ms 13240 KB Output is correct
29 Correct 72 ms 12920 KB Output is correct
30 Correct 9 ms 8576 KB Output is correct
31 Correct 10 ms 8420 KB Output is correct
32 Correct 10 ms 8476 KB Output is correct
33 Correct 8 ms 8448 KB Output is correct
34 Correct 8 ms 8448 KB Output is correct
35 Correct 9 ms 8576 KB Output is correct
36 Correct 8 ms 8448 KB Output is correct
37 Correct 8 ms 8448 KB Output is correct
38 Correct 8 ms 8472 KB Output is correct
39 Correct 9 ms 8448 KB Output is correct
40 Correct 8 ms 8448 KB Output is correct
41 Correct 9 ms 8576 KB Output is correct
42 Correct 9 ms 8548 KB Output is correct
43 Correct 67 ms 13248 KB Output is correct
44 Correct 74 ms 13228 KB Output is correct
45 Correct 76 ms 13380 KB Output is correct
46 Correct 80 ms 13176 KB Output is correct
47 Correct 85 ms 13176 KB Output is correct
48 Correct 76 ms 13260 KB Output is correct
49 Correct 71 ms 13276 KB Output is correct
50 Correct 7 ms 8448 KB Output is correct
51 Correct 56 ms 12536 KB Output is correct
52 Correct 67 ms 12504 KB Output is correct
53 Correct 72 ms 12536 KB Output is correct
54 Correct 66 ms 12540 KB Output is correct
55 Correct 8 ms 8448 KB Output is correct
56 Correct 8 ms 8448 KB Output is correct
57 Correct 9 ms 8448 KB Output is correct
58 Correct 9 ms 8448 KB Output is correct
59 Correct 8 ms 8448 KB Output is correct
60 Correct 9 ms 8448 KB Output is correct
61 Correct 9 ms 8448 KB Output is correct
62 Correct 10 ms 8448 KB Output is correct
63 Correct 8 ms 8448 KB Output is correct
64 Correct 9 ms 8548 KB Output is correct
65 Correct 8 ms 8448 KB Output is correct
66 Correct 9 ms 8576 KB Output is correct
67 Correct 68 ms 12508 KB Output is correct
68 Correct 63 ms 12564 KB Output is correct
69 Correct 65 ms 12568 KB Output is correct
70 Correct 63 ms 12592 KB Output is correct
71 Correct 58 ms 12536 KB Output is correct
72 Correct 58 ms 12536 KB Output is correct
73 Correct 59 ms 12532 KB Output is correct
74 Correct 54 ms 13304 KB Output is correct
75 Correct 65 ms 12792 KB Output is correct
76 Correct 65 ms 13276 KB Output is correct
77 Correct 66 ms 12664 KB Output is correct
78 Correct 59 ms 12600 KB Output is correct
79 Correct 69 ms 12640 KB Output is correct
80 Correct 74 ms 12672 KB Output is correct
81 Correct 66 ms 12664 KB Output is correct
82 Correct 51 ms 12664 KB Output is correct
83 Correct 50 ms 12920 KB Output is correct
84 Correct 56 ms 13308 KB Output is correct
85 Correct 116 ms 13224 KB Output is correct
86 Correct 83 ms 13304 KB Output is correct
87 Correct 61 ms 13184 KB Output is correct
88 Correct 63 ms 13180 KB Output is correct
89 Correct 63 ms 13304 KB Output is correct
90 Correct 111 ms 13304 KB Output is correct
91 Correct 70 ms 13304 KB Output is correct
92 Correct 64 ms 13200 KB Output is correct
93 Correct 57 ms 13304 KB Output is correct
94 Correct 58 ms 13176 KB Output is correct
95 Correct 58 ms 13176 KB Output is correct
96 Correct 58 ms 13304 KB Output is correct
97 Correct 61 ms 13304 KB Output is correct
98 Correct 51 ms 13176 KB Output is correct
99 Correct 56 ms 13352 KB Output is correct
100 Correct 67 ms 13176 KB Output is correct
101 Correct 133 ms 13276 KB Output is correct
102 Correct 64 ms 13304 KB Output is correct