oj.uz

Submission #236094

# Submission time Handle Problem Language Result Execution time Memory
236094 2020-05-31T07:44:27 Z abacaba Wiring (IOI17_wiring) C++14
100 / 100
 54 ms 13432 KB 
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
using namespace std;

#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define emb emplace_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>

inline void setin(string s) {
	freopen(s.c_str(), "r", stdin);
}

inline void setout(string s) {
	freopen(s.c_str(), "w", stdout);
}

template <typename T> void Min(T &a, T b) {
    a = min(a, b);
}

template <typename T> void Max(T &a, T b) {
    a = max(a, b);
}

const ll inf = 2e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 15;
int n, m;
pii a[N];
ll p[N];

vector <ll> dp[N];

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    n = r.size(), m = b.size();
    int sz = 0;
    for(int i = 0, j = 0; i < r.size(); ++i) {
        while(j < b.size() && b[j] < r[i])
            a[++sz] = {2, b[j++]};
        a[++sz] = {1, r[i]};
        if(i + 1 == r.size()) {
            for(; j < b.size(); ++j)
                a[++sz] = {2, b[j]};
        }
    }
    n = sz;
    int g = 1;
    dp[0].pb(0);

    for(int i = 1; i <= n; ++i)
        p[i] = p[i-1] + a[i].se;

    for(int i = 1; i <= n; ++i, ++g) {
        int j = i;
        while(j + 1 <= n && a[j + 1].f == a[j].f)
            ++j;
        int k = j + 1;
        if(k == n + 1)
            break;
        while(k + 1 <= n && a[k + 1].f == a[k].f)
            ++k;
        int len[2] = {j - i + 1, k - j};

        if(g == 1)
            dp[g].resize(len[0] + 2, inf);
        dp[g + 1].resize(len[1] + 2, inf);

        dp[g][len[0]] = dp[g - 1][0];
        for(int l = len[0]; l; --l) {
            Min(dp[g][l - 1], dp[g][l] + (a[j + 1].se - a[j - l + 1].se));
            if(l <= len[1]) {
                ll val = 1ll * l * a[j].se - (p[j] - p[j - l]);
                val += (p[j + l] - p[j]) - 1ll * l * a[j + 1].se;
                val += 1ll * l * (a[j + 1].se - a[j].se);
                // for(int t = j - l + 1; t <= j; ++t)
                //     val += a[j].se - a[t].se;
                // for(int t = j + 1; t <= j + l; ++t)
                //     val += a[t].se - a[j + 1].se;

                // val += 1ll * l * (a[j + 1].se - a[j].se);

                Min(dp[g + 1][len[1] - l], dp[g][l] + val);
            }
        }
        for(int l = len[1]; l; --l) {
            Min(dp[g + 1][l - 1], dp[g + 1][l] + (a[k - l + 1].se - a[j].se));
            if(l <= len[0]) {
                ll val = 1ll * a[j].se * l - (p[j] - p[j - l]);
                val += (p[k] - p[k - l]) - 1ll * a[j + 1].se * l;
                val += 1ll * l * (a[j + 1].se - a[j].se);
                // for(int t = j - l + 1; t <= j; ++t)
                //     val += a[j].se - a[t].se;
                // for(int t = k - l + 1; t <= k; ++t)
                //     val += a[t].se - a[j + 1].se;

                // val += 1ll * l * (a[j + 1].se - a[j].se);

                Min(dp[g + 1][0], dp[g + 1][l] + val);
            }
        }
        i = j;
    }
    return dp[g][0];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:68:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0, j = 0; i < r.size(); ++i) {
                           ~~^~~~~~~~~~
wiring.cpp:69:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(j < b.size() && b[j] < r[i])
               ~~^~~~~~~~~~
wiring.cpp:72:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i + 1 == r.size()) {
            ~~~~~~^~~~~~~~~~~
wiring.cpp:73:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(; j < b.size(); ++j)
                   ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 36 ms 9720 KB Output is correct
4 Correct 36 ms 11128 KB Output is correct
5 Correct 36 ms 11136 KB Output is correct
6 Correct 44 ms 13176 KB Output is correct
7 Correct 45 ms 13176 KB Output is correct
8 Correct 45 ms 13228 KB Output is correct
9 Correct 44 ms 13180 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 53 ms 13048 KB Output is correct
4 Correct 46 ms 12408 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 8 ms 4992 KB Output is correct
11 Correct 8 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 7 ms 4992 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 51 ms 12792 KB Output is correct
19 Correct 50 ms 12792 KB Output is correct
20 Correct 48 ms 12280 KB Output is correct
21 Correct 54 ms 12920 KB Output is correct
22 Correct 50 ms 12664 KB Output is correct
23 Correct 52 ms 12664 KB Output is correct
24 Correct 50 ms 12664 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 38 ms 11244 KB Output is correct
3 Correct 45 ms 13176 KB Output is correct
4 Correct 47 ms 12584 KB Output is correct
5 Correct 40 ms 13048 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 37 ms 12544 KB Output is correct
19 Correct 39 ms 12536 KB Output is correct
20 Correct 38 ms 12536 KB Output is correct
21 Correct 38 ms 12536 KB Output is correct
22 Correct 40 ms 12536 KB Output is correct
23 Correct 37 ms 12536 KB Output is correct
24 Correct 38 ms 12536 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 8 ms 4992 KB Output is correct
12 Correct 8 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 8 ms 4992 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 7 ms 4992 KB Output is correct
19 Correct 36 ms 9720 KB Output is correct
20 Correct 36 ms 11128 KB Output is correct
21 Correct 36 ms 11136 KB Output is correct
22 Correct 44 ms 13176 KB Output is correct
23 Correct 45 ms 13176 KB Output is correct
24 Correct 45 ms 13228 KB Output is correct
25 Correct 44 ms 13180 KB Output is correct
26 Correct 7 ms 4992 KB Output is correct
27 Correct 7 ms 4992 KB Output is correct
28 Correct 53 ms 13048 KB Output is correct
29 Correct 46 ms 12408 KB Output is correct
30 Correct 7 ms 4992 KB Output is correct
31 Correct 7 ms 4992 KB Output is correct
32 Correct 7 ms 4992 KB Output is correct
33 Correct 7 ms 4992 KB Output is correct
34 Correct 7 ms 4992 KB Output is correct
35 Correct 8 ms 4992 KB Output is correct
36 Correct 8 ms 4992 KB Output is correct
37 Correct 7 ms 4992 KB Output is correct
38 Correct 7 ms 4992 KB Output is correct
39 Correct 7 ms 4992 KB Output is correct
40 Correct 7 ms 4992 KB Output is correct
41 Correct 7 ms 5120 KB Output is correct
42 Correct 7 ms 4992 KB Output is correct
43 Correct 51 ms 12792 KB Output is correct
44 Correct 50 ms 12792 KB Output is correct
45 Correct 48 ms 12280 KB Output is correct
46 Correct 54 ms 12920 KB Output is correct
47 Correct 50 ms 12664 KB Output is correct
48 Correct 52 ms 12664 KB Output is correct
49 Correct 50 ms 12664 KB Output is correct
50 Correct 8 ms 4992 KB Output is correct
51 Correct 38 ms 11244 KB Output is correct
52 Correct 45 ms 13176 KB Output is correct
53 Correct 47 ms 12584 KB Output is correct
54 Correct 40 ms 13048 KB Output is correct
55 Correct 7 ms 4992 KB Output is correct
56 Correct 7 ms 4992 KB Output is correct
57 Correct 7 ms 4992 KB Output is correct
58 Correct 7 ms 4992 KB Output is correct
59 Correct 7 ms 4992 KB Output is correct
60 Correct 7 ms 5120 KB Output is correct
61 Correct 7 ms 4992 KB Output is correct
62 Correct 7 ms 4992 KB Output is correct
63 Correct 7 ms 4992 KB Output is correct
64 Correct 7 ms 5120 KB Output is correct
65 Correct 7 ms 4992 KB Output is correct
66 Correct 7 ms 4992 KB Output is correct
67 Correct 37 ms 12544 KB Output is correct
68 Correct 39 ms 12536 KB Output is correct
69 Correct 38 ms 12536 KB Output is correct
70 Correct 38 ms 12536 KB Output is correct
71 Correct 40 ms 12536 KB Output is correct
72 Correct 37 ms 12536 KB Output is correct
73 Correct 38 ms 12536 KB Output is correct
74 Correct 45 ms 13176 KB Output is correct
75 Correct 43 ms 12928 KB Output is correct
76 Correct 45 ms 13176 KB Output is correct
77 Correct 39 ms 12792 KB Output is correct
78 Correct 38 ms 12664 KB Output is correct
79 Correct 39 ms 12664 KB Output is correct
80 Correct 38 ms 12664 KB Output is correct
81 Correct 40 ms 12664 KB Output is correct
82 Correct 39 ms 12664 KB Output is correct
83 Correct 40 ms 12920 KB Output is correct
84 Correct 46 ms 13176 KB Output is correct
85 Correct 46 ms 13176 KB Output is correct
86 Correct 45 ms 13176 KB Output is correct
87 Correct 50 ms 13416 KB Output is correct
88 Correct 46 ms 13176 KB Output is correct
89 Correct 50 ms 13304 KB Output is correct
90 Correct 47 ms 13176 KB Output is correct
91 Correct 46 ms 13176 KB Output is correct
92 Correct 46 ms 13176 KB Output is correct
93 Correct 45 ms 13176 KB Output is correct
94 Correct 46 ms 13176 KB Output is correct
95 Correct 48 ms 13176 KB Output is correct
96 Correct 46 ms 13176 KB Output is correct
97 Correct 45 ms 13304 KB Output is correct
98 Correct 46 ms 13304 KB Output is correct
99 Correct 45 ms 13176 KB Output is correct
100 Correct 47 ms 13432 KB Output is correct
101 Correct 46 ms 13176 KB Output is correct
102 Correct 45 ms 13304 KB Output is correct