oj.uz

Submission #59227

# Submission time Handle Problem Language Result Execution time Memory
59227 2018-07-21T09:21:24 Z Bodo171 Wiring (IOI17_wiring) C++14
100 / 100
 89 ms 52860 KB 
#include "wiring.h"
#include <vector>
#include <iostream>
using namespace std;
const int nmax=200005;
const long long lim=1LL*1e15;
vector<int> v[nmax];
int curr,i1,i2,i,j,nr,catenxt;
long long cate,sum,dif,cap,tot,inc,ans;
long long mic[nmax],mare[nmax],dp[nmax];
long long min_total_length(vector<int> r, vector<int> b) {
    i1=i2=0;curr=-1;
    for(i=0;i<r.size()+b.size();i++)
    {
        if(i1!=r.size()&&(i2==b.size()||r[i1]<b[i2]))
        {
            if(curr==0) v[nr].push_back(r[i1]);
            else nr++,v[nr].push_back(r[i1]);
            curr=0;i1++;
        }
        else
        {
            if(curr==1) v[nr].push_back(b[i2]);
            else nr++,v[nr].push_back(b[i2]);
            curr=1;i2++;
        }
    }
    cate=v[1].size();dif=v[2][0]-v[1].back();cap=v[1].back();
    for(j=0;j<v[1].size();j++)
        sum+=v[1][j];
    for(j=0;j<=v[2].size();j++)
        mic[j]=mare[j]=lim;
    for(j=1;j<=v[1].size();j++)
        mare[j]=dif*cate+cate*cap-sum;
    for(j=v[1].size();j<=v[2].size();j++)
        mic[j]=cate*cap-sum;
    for(i=2;i<nr;i++)
    {
        dif=v[i][0]-v[i-1].back();
        cap=v[i].back();inc=v[i][0];
        sum=0;tot=0;cate=v[i].size();
        for(j=0;j<cate;j++)
            tot+=v[i][j];
        for(j=0;j<=cate;j++)
        {
            dp[j]=1LL*min(mic[j]+j*dif,mare[j])+sum-j*inc+(cate-j)*cap-(tot-sum);
            if(j<cate)sum+=v[i][j];
        }
        catenxt=v[i+1].size();
        for(j=0;j<=catenxt;j++)
            mic[j]=mare[j]=lim;
        mic[0]=dp[cate];
        for(j=1;j<=cate;j++)
             mic[j]=min(mic[j-1],dp[cate-j]);
        for(j=cate+1;j<=catenxt;j++)
            mic[j]=mic[j-1];
        dif=v[i+1][0]-v[i].back();
        mare[cate+1]=lim;
        for(j=cate;j>=0;j--)
           mare[j]=min(mare[j+1],dp[cate-j]+dif*j);
    }
    sum=0;
    cate=v[nr].size();dif=v[nr][0]-v[nr-1].back();inc=v[nr][0];
    for(j=0;j<v[nr].size();j++)
        sum+=v[nr][j];
    ans=1LL*sum-cate*inc+min(mare[cate],mic[cate]+cate*dif);
	return ans;
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:13:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<r.size()+b.size();i++)
             ~^~~~~~~~~~~~~~~~~~
wiring.cpp:15:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i1!=r.size()&&(i2==b.size()||r[i1]<b[i2]))
            ~~^~~~~~~~~~
wiring.cpp:15:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i1!=r.size()&&(i2==b.size()||r[i1]<b[i2]))
                           ~~^~~~~~~~~~
wiring.cpp:29:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=0;j<v[1].size();j++)
             ~^~~~~~~~~~~~
wiring.cpp:31:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=0;j<=v[2].size();j++)
             ~^~~~~~~~~~~~~
wiring.cpp:33:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=1;j<=v[1].size();j++)
             ~^~~~~~~~~~~~~
wiring.cpp:35:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=v[1].size();j<=v[2].size();j++)
                       ~^~~~~~~~~~~~~
wiring.cpp:64:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=0;j<v[nr].size();j++)
             ~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4952 KB Output is correct
2 Correct 7 ms 5104 KB Output is correct
3 Correct 6 ms 5104 KB Output is correct
4 Correct 7 ms 5188 KB Output is correct
5 Correct 7 ms 5268 KB Output is correct
6 Correct 6 ms 5268 KB Output is correct
7 Correct 7 ms 5332 KB Output is correct
8 Correct 7 ms 5332 KB Output is correct
9 Correct 8 ms 5332 KB Output is correct
10 Correct 9 ms 5332 KB Output is correct
11 Correct 9 ms 5332 KB Output is correct
12 Correct 10 ms 5356 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 7 ms 5384 KB Output is correct
15 Correct 7 ms 5404 KB Output is correct
16 Correct 8 ms 5404 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5404 KB Output is correct
2 Correct 8 ms 5404 KB Output is correct
3 Correct 38 ms 10068 KB Output is correct
4 Correct 43 ms 11492 KB Output is correct
5 Correct 47 ms 13208 KB Output is correct
6 Correct 64 ms 15684 KB Output is correct
7 Correct 55 ms 17668 KB Output is correct
8 Correct 60 ms 19524 KB Output is correct
9 Correct 44 ms 21544 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21544 KB Output is correct
2 Correct 6 ms 21544 KB Output is correct
3 Correct 65 ms 23052 KB Output is correct
4 Correct 58 ms 24208 KB Output is correct
5 Correct 6 ms 24208 KB Output is correct
6 Correct 6 ms 24208 KB Output is correct
7 Correct 7 ms 24208 KB Output is correct
8 Correct 7 ms 24208 KB Output is correct
9 Correct 7 ms 24208 KB Output is correct
10 Correct 8 ms 24208 KB Output is correct
11 Correct 8 ms 24208 KB Output is correct
12 Correct 7 ms 24208 KB Output is correct
13 Correct 6 ms 24208 KB Output is correct
14 Correct 6 ms 24208 KB Output is correct
15 Correct 6 ms 24208 KB Output is correct
16 Correct 8 ms 24208 KB Output is correct
17 Correct 6 ms 24208 KB Output is correct
18 Correct 56 ms 26612 KB Output is correct
19 Correct 57 ms 28476 KB Output is correct
20 Correct 71 ms 29932 KB Output is correct
21 Correct 60 ms 32440 KB Output is correct
22 Correct 65 ms 34072 KB Output is correct
23 Correct 69 ms 36004 KB Output is correct
24 Correct 69 ms 37952 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37952 KB Output is correct
2 Correct 47 ms 38592 KB Output is correct
3 Correct 56 ms 40200 KB Output is correct
4 Correct 46 ms 41112 KB Output is correct
5 Correct 47 ms 42628 KB Output is correct
6 Correct 7 ms 42628 KB Output is correct
7 Correct 7 ms 42628 KB Output is correct
8 Correct 7 ms 42628 KB Output is correct
9 Correct 7 ms 42628 KB Output is correct
10 Correct 6 ms 42628 KB Output is correct
11 Correct 6 ms 42628 KB Output is correct
12 Correct 6 ms 42628 KB Output is correct
13 Correct 8 ms 42628 KB Output is correct
14 Correct 7 ms 42628 KB Output is correct
15 Correct 7 ms 42628 KB Output is correct
16 Correct 6 ms 42628 KB Output is correct
17 Correct 7 ms 42628 KB Output is correct
18 Correct 42 ms 44316 KB Output is correct
19 Correct 37 ms 44604 KB Output is correct
20 Correct 58 ms 46240 KB Output is correct
21 Correct 73 ms 47720 KB Output is correct
22 Correct 48 ms 50380 KB Output is correct
23 Correct 49 ms 51640 KB Output is correct
24 Correct 48 ms 52412 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4952 KB Output is correct
2 Correct 7 ms 5104 KB Output is correct
3 Correct 6 ms 5104 KB Output is correct
4 Correct 7 ms 5188 KB Output is correct
5 Correct 7 ms 5268 KB Output is correct
6 Correct 6 ms 5268 KB Output is correct
7 Correct 7 ms 5332 KB Output is correct
8 Correct 7 ms 5332 KB Output is correct
9 Correct 8 ms 5332 KB Output is correct
10 Correct 9 ms 5332 KB Output is correct
11 Correct 9 ms 5332 KB Output is correct
12 Correct 10 ms 5356 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 7 ms 5384 KB Output is correct
15 Correct 7 ms 5404 KB Output is correct
16 Correct 8 ms 5404 KB Output is correct
17 Correct 7 ms 5404 KB Output is correct
18 Correct 8 ms 5404 KB Output is correct
19 Correct 38 ms 10068 KB Output is correct
20 Correct 43 ms 11492 KB Output is correct
21 Correct 47 ms 13208 KB Output is correct
22 Correct 64 ms 15684 KB Output is correct
23 Correct 55 ms 17668 KB Output is correct
24 Correct 60 ms 19524 KB Output is correct
25 Correct 44 ms 21544 KB Output is correct
26 Correct 6 ms 21544 KB Output is correct
27 Correct 6 ms 21544 KB Output is correct
28 Correct 65 ms 23052 KB Output is correct
29 Correct 58 ms 24208 KB Output is correct
30 Correct 6 ms 24208 KB Output is correct
31 Correct 6 ms 24208 KB Output is correct
32 Correct 7 ms 24208 KB Output is correct
33 Correct 7 ms 24208 KB Output is correct
34 Correct 7 ms 24208 KB Output is correct
35 Correct 8 ms 24208 KB Output is correct
36 Correct 8 ms 24208 KB Output is correct
37 Correct 7 ms 24208 KB Output is correct
38 Correct 6 ms 24208 KB Output is correct
39 Correct 6 ms 24208 KB Output is correct
40 Correct 6 ms 24208 KB Output is correct
41 Correct 8 ms 24208 KB Output is correct
42 Correct 6 ms 24208 KB Output is correct
43 Correct 56 ms 26612 KB Output is correct
44 Correct 57 ms 28476 KB Output is correct
45 Correct 71 ms 29932 KB Output is correct
46 Correct 60 ms 32440 KB Output is correct
47 Correct 65 ms 34072 KB Output is correct
48 Correct 69 ms 36004 KB Output is correct
49 Correct 69 ms 37952 KB Output is correct
50 Correct 7 ms 37952 KB Output is correct
51 Correct 47 ms 38592 KB Output is correct
52 Correct 56 ms 40200 KB Output is correct
53 Correct 46 ms 41112 KB Output is correct
54 Correct 47 ms 42628 KB Output is correct
55 Correct 7 ms 42628 KB Output is correct
56 Correct 7 ms 42628 KB Output is correct
57 Correct 7 ms 42628 KB Output is correct
58 Correct 7 ms 42628 KB Output is correct
59 Correct 6 ms 42628 KB Output is correct
60 Correct 6 ms 42628 KB Output is correct
61 Correct 6 ms 42628 KB Output is correct
62 Correct 8 ms 42628 KB Output is correct
63 Correct 7 ms 42628 KB Output is correct
64 Correct 7 ms 42628 KB Output is correct
65 Correct 6 ms 42628 KB Output is correct
66 Correct 7 ms 42628 KB Output is correct
67 Correct 42 ms 44316 KB Output is correct
68 Correct 37 ms 44604 KB Output is correct
69 Correct 58 ms 46240 KB Output is correct
70 Correct 73 ms 47720 KB Output is correct
71 Correct 48 ms 50380 KB Output is correct
72 Correct 49 ms 51640 KB Output is correct
73 Correct 48 ms 52412 KB Output is correct
74 Correct 60 ms 52472 KB Output is correct
75 Correct 67 ms 52472 KB Output is correct
76 Correct 55 ms 52472 KB Output is correct
77 Correct 48 ms 52472 KB Output is correct
78 Correct 39 ms 52472 KB Output is correct
79 Correct 37 ms 52472 KB Output is correct
80 Correct 42 ms 52472 KB Output is correct
81 Correct 40 ms 52792 KB Output is correct
82 Correct 43 ms 52792 KB Output is correct
83 Correct 45 ms 52792 KB Output is correct
84 Correct 53 ms 52792 KB Output is correct
85 Correct 59 ms 52792 KB Output is correct
86 Correct 54 ms 52792 KB Output is correct
87 Correct 43 ms 52792 KB Output is correct
88 Correct 50 ms 52792 KB Output is correct
89 Correct 49 ms 52792 KB Output is correct
90 Correct 52 ms 52792 KB Output is correct
91 Correct 57 ms 52792 KB Output is correct
92 Correct 45 ms 52792 KB Output is correct
93 Correct 48 ms 52792 KB Output is correct
94 Correct 43 ms 52792 KB Output is correct
95 Correct 44 ms 52792 KB Output is correct
96 Correct 52 ms 52792 KB Output is correct
97 Correct 44 ms 52860 KB Output is correct
98 Correct 48 ms 52860 KB Output is correct
99 Correct 50 ms 52860 KB Output is correct
100 Correct 89 ms 52860 KB Output is correct
101 Correct 53 ms 52860 KB Output is correct
102 Correct 58 ms 52860 KB Output is correct