oj.uz

Submission #282675

# Submission time Handle Problem Language Result Execution time Memory
282675 2020-08-24T17:48:26 Z doowey Wiring (IOI17_wiring) C++14
100 / 100
 66 ms 14568 KB 
#include <bits/stdc++.h>
#include "wiring.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

const ll inf = (ll)1e18;


ll min_total_length(vector<int> r, vector<int> b) {
    vector<pii> al;
    al.push_back(mp(-1, -1));
    for(auto x : r)
        al.push_back(mp(x, 0));
    for(auto x : b)
        al.push_back(mp(x, 1));
    sort(al.begin(), al.end());
    int sz = al.size();
    vector<ll> dp(sz);
    vector<ll> sa(sz);
    vector<ll> sb(sz);
    vector<ll> low(sz);
    vector<ll> pfi(sz);
    for(int i = 1; i < sz; i ++ ){
        dp[i] = inf;
    }
    vector<int> cur[2];
    ll tq;
    ll ccb = 0;
    ll pq;
    int now;
    int csz;
    ll go;
    ll extra;
    ll niz;
    ll diff;
    for(int i = 1; i < sz; i ++ ){
        if(al[i].se != al[i-1].se){
            cur[0].clear();
            swap(cur[0], cur[1]);
            pq = inf;
            for(auto x : cur[0]){
                sa[x]=al[cur[0].back()].fi - al[x].fi;
            }
            for(int i = cur[0].size() - 1; i >= 0 ; i -- ){
                if(i < cur[0].size() - 1)
                    sa[cur[0][i]] += sa[cur[0][i+1]];
                low[cur[0][i]] = sa[cur[0][i]] + dp[cur[0][i] - 1];
            }
            diff = al[i].fi - al[i - 1].fi;
            for(int i = 0 ; i < cur[0].size(); i ++ ){
                niz = cur[0].size() - i;
                pfi[cur[0][i]] = dp[cur[0][i]-1] + sa[cur[0][i]] + diff * 1ll * niz;
                if(i)
                    pfi[cur[0][i]]=min(pfi[cur[0][i]],pfi[cur[0][i-1]]);
            }
            go = 0;
            now = (int)cur[0].size() - 1;
        }
        cur[1].push_back(i);
        sb[i]=al[i].fi-al[cur[1][0]].fi;
        go += sb[i];
        if(!cur[0].empty()){
            dp[i] = dp[i - 1] + al[i].fi - al[cur[0].back()].fi;
            if(now >= 0)
                pq = min(pq, low[cur[0][now--]]);
            csz = cur[1].size();
            dp[i] = min(dp[i],go + pq + csz * 1ll * (al[cur[1][0]].fi - al[cur[0].back()].fi));
            if(now >= 0)
                dp[i] = min(dp[i], pfi[cur[0][now]] + go);
        }
    }
    return dp[sz - 1];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:52:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |                 if(i < cur[0].size() - 1)
      |                    ~~^~~~~~~~~~~~~~~~~~~
wiring.cpp:57:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             for(int i = 0 ; i < cur[0].size(); i ++ ){
      |                             ~~^~~~~~~~~~~~~~~
wiring.cpp:34:8: warning: unused variable 'tq' [-Wunused-variable]
   34 |     ll tq;
      |        ^~
wiring.cpp:35:8: warning: unused variable 'ccb' [-Wunused-variable]
   35 |     ll ccb = 0;
      |        ^~~
wiring.cpp:40:8: warning: unused variable 'extra' [-Wunused-variable]
   40 |     ll extra;
      |        ^~~~~
wiring.cpp:68:12: warning: 'go' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |         go += sb[i];
wiring.cpp:72:44: warning: 'now' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |                 pq = min(pq, low[cur[0][now--]]);
      |                                         ~~~^~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 40 ms 10856 KB Output is correct
4 Correct 40 ms 10840 KB Output is correct
5 Correct 37 ms 11112 KB Output is correct
6 Correct 51 ms 14568 KB Output is correct
7 Correct 50 ms 14568 KB Output is correct
8 Correct 50 ms 14568 KB Output is correct
9 Correct 56 ms 14568 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 65 ms 13288 KB Output is correct
4 Correct 63 ms 13032 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 62 ms 13288 KB Output is correct
19 Correct 62 ms 13288 KB Output is correct
20 Correct 66 ms 13288 KB Output is correct
21 Correct 62 ms 13288 KB Output is correct
22 Correct 64 ms 13384 KB Output is correct
23 Correct 64 ms 13292 KB Output is correct
24 Correct 64 ms 13288 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 52 ms 12708 KB Output is correct
3 Correct 64 ms 12648 KB Output is correct
4 Correct 58 ms 12680 KB Output is correct
5 Correct 52 ms 12648 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 48 ms 13160 KB Output is correct
19 Correct 52 ms 12648 KB Output is correct
20 Correct 51 ms 12648 KB Output is correct
21 Correct 53 ms 12916 KB Output is correct
22 Correct 48 ms 13672 KB Output is correct
23 Correct 51 ms 13416 KB Output is correct
24 Correct 47 ms 13544 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 40 ms 10856 KB Output is correct
20 Correct 40 ms 10840 KB Output is correct
21 Correct 37 ms 11112 KB Output is correct
22 Correct 51 ms 14568 KB Output is correct
23 Correct 50 ms 14568 KB Output is correct
24 Correct 50 ms 14568 KB Output is correct
25 Correct 56 ms 14568 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 65 ms 13288 KB Output is correct
29 Correct 63 ms 13032 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 0 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 62 ms 13288 KB Output is correct
44 Correct 62 ms 13288 KB Output is correct
45 Correct 66 ms 13288 KB Output is correct
46 Correct 62 ms 13288 KB Output is correct
47 Correct 64 ms 13384 KB Output is correct
48 Correct 64 ms 13292 KB Output is correct
49 Correct 64 ms 13288 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 52 ms 12708 KB Output is correct
52 Correct 64 ms 12648 KB Output is correct
53 Correct 58 ms 12680 KB Output is correct
54 Correct 52 ms 12648 KB Output is correct
55 Correct 0 ms 256 KB Output is correct
56 Correct 1 ms 256 KB Output is correct
57 Correct 1 ms 256 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 1 ms 360 KB Output is correct
61 Correct 0 ms 256 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 48 ms 13160 KB Output is correct
68 Correct 52 ms 12648 KB Output is correct
69 Correct 51 ms 12648 KB Output is correct
70 Correct 53 ms 12916 KB Output is correct
71 Correct 48 ms 13672 KB Output is correct
72 Correct 51 ms 13416 KB Output is correct
73 Correct 47 ms 13544 KB Output is correct
74 Correct 58 ms 14440 KB Output is correct
75 Correct 54 ms 13320 KB Output is correct
76 Correct 63 ms 14056 KB Output is correct
77 Correct 52 ms 13544 KB Output is correct
78 Correct 64 ms 13828 KB Output is correct
79 Correct 58 ms 13288 KB Output is correct
80 Correct 51 ms 13416 KB Output is correct
81 Correct 51 ms 13928 KB Output is correct
82 Correct 66 ms 13548 KB Output is correct
83 Correct 50 ms 13800 KB Output is correct
84 Correct 62 ms 14184 KB Output is correct
85 Correct 59 ms 13804 KB Output is correct
86 Correct 61 ms 14324 KB Output is correct
87 Correct 59 ms 14056 KB Output is correct
88 Correct 58 ms 13928 KB Output is correct
89 Correct 55 ms 13976 KB Output is correct
90 Correct 59 ms 13928 KB Output is correct
91 Correct 56 ms 14056 KB Output is correct
92 Correct 53 ms 14184 KB Output is correct
93 Correct 56 ms 14184 KB Output is correct
94 Correct 55 ms 14440 KB Output is correct
95 Correct 58 ms 14056 KB Output is correct
96 Correct 53 ms 14056 KB Output is correct
97 Correct 59 ms 14440 KB Output is correct
98 Correct 64 ms 14440 KB Output is correct
99 Correct 63 ms 14440 KB Output is correct
100 Correct 64 ms 14312 KB Output is correct
101 Correct 55 ms 14440 KB Output is correct
102 Correct 64 ms 14196 KB Output is correct