oj.uz

Submission #50511

# Submission time Handle Problem Language Result Execution time Memory
50511 2018-06-11T09:11:34 Z ayhcbagnop Wiring (IOI17_wiring) C++14
100 / 100
 86 ms 16284 KB 
#ifdef atom
    #include "grader.cpp"
#endif
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> ii;
vector<int> x;
vector<int> pong;
vector<int> prv;
vector< vector< ll > > pref;
vector< vector< ll > > dp;
vector< vector<int> > buck;
long long min_total_length(std::vector<int> r, std::vector<int> b)
{
    int ir, ib; ir = ib = 0;
    while(ir< r.size() && ib< b.size())
    {
        if(r[ir]< b[ib])
        {
            x.pb(r[ir]); pong.pb(0);
            ir++;
        }
        else
        {
            x.pb(b[ib]); pong.pb(1);
            ib++;
        }
    }
    while(ir< r.size()) x.pb(r[ir++]), pong.pb(0);
    while(ib< b.size()) x.pb(b[ib++]), pong.pb(1);
    ll last = -1e18;
    int n = pong.size();
    for(int i = 0; i< n; i++)
    {
        if(i && pong[i] != pong[i-1]) last = x[i-1];
        prv.pb(last);
    }
    pref.pb(vector<ll>());
    buck.pb(vector<int>());
    for(int i = 0; i< n; i++)
    {
        if(i && pong[i] != pong[i-1])
        {
            pref.pb(vector<ll>());
            buck.pb(vector<int>());
        }
        pref.back().pb(pref.back().empty()?x[i]:(pref.back().back()+x[i]));
        buck.back().pb(x[i]);
    }
    dp.resize(pref.size());
    int comps = pref.size();
    for(int i = 0; i< (int) dp.size(); i++)
    {
        dp[i].resize(pref[i].size()+1);
    }
    for(int i = comps-1; i>= 0; i--)
    {
        if(i == comps-1) dp[i][pref[i].size()] = 0;
        else dp[i][pref[i].size()] = dp[i+1][0];
        //printf("%d\n", i);
        for(int j = pref[i].size()-1; j>= 0; j--)
        {
            //printf("dp[%d][%d]\n", i, j);
            int numleft = pref[i].size()-j;
            //printf("numleft = %d ((%d))->(%d)\n", numleft, pref[i].size()-numleft-1, pref[i][pref[i].size()-1]);
            ll sumhere = pref[i][pref[i].size()-1]-(((int)pref[i].size()-numleft-1>= 0)?pref[i][pref[i].size()-numleft-1]:0ll);
            ll sumnext;
            if(i+1< comps)
            {
                if(numleft-1< pref[i+1].size()) sumnext = pref[i+1][numleft-1];
                else sumnext = pref[i+1].back() + pref[i+1][0]*(numleft-pref[i+1].size());
            }
            else sumnext = 1e18;
            //printf("sumnext %lld sumhere %lld\n", sumnext, sumhere);
            ll prev;
            if(i) prev = buck[i-1].back();
            else prev = -1e18;
            ll nxt;
            if(i+1< comps) nxt = buck[i+1][0];
            else nxt = 1e18;
            dp[i][j] = min(i+1< comps?dp[i+1][min(numleft, (int)pref[i+1].size())]+sumnext-sumhere:(ll)1e18, dp[i][j+1]+buck[i][j]-prev);
            if(i+1< comps) dp[i][j] = min(dp[i][j], 1LL*numleft*nxt-sumhere+dp[i+1][1]);
            if(i+1< comps) dp[i][j] = min(dp[i][j], dp[i][j+1]+buck[i+1][0]-buck[i][j]);
            //rintf("dp[%d][%d] = %lld\n", i, j, dp[i][j]);
        }
    }
    ll best = dp[0][0];
    ll sum = pref[0].back();
    int num = pref[0].size();
    for(int i = 1; i<= (int) pref[1].size(); i++)
    {
        ll R = pref[1][i-1];
        ll L = pref[0].back();
        int diff = abs(i-num);
        if(i> num) L += 1LL*buck[0].back()*diff;
        else R += 1LL*buck[1][0]*diff;
        ll here = R-L+dp[1][i];
        //printf("%d: %lld %lld\n", i, L, R);
        best = min(best, here);
    }
    return best;
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:22:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ir< r.size() && ib< b.size())
           ~~^~~~~~~~~~
wiring.cpp:22:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ir< r.size() && ib< b.size())
                           ~~^~~~~~~~~~
wiring.cpp:35:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ir< r.size()) x.pb(r[ir++]), pong.pb(0);
           ~~^~~~~~~~~~
wiring.cpp:36:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ib< b.size()) x.pb(b[ib++]), pong.pb(1);
           ~~^~~~~~~~~~
wiring.cpp:76:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(numleft-1< pref[i+1].size()) sumnext = pref[i+1][numleft-1];
                    ~~~~~~~~~^~~~~~~~~~~~~~~~~~
wiring.cpp:94:8: warning: unused variable 'sum' [-Wunused-variable]
     ll sum = pref[0].back();
        ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 2 ms 688 KB Output is correct
9 Correct 2 ms 720 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 2 ms 720 KB Output is correct
13 Correct 2 ms 720 KB Output is correct
14 Correct 2 ms 720 KB Output is correct
15 Correct 3 ms 720 KB Output is correct
16 Correct 2 ms 720 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 720 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 34 ms 6916 KB Output is correct
4 Correct 34 ms 6916 KB Output is correct
5 Correct 34 ms 7316 KB Output is correct
6 Correct 57 ms 8724 KB Output is correct
7 Correct 65 ms 8724 KB Output is correct
8 Correct 54 ms 8724 KB Output is correct
9 Correct 53 ms 8724 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8724 KB Output is correct
2 Correct 2 ms 8724 KB Output is correct
3 Correct 86 ms 16284 KB Output is correct
4 Correct 63 ms 16284 KB Output is correct
5 Correct 3 ms 16284 KB Output is correct
6 Correct 2 ms 16284 KB Output is correct
7 Correct 3 ms 16284 KB Output is correct
8 Correct 2 ms 16284 KB Output is correct
9 Correct 2 ms 16284 KB Output is correct
10 Correct 2 ms 16284 KB Output is correct
11 Correct 3 ms 16284 KB Output is correct
12 Correct 2 ms 16284 KB Output is correct
13 Correct 2 ms 16284 KB Output is correct
14 Correct 2 ms 16284 KB Output is correct
15 Correct 3 ms 16284 KB Output is correct
16 Correct 3 ms 16284 KB Output is correct
17 Correct 2 ms 16284 KB Output is correct
18 Correct 76 ms 16284 KB Output is correct
19 Correct 74 ms 16284 KB Output is correct
20 Correct 64 ms 16284 KB Output is correct
21 Correct 73 ms 16284 KB Output is correct
22 Correct 71 ms 16284 KB Output is correct
23 Correct 73 ms 16284 KB Output is correct
24 Correct 71 ms 16284 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16284 KB Output is correct
2 Correct 37 ms 16284 KB Output is correct
3 Correct 60 ms 16284 KB Output is correct
4 Correct 44 ms 16284 KB Output is correct
5 Correct 69 ms 16284 KB Output is correct
6 Correct 2 ms 16284 KB Output is correct
7 Correct 3 ms 16284 KB Output is correct
8 Correct 3 ms 16284 KB Output is correct
9 Correct 2 ms 16284 KB Output is correct
10 Correct 3 ms 16284 KB Output is correct
11 Correct 2 ms 16284 KB Output is correct
12 Correct 2 ms 16284 KB Output is correct
13 Correct 2 ms 16284 KB Output is correct
14 Correct 2 ms 16284 KB Output is correct
15 Correct 2 ms 16284 KB Output is correct
16 Correct 2 ms 16284 KB Output is correct
17 Correct 3 ms 16284 KB Output is correct
18 Correct 42 ms 16284 KB Output is correct
19 Correct 44 ms 16284 KB Output is correct
20 Correct 45 ms 16284 KB Output is correct
21 Correct 43 ms 16284 KB Output is correct
22 Correct 45 ms 16284 KB Output is correct
23 Correct 42 ms 16284 KB Output is correct
24 Correct 45 ms 16284 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 2 ms 688 KB Output is correct
9 Correct 2 ms 720 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 2 ms 720 KB Output is correct
13 Correct 2 ms 720 KB Output is correct
14 Correct 2 ms 720 KB Output is correct
15 Correct 3 ms 720 KB Output is correct
16 Correct 2 ms 720 KB Output is correct
17 Correct 2 ms 720 KB Output is correct
18 Correct 2 ms 720 KB Output is correct
19 Correct 34 ms 6916 KB Output is correct
20 Correct 34 ms 6916 KB Output is correct
21 Correct 34 ms 7316 KB Output is correct
22 Correct 57 ms 8724 KB Output is correct
23 Correct 65 ms 8724 KB Output is correct
24 Correct 54 ms 8724 KB Output is correct
25 Correct 53 ms 8724 KB Output is correct
26 Correct 2 ms 8724 KB Output is correct
27 Correct 2 ms 8724 KB Output is correct
28 Correct 86 ms 16284 KB Output is correct
29 Correct 63 ms 16284 KB Output is correct
30 Correct 3 ms 16284 KB Output is correct
31 Correct 2 ms 16284 KB Output is correct
32 Correct 3 ms 16284 KB Output is correct
33 Correct 2 ms 16284 KB Output is correct
34 Correct 2 ms 16284 KB Output is correct
35 Correct 2 ms 16284 KB Output is correct
36 Correct 3 ms 16284 KB Output is correct
37 Correct 2 ms 16284 KB Output is correct
38 Correct 2 ms 16284 KB Output is correct
39 Correct 2 ms 16284 KB Output is correct
40 Correct 3 ms 16284 KB Output is correct
41 Correct 3 ms 16284 KB Output is correct
42 Correct 2 ms 16284 KB Output is correct
43 Correct 76 ms 16284 KB Output is correct
44 Correct 74 ms 16284 KB Output is correct
45 Correct 64 ms 16284 KB Output is correct
46 Correct 73 ms 16284 KB Output is correct
47 Correct 71 ms 16284 KB Output is correct
48 Correct 73 ms 16284 KB Output is correct
49 Correct 71 ms 16284 KB Output is correct
50 Correct 2 ms 16284 KB Output is correct
51 Correct 37 ms 16284 KB Output is correct
52 Correct 60 ms 16284 KB Output is correct
53 Correct 44 ms 16284 KB Output is correct
54 Correct 69 ms 16284 KB Output is correct
55 Correct 2 ms 16284 KB Output is correct
56 Correct 3 ms 16284 KB Output is correct
57 Correct 3 ms 16284 KB Output is correct
58 Correct 2 ms 16284 KB Output is correct
59 Correct 3 ms 16284 KB Output is correct
60 Correct 2 ms 16284 KB Output is correct
61 Correct 2 ms 16284 KB Output is correct
62 Correct 2 ms 16284 KB Output is correct
63 Correct 2 ms 16284 KB Output is correct
64 Correct 2 ms 16284 KB Output is correct
65 Correct 2 ms 16284 KB Output is correct
66 Correct 3 ms 16284 KB Output is correct
67 Correct 42 ms 16284 KB Output is correct
68 Correct 44 ms 16284 KB Output is correct
69 Correct 45 ms 16284 KB Output is correct
70 Correct 43 ms 16284 KB Output is correct
71 Correct 45 ms 16284 KB Output is correct
72 Correct 42 ms 16284 KB Output is correct
73 Correct 45 ms 16284 KB Output is correct
74 Correct 53 ms 16284 KB Output is correct
75 Correct 47 ms 16284 KB Output is correct
76 Correct 59 ms 16284 KB Output is correct
77 Correct 42 ms 16284 KB Output is correct
78 Correct 42 ms 16284 KB Output is correct
79 Correct 71 ms 16284 KB Output is correct
80 Correct 51 ms 16284 KB Output is correct
81 Correct 65 ms 16284 KB Output is correct
82 Correct 44 ms 16284 KB Output is correct
83 Correct 45 ms 16284 KB Output is correct
84 Correct 51 ms 16284 KB Output is correct
85 Correct 50 ms 16284 KB Output is correct
86 Correct 52 ms 16284 KB Output is correct
87 Correct 55 ms 16284 KB Output is correct
88 Correct 66 ms 16284 KB Output is correct
89 Correct 47 ms 16284 KB Output is correct
90 Correct 51 ms 16284 KB Output is correct
91 Correct 46 ms 16284 KB Output is correct
92 Correct 44 ms 16284 KB Output is correct
93 Correct 44 ms 16284 KB Output is correct
94 Correct 55 ms 16284 KB Output is correct
95 Correct 45 ms 16284 KB Output is correct
96 Correct 47 ms 16284 KB Output is correct
97 Correct 47 ms 16284 KB Output is correct
98 Correct 57 ms 16284 KB Output is correct
99 Correct 51 ms 16284 KB Output is correct
100 Correct 50 ms 16284 KB Output is correct
101 Correct 54 ms 16284 KB Output is correct
102 Correct 55 ms 16284 KB Output is correct