oj.uz

Submission #497874

# Submission time Handle Problem Language Result Execution time Memory
497874 2021-12-24T02:33:24 Z kevin Wiring (IOI17_wiring) C++17
100 / 100
 51 ms 11660 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";
#define nl cout<<"\n"

const int MAXN = 5e5 + 5;

ll min_total_length(vector<int> a, vector<int> b){
    vector<pair<ll, int>> ar;
    for(int i:a) ar.push_back({(ll)i, 0});
    for(int i:b) ar.push_back({(ll)i, 1});
    sort(ar.begin(), ar.end());
    int p = 0;
    int pv = -1;
    vector<ll> val[2];
    // 0 = <, 1 = >, so add
    // 0 is pref, 1 is posts
    while(p < (int)ar.size()){
        vector<ll> v;
        ll x = ar[p].f;
        v.push_back(x);
        while(p < (int)ar.size() - 1 && ar[p].s == ar[p+1].s) v.push_back(ar[++p].f);
        // ca(v); nl;
        p++;
        // cout<<p<<" ";
        ll iv = (p == (int)ar.size()?0:ar[p].f-ar[p-1].f);
        if(pv == -1){
            if(p == (int)ar.size()) return 0;
            val[0] = val[1] = vector<ll>(v.size() + 1, 1e18);
            ll sm = 0;
            for(ll i:v) sm += v.back() - i;
            val[0][v.size()] = val[1][v.size()] = sm;
        }
        else{
            // cout<<x<<" "<<pv<<"\n";
            vector<ll> nxt[2]; nxt[0] = nxt[1] = vector<ll>(v.size() + 1);
            ll lsm = 0;
            ll rsm = 0;
            for(int i=0; i<(int)v.size(); i++) rsm += v.back() - v[i];
            // cout<<lsm<<" "<<rsm<<"\n";
            nxt[0][v.size()] = val[0][0] + rsm;
            for(int i=1; i<=(int)v.size(); i++){
                if(i) {
                    lsm += v[i-1] - v[0];
                    rsm -= v.back() - v[i-1];
                }
                int id = min(i, (int)val[0].size()-1);
                // cout<<"Val: "<<val[0][id]<<" "<<(int)(i) * (x-pv)<<" "<<(i<(int)val[1].size()?val[1][i]:1e18)<<" "<<lsm<<" "<<rsm<<"\n";
                nxt[0][v.size()-i] = min(val[0][id] + (ll)(i) * (x-pv), (ll)(i<(int)val[1].size()?val[1][i]:1e18)) + lsm + rsm;
            }
            // nxt[0][0] = val[0][val[0].size()-1] + lsm;
            val[0] = nxt[0];
            nxt[0].clear(); nxt[1].clear();
        }
        val[1] = val[0];
        pv = ar[p-1].f;      
        for(int i=0; i<val[0].size(); i++) val[1][i] += i * iv;
        // ca(val[0]);  nl; ca(val[1]); nl;  
        for(int i=1; i<(int)val[0].size(); i++){
            val[0][i] = min(val[0][i], val[0][i-1]);
            val[1][val[0].size()-1-i] = min(val[1][val[0].size()-i], val[1][val[0].size()-1-i]);
        }
        // ca(val[0]); nl; ca(val[1]); nl; nl;
        if(p == ar.size()) return val[0][0];
    }
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for(int i=0; i<val[0].size(); i++) val[1][i] += i * iv;
      |                      ~^~~~~~~~~~~~~~
wiring.cpp:69:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         if(p == ar.size()) return val[0][0];
      |            ~~^~~~~~~~~~~~
wiring.cpp:14:27: warning: control reaches end of non-void function [-Wreturn-type]
   14 |     vector<pair<ll, int>> ar;
      |                           ^~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 24 ms 6740 KB Output is correct
4 Correct 25 ms 6800 KB Output is correct
5 Correct 25 ms 8788 KB Output is correct
6 Correct 33 ms 9912 KB Output is correct
7 Correct 31 ms 9124 KB Output is correct
8 Correct 33 ms 9136 KB Output is correct
9 Correct 31 ms 9064 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 48 ms 6068 KB Output is correct
4 Correct 50 ms 7572 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 47 ms 7964 KB Output is correct
19 Correct 47 ms 7952 KB Output is correct
20 Correct 48 ms 7968 KB Output is correct
21 Correct 47 ms 7952 KB Output is correct
22 Correct 48 ms 7992 KB Output is correct
23 Correct 51 ms 7944 KB Output is correct
24 Correct 47 ms 7964 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 34 ms 6068 KB Output is correct
3 Correct 40 ms 6076 KB Output is correct
4 Correct 39 ms 5988 KB Output is correct
5 Correct 43 ms 6060 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 292 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 38 ms 7860 KB Output is correct
19 Correct 36 ms 7308 KB Output is correct
20 Correct 35 ms 7352 KB Output is correct
21 Correct 33 ms 7476 KB Output is correct
22 Correct 35 ms 10640 KB Output is correct
23 Correct 32 ms 9352 KB Output is correct
24 Correct 33 ms 10676 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 24 ms 6740 KB Output is correct
20 Correct 25 ms 6800 KB Output is correct
21 Correct 25 ms 8788 KB Output is correct
22 Correct 33 ms 9912 KB Output is correct
23 Correct 31 ms 9124 KB Output is correct
24 Correct 33 ms 9136 KB Output is correct
25 Correct 31 ms 9064 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 48 ms 6068 KB Output is correct
29 Correct 50 ms 7572 KB Output is correct
30 Correct 0 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 0 ms 208 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 0 ms 296 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 47 ms 7964 KB Output is correct
44 Correct 47 ms 7952 KB Output is correct
45 Correct 48 ms 7968 KB Output is correct
46 Correct 47 ms 7952 KB Output is correct
47 Correct 48 ms 7992 KB Output is correct
48 Correct 51 ms 7944 KB Output is correct
49 Correct 47 ms 7964 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 34 ms 6068 KB Output is correct
52 Correct 40 ms 6076 KB Output is correct
53 Correct 39 ms 5988 KB Output is correct
54 Correct 43 ms 6060 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 0 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Correct 0 ms 208 KB Output is correct
59 Correct 0 ms 208 KB Output is correct
60 Correct 0 ms 208 KB Output is correct
61 Correct 0 ms 292 KB Output is correct
62 Correct 1 ms 296 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 0 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 38 ms 7860 KB Output is correct
68 Correct 36 ms 7308 KB Output is correct
69 Correct 35 ms 7352 KB Output is correct
70 Correct 33 ms 7476 KB Output is correct
71 Correct 35 ms 10640 KB Output is correct
72 Correct 32 ms 9352 KB Output is correct
73 Correct 33 ms 10676 KB Output is correct
74 Correct 32 ms 10000 KB Output is correct
75 Correct 39 ms 8976 KB Output is correct
76 Correct 38 ms 9240 KB Output is correct
77 Correct 35 ms 9356 KB Output is correct
78 Correct 34 ms 9880 KB Output is correct
79 Correct 35 ms 8984 KB Output is correct
80 Correct 30 ms 8852 KB Output is correct
81 Correct 34 ms 10132 KB Output is correct
82 Correct 32 ms 9268 KB Output is correct
83 Correct 35 ms 9620 KB Output is correct
84 Correct 32 ms 9876 KB Output is correct
85 Correct 38 ms 9364 KB Output is correct
86 Correct 33 ms 10392 KB Output is correct
87 Correct 36 ms 9496 KB Output is correct
88 Correct 35 ms 8968 KB Output is correct
89 Correct 36 ms 9752 KB Output is correct
90 Correct 42 ms 9992 KB Output is correct
91 Correct 35 ms 9992 KB Output is correct
92 Correct 38 ms 10004 KB Output is correct
93 Correct 34 ms 9480 KB Output is correct
94 Correct 36 ms 10900 KB Output is correct
95 Correct 39 ms 9996 KB Output is correct
96 Correct 33 ms 9864 KB Output is correct
97 Correct 33 ms 11444 KB Output is correct
98 Correct 35 ms 11660 KB Output is correct
99 Correct 39 ms 11660 KB Output is correct
100 Correct 41 ms 10760 KB Output is correct
101 Correct 35 ms 10084 KB Output is correct
102 Correct 48 ms 9356 KB Output is correct