oj.uz

Submission #283035

# Submission time Handle Problem Language Result Execution time Memory
283035 2020-08-25T08:56:16 Z MKopchev Wiring (IOI17_wiring) C++14
100 / 100
 64 ms 10744 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42;

int n,red[nmax],m,blue[nmax];

int k;
pair<int/*x*/,int/*type*/> inp[nmax];

long long dp[nmax];

long long pref_cost[nmax],suff_cost[nmax];

long long min_total_length(std::vector<int> r, std::vector<int> b)
{
	n=r.size();
	m=b.size();

	for(int i=0;i<n;i++)
        red[i+1]=r[i];

    for(int j=0;j<m;j++)
        blue[j+1]=b[j];

    for(int i=1;i<=n;i++)
        inp[i]={red[i],0};

    for(int j=1;j<=m;j++)
        inp[n+j]={blue[j],1};

    k=n+m;

    sort(inp+1,inp+k+1);

    dp[0]=0;

    for(int i=1;i<=k;i++)dp[i]=1e18;

    int start=1;

    while(inp[start].second==inp[1].second)
    {
        dp[start]=1e18;
        start++;
    }

    while(start<=k)
    {
        long long add_right=0;

        int i_left=start-1;

        while(i_left>=1&&inp[i_left].second==inp[start-1].second)i_left--;

        i_left++;

        int j_right=start;

        while(j_right<=k&&inp[j_right].second==inp[start].second)j_right++;

        j_right--;

        for(int j=start+1;j<=j_right;j++)
            suff_cost[j]=suff_cost[j-1]+(inp[j].first-inp[start].first);

        for(int i=start-2;i>=i_left;i--)
            pref_cost[i]=pref_cost[i+1]+(inp[start-1].first-inp[i].first);
        /*
        cout<<"pref_cost ";for(int i=i_left;i<start;i++)cout<<pref_cost[i]<<" ";cout<<endl;
        cout<<"suff_cost ";for(int j=start;j<=j_right;j++)cout<<suff_cost[j]<<" ";cout<<endl;
        */

        //type 1 - j-start-1>=start-i

        long long mini=1e18;

        for(int j=start;j<=j_right;j++)
        {
            int i=2*start-j-1;

            if(i_left<=i)mini=min(mini,min(dp[i-1],dp[i])+pref_cost[i]);

            dp[j]=min(dp[j],mini+1LL*(j-start+1)*(inp[start].first-inp[start-1].first)+suff_cost[j]);

            //cout<<"type1 "<<j<<" "<<i<<" "<<dp[j]<<" "<<mini<<endl;
        }

        //type 2 - j-start-1<start-i

        mini=1e18;

        int i=i_left;

        for(int j=j_right;j>=start;j--)
        {
            long long between=0;

            int i_now=2*start-j-2;

            while(i<=i_now)
            {
                mini=min(mini,pref_cost[i]+min(dp[i-1],dp[i])+1LL*i*(inp[start-1].first-inp[start].first));
                //cout<<"type2 "<<j<<" "<<i<<" "<<dp[j]<<endl;
                i++;
            }

            dp[j]=min(dp[j],suff_cost[j]+1LL*(inp[start].first-inp[start-1].first)*start+mini);
        }
        /*
        for(int p=start;p<=j_right;p++)
            cout<<p<<" -> "<<dp[p]<<endl;
        */
        start=j_right+1;
    }

    return dp[k];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:98:23: warning: unused variable 'between' [-Wunused-variable]
   98 |             long long between=0;
      |                       ^~~~~~~
wiring.cpp:51:19: warning: unused variable 'add_right' [-Wunused-variable]
   51 |         long long add_right=0;
      |                   ^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 1 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 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 33 ms 6012 KB Output is correct
4 Correct 33 ms 5760 KB Output is correct
5 Correct 40 ms 5752 KB Output is correct
6 Correct 45 ms 7544 KB Output is correct
7 Correct 44 ms 7544 KB Output is correct
8 Correct 44 ms 7544 KB Output is correct
9 Correct 48 ms 7544 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 61 ms 9336 KB Output is correct
4 Correct 60 ms 9336 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
18 Correct 64 ms 9464 KB Output is correct
19 Correct 60 ms 9336 KB Output is correct
20 Correct 64 ms 9336 KB Output is correct
21 Correct 60 ms 9336 KB Output is correct
22 Correct 60 ms 9336 KB Output is correct
23 Correct 61 ms 9336 KB Output is correct
24 Correct 60 ms 9336 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 60 ms 9260 KB Output is correct
3 Correct 53 ms 9080 KB Output is correct
4 Correct 56 ms 9080 KB Output is correct
5 Correct 54 ms 9080 KB Output is correct
6 Correct 1 ms 384 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 0 ms 384 KB Output is correct
13 Correct 0 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 0 ms 384 KB Output is correct
18 Correct 48 ms 8696 KB Output is correct
19 Correct 53 ms 9336 KB Output is correct
20 Correct 50 ms 9208 KB Output is correct
21 Correct 47 ms 9080 KB Output is correct
22 Correct 48 ms 8824 KB Output is correct
23 Correct 43 ms 9336 KB Output is correct
24 Correct 45 ms 9464 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 33 ms 6012 KB Output is correct
20 Correct 33 ms 5760 KB Output is correct
21 Correct 40 ms 5752 KB Output is correct
22 Correct 45 ms 7544 KB Output is correct
23 Correct 44 ms 7544 KB Output is correct
24 Correct 44 ms 7544 KB Output is correct
25 Correct 48 ms 7544 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 61 ms 9336 KB Output is correct
29 Correct 60 ms 9336 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 0 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 64 ms 9464 KB Output is correct
44 Correct 60 ms 9336 KB Output is correct
45 Correct 64 ms 9336 KB Output is correct
46 Correct 60 ms 9336 KB Output is correct
47 Correct 60 ms 9336 KB Output is correct
48 Correct 61 ms 9336 KB Output is correct
49 Correct 60 ms 9336 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 60 ms 9260 KB Output is correct
52 Correct 53 ms 9080 KB Output is correct
53 Correct 56 ms 9080 KB Output is correct
54 Correct 54 ms 9080 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 0 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 48 ms 8696 KB Output is correct
68 Correct 53 ms 9336 KB Output is correct
69 Correct 50 ms 9208 KB Output is correct
70 Correct 47 ms 9080 KB Output is correct
71 Correct 48 ms 8824 KB Output is correct
72 Correct 43 ms 9336 KB Output is correct
73 Correct 45 ms 9464 KB Output is correct
74 Correct 48 ms 10488 KB Output is correct
75 Correct 54 ms 10104 KB Output is correct
76 Correct 62 ms 10360 KB Output is correct
77 Correct 52 ms 10104 KB Output is correct
78 Correct 48 ms 9848 KB Output is correct
79 Correct 50 ms 10232 KB Output is correct
80 Correct 44 ms 9720 KB Output is correct
81 Correct 50 ms 9640 KB Output is correct
82 Correct 43 ms 9592 KB Output is correct
83 Correct 43 ms 9524 KB Output is correct
84 Correct 60 ms 9720 KB Output is correct
85 Correct 59 ms 10616 KB Output is correct
86 Correct 50 ms 10104 KB Output is correct
87 Correct 50 ms 9976 KB Output is correct
88 Correct 54 ms 10360 KB Output is correct
89 Correct 53 ms 10616 KB Output is correct
90 Correct 58 ms 10488 KB Output is correct
91 Correct 49 ms 10232 KB Output is correct
92 Correct 53 ms 10616 KB Output is correct
93 Correct 50 ms 10360 KB Output is correct
94 Correct 54 ms 10744 KB Output is correct
95 Correct 55 ms 10744 KB Output is correct
96 Correct 49 ms 9976 KB Output is correct
97 Correct 49 ms 10232 KB Output is correct
98 Correct 51 ms 10232 KB Output is correct
99 Correct 50 ms 10232 KB Output is correct
100 Correct 56 ms 10744 KB Output is correct
101 Correct 51 ms 10232 KB Output is correct
102 Correct 58 ms 10360 KB Output is correct