oj.uz

Submission #120173

# Submission time Handle Problem Language Result Execution time Memory
120173 2019-06-23T16:19:24 Z MvC Wiring (IOI17_wiring) C++14
100 / 100
 151 ms 51180 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include "wiring.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const ll nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,m,i,j,t,g;
ll x,y,cur;
vector<ll>ans[nmax],mn[nmax],suf[nmax],bst[nmax],gr[nmax],sf[nmax];
vector<pair<ll,int> >a;
ll min_total_length(vector<int>R,vector<int>B)
{
	n=R.size(),m=B.size();
	for(i=1;i<=n;i++)
	{
		x=R[i-1];
		a.pb(mkp(x,0));
	}
	for(i=1;i<=m;i++)
	{
		x=B[i-1];
		a.pb(mkp(x,1));
	}
	sort(a.begin(),a.end());
	for(i=0;i<n+m;i++)
	{
		if(!i || a[i-1].sc!=a[i].sc)g++;
		gr[g].pb(a[i].fr);
	}
	for(i=1;i<=g;i++)
	{
		for(j=gr[i].size()-1,t=0;j>=0;j--,t++)
		{
			suf[i].pb(0);
			ans[i].pb(0);
			bst[i].pb(0);
			mn[i].pb(0);
			sf[i].pb(0);
			suf[i][t]=gr[i].back()-gr[i][j];
			if(t)suf[i][t]+=suf[i][t-1];
		}
		if(i>2)
		{
			x=0;
			for(j=0;j<gr[i].size();j++)
			{
				x+=gr[i][j]-gr[i][0];
				y=1LL*(j+1)*(gr[i][0]-gr[i-1].back());
				cur=x+y+bst[i-1][min(j,(int)gr[i-1].size()-1)];
				if(j+1<gr[i-1].size())cur=min(cur,x+mn[i-1][j+1]);
				ans[i][j]=cur;
			}
		}
		else if(i==2)
		{
			x=0;
			for(j=0;j<gr[i].size();j++)
			{
				x+=gr[i][j]-gr[i][0];
				y=1LL*max((int)gr[1].size(),j+1)*(gr[2][0]-gr[1].back());
				ans[i][j]=x+y+suf[1].back();
			}
		}
		if(i<g && i>1)
		{
			for(j=gr[i].size()-1;j>=0;j--)
			{
				sf[i][j]=gr[i+1][0]-gr[i][j];
				if(j+1<gr[i].size())sf[i][j]+=sf[i][j+1];
			}
			cur=llinf;
			for(j=0;j<gr[i].size();j++)
			{
				if(i==2 && !j)continue;
				if(j)cur=min(cur,ans[i][j-1]+sf[i][j]);
				else cur=min(cur,ans[i-1].back()+sf[i][j]);
				x=0;
				if(j+1<gr[i].size())x=sf[i][j+1];
				ans[i][j]=min(ans[i][j],cur-x);
			}
			for(j=gr[i].size()-1,t=0;j>=0;j--,t++)
			{
				bst[i][t]=suf[i][t];
				if(j)bst[i][t]+=ans[i][j-1];
				else
				{
					if(i==2)bst[i][t]+=ans[i][0];
					else bst[i][t]+=ans[i-1].back();
				}
				if(t)bst[i][t]=min(bst[i][t],bst[i][t-1]);
				mn[i][j]=suf[i][j]+1LL*(j+1)*(gr[i+1][0]-gr[i].back());
				if(t)mn[i][j]+=ans[i][t-1];
				else
				{
					if(i==2)mn[i][j]+=ans[i][0];
					else mn[i][j]+=ans[i-1].back();
				}
				if(j<gr[i].size()-1)mn[i][j]=min(mn[i][j],mn[i][j+1]);
			}
		}
	}
	return ans[g].back();
}

Compilation message

wiring.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
wiring.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:60:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0;j<gr[i].size();j++)
            ~^~~~~~~~~~~~~
wiring.cpp:65:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(j+1<gr[i-1].size())cur=min(cur,x+mn[i-1][j+1]);
        ~~~^~~~~~~~~~~~~~~
wiring.cpp:72:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0;j<gr[i].size();j++)
            ~^~~~~~~~~~~~~
wiring.cpp:84:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(j+1<gr[i].size())sf[i][j]+=sf[i][j+1];
        ~~~^~~~~~~~~~~~~
wiring.cpp:87:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0;j<gr[i].size();j++)
            ~^~~~~~~~~~~~~
wiring.cpp:93:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(j+1<gr[i].size())x=sf[i][j+1];
        ~~~^~~~~~~~~~~~~
wiring.cpp:113:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(j<gr[i].size()-1)mn[i][j]=min(mn[i][j],mn[i][j+1]);
        ~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 28544 KB Output is correct
2 Correct 28 ms 28544 KB Output is correct
3 Correct 27 ms 28536 KB Output is correct
4 Correct 26 ms 28544 KB Output is correct
5 Correct 25 ms 28544 KB Output is correct
6 Correct 26 ms 28544 KB Output is correct
7 Correct 26 ms 28536 KB Output is correct
8 Correct 26 ms 28540 KB Output is correct
9 Correct 27 ms 28544 KB Output is correct
10 Correct 26 ms 28544 KB Output is correct
11 Correct 26 ms 28544 KB Output is correct
12 Correct 26 ms 28544 KB Output is correct
13 Correct 27 ms 28568 KB Output is correct
14 Correct 26 ms 28592 KB Output is correct
15 Correct 26 ms 28544 KB Output is correct
16 Correct 28 ms 28588 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 28596 KB Output is correct
2 Correct 27 ms 28616 KB Output is correct
3 Correct 66 ms 40888 KB Output is correct
4 Correct 66 ms 40960 KB Output is correct
5 Correct 65 ms 42340 KB Output is correct
6 Correct 78 ms 45000 KB Output is correct
7 Correct 77 ms 44900 KB Output is correct
8 Correct 74 ms 44896 KB Output is correct
9 Correct 76 ms 44900 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 28536 KB Output is correct
2 Correct 26 ms 28536 KB Output is correct
3 Correct 151 ms 51180 KB Output is correct
4 Correct 139 ms 48992 KB Output is correct
5 Correct 26 ms 28516 KB Output is correct
6 Correct 25 ms 28544 KB Output is correct
7 Correct 27 ms 28508 KB Output is correct
8 Correct 27 ms 28592 KB Output is correct
9 Correct 26 ms 28544 KB Output is correct
10 Correct 26 ms 28544 KB Output is correct
11 Correct 26 ms 28544 KB Output is correct
12 Correct 27 ms 28544 KB Output is correct
13 Correct 25 ms 28544 KB Output is correct
14 Correct 26 ms 28544 KB Output is correct
15 Correct 26 ms 28544 KB Output is correct
16 Correct 28 ms 28536 KB Output is correct
17 Correct 26 ms 28540 KB Output is correct
18 Correct 148 ms 51040 KB Output is correct
19 Correct 148 ms 51064 KB Output is correct
20 Correct 133 ms 48836 KB Output is correct
21 Correct 148 ms 51040 KB Output is correct
22 Correct 148 ms 50272 KB Output is correct
23 Correct 148 ms 50116 KB Output is correct
24 Correct 147 ms 50144 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 28544 KB Output is correct
2 Correct 85 ms 45208 KB Output is correct
3 Correct 117 ms 49632 KB Output is correct
4 Correct 88 ms 47328 KB Output is correct
5 Correct 118 ms 49632 KB Output is correct
6 Correct 25 ms 28536 KB Output is correct
7 Correct 26 ms 28544 KB Output is correct
8 Correct 27 ms 28544 KB Output is correct
9 Correct 26 ms 28544 KB Output is correct
10 Correct 27 ms 28544 KB Output is correct
11 Correct 27 ms 28544 KB Output is correct
12 Correct 26 ms 28544 KB Output is correct
13 Correct 27 ms 28544 KB Output is correct
14 Correct 29 ms 28516 KB Output is correct
15 Correct 28 ms 28672 KB Output is correct
16 Correct 26 ms 28536 KB Output is correct
17 Correct 27 ms 28544 KB Output is correct
18 Correct 85 ms 45868 KB Output is correct
19 Correct 90 ms 45280 KB Output is correct
20 Correct 86 ms 46816 KB Output is correct
21 Correct 80 ms 46164 KB Output is correct
22 Correct 83 ms 46176 KB Output is correct
23 Correct 76 ms 46052 KB Output is correct
24 Correct 83 ms 46048 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 28544 KB Output is correct
2 Correct 28 ms 28544 KB Output is correct
3 Correct 27 ms 28536 KB Output is correct
4 Correct 26 ms 28544 KB Output is correct
5 Correct 25 ms 28544 KB Output is correct
6 Correct 26 ms 28544 KB Output is correct
7 Correct 26 ms 28536 KB Output is correct
8 Correct 26 ms 28540 KB Output is correct
9 Correct 27 ms 28544 KB Output is correct
10 Correct 26 ms 28544 KB Output is correct
11 Correct 26 ms 28544 KB Output is correct
12 Correct 26 ms 28544 KB Output is correct
13 Correct 27 ms 28568 KB Output is correct
14 Correct 26 ms 28592 KB Output is correct
15 Correct 26 ms 28544 KB Output is correct
16 Correct 28 ms 28588 KB Output is correct
17 Correct 26 ms 28596 KB Output is correct
18 Correct 27 ms 28616 KB Output is correct
19 Correct 66 ms 40888 KB Output is correct
20 Correct 66 ms 40960 KB Output is correct
21 Correct 65 ms 42340 KB Output is correct
22 Correct 78 ms 45000 KB Output is correct
23 Correct 77 ms 44900 KB Output is correct
24 Correct 74 ms 44896 KB Output is correct
25 Correct 76 ms 44900 KB Output is correct
26 Correct 27 ms 28536 KB Output is correct
27 Correct 26 ms 28536 KB Output is correct
28 Correct 151 ms 51180 KB Output is correct
29 Correct 139 ms 48992 KB Output is correct
30 Correct 26 ms 28516 KB Output is correct
31 Correct 25 ms 28544 KB Output is correct
32 Correct 27 ms 28508 KB Output is correct
33 Correct 27 ms 28592 KB Output is correct
34 Correct 26 ms 28544 KB Output is correct
35 Correct 26 ms 28544 KB Output is correct
36 Correct 26 ms 28544 KB Output is correct
37 Correct 27 ms 28544 KB Output is correct
38 Correct 25 ms 28544 KB Output is correct
39 Correct 26 ms 28544 KB Output is correct
40 Correct 26 ms 28544 KB Output is correct
41 Correct 28 ms 28536 KB Output is correct
42 Correct 26 ms 28540 KB Output is correct
43 Correct 148 ms 51040 KB Output is correct
44 Correct 148 ms 51064 KB Output is correct
45 Correct 133 ms 48836 KB Output is correct
46 Correct 148 ms 51040 KB Output is correct
47 Correct 148 ms 50272 KB Output is correct
48 Correct 148 ms 50116 KB Output is correct
49 Correct 147 ms 50144 KB Output is correct
50 Correct 25 ms 28544 KB Output is correct
51 Correct 85 ms 45208 KB Output is correct
52 Correct 117 ms 49632 KB Output is correct
53 Correct 88 ms 47328 KB Output is correct
54 Correct 118 ms 49632 KB Output is correct
55 Correct 25 ms 28536 KB Output is correct
56 Correct 26 ms 28544 KB Output is correct
57 Correct 27 ms 28544 KB Output is correct
58 Correct 26 ms 28544 KB Output is correct
59 Correct 27 ms 28544 KB Output is correct
60 Correct 27 ms 28544 KB Output is correct
61 Correct 26 ms 28544 KB Output is correct
62 Correct 27 ms 28544 KB Output is correct
63 Correct 29 ms 28516 KB Output is correct
64 Correct 28 ms 28672 KB Output is correct
65 Correct 26 ms 28536 KB Output is correct
66 Correct 27 ms 28544 KB Output is correct
67 Correct 85 ms 45868 KB Output is correct
68 Correct 90 ms 45280 KB Output is correct
69 Correct 86 ms 46816 KB Output is correct
70 Correct 80 ms 46164 KB Output is correct
71 Correct 83 ms 46176 KB Output is correct
72 Correct 76 ms 46052 KB Output is correct
73 Correct 83 ms 46048 KB Output is correct
74 Correct 79 ms 46888 KB Output is correct
75 Correct 88 ms 46176 KB Output is correct
76 Correct 88 ms 47360 KB Output is correct
77 Correct 84 ms 45540 KB Output is correct
78 Correct 83 ms 46984 KB Output is correct
79 Correct 82 ms 46432 KB Output is correct
80 Correct 79 ms 46748 KB Output is correct
81 Correct 83 ms 47584 KB Output is correct
82 Correct 79 ms 45800 KB Output is correct
83 Correct 83 ms 47076 KB Output is correct
84 Correct 79 ms 47204 KB Output is correct
85 Correct 90 ms 46304 KB Output is correct
86 Correct 89 ms 47268 KB Output is correct
87 Correct 83 ms 46732 KB Output is correct
88 Correct 87 ms 46560 KB Output is correct
89 Correct 93 ms 45536 KB Output is correct
90 Correct 145 ms 46560 KB Output is correct
91 Correct 86 ms 46312 KB Output is correct
92 Correct 88 ms 47788 KB Output is correct
93 Correct 81 ms 46468 KB Output is correct
94 Correct 85 ms 46560 KB Output is correct
95 Correct 86 ms 45540 KB Output is correct
96 Correct 80 ms 46944 KB Output is correct
97 Correct 80 ms 47336 KB Output is correct
98 Correct 83 ms 46560 KB Output is correct
99 Correct 83 ms 46560 KB Output is correct
100 Correct 89 ms 47428 KB Output is correct
101 Correct 83 ms 46820 KB Output is correct
102 Correct 89 ms 46816 KB Output is correct