oj.uz

Submission #151682

# Submission time Handle Problem Language Result Execution time Memory
151682 2019-09-04T06:33:47 Z dolphingarlic Wiring (IOI17_wiring) C++14
100 / 100
 45 ms 9468 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define fi first
#define se second

const int mxN=1e5;
const ll INF=1e18;
ll p[2*mxN], ps[2*mxN+1], dp[2*mxN+1], mn1[mxN+1]={INF};

ll min_total_length(vector<int> r, vector<int> b) {
	int n=r.size()+b.size();
	vector<pii> cls;
	for(int i=0, ri=0, bi=0, lc=-1, cc; i<n; ++i, lc=cc) {
		if(ri>=r.size()||bi<b.size()&&b[bi]<r[ri]) {
			p[i]=b[bi++];
			cc=0;
		} else {
			p[i]=r[ri++];
			cc=1;
		}
		ps[i+1]=p[i]+ps[i];
		if(cc!=lc)
			cls.push_back({i, i});
		else
			++cls.back().se;
	}
	for(int i=cls[0].fi; i<=cls[0].se; ++i)
		dp[i+1]=INF;
	for(int bi=0; bi<cls.size()-1; ++bi) {
		for(int i=0; i<=cls[bi].se-cls[bi].fi; ++i)
			mn1[i+1]=min(min(dp[i+cls[bi].fi], dp[cls[bi+1].fi])+(cls[bi].se-cls[bi].fi+1-i)*p[cls[bi+1].fi]+ps[cls[bi].fi+i], mn1[i]);
		ll mn2=INF;
		for(int i=0; i<=cls[bi+1].se-cls[bi+1].fi; ++i) {
			dp[i+cls[bi+1].fi+1]=mn2-(i+1)*p[cls[bi].se];
			if(i<=cls[bi].se-cls[bi].fi) {
				dp[i+cls[bi+1].fi+1]=min(mn1[cls[bi].se-cls[bi].fi+1-i]-(i+1)*p[cls[bi+1].fi], dp[i+cls[bi+1].fi+1]);
				mn2=min(min(dp[cls[bi].se-i], dp[cls[bi+1].fi])+(i+1)*p[cls[bi].se]+ps[cls[bi].se-i], mn2);
			}
			dp[i+cls[bi+1].fi+1]+=ps[cls[bi+1].fi+i+1]-2*ps[cls[bi+1].fi];
		}
	}
	return dp[n];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:18:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ri>=r.size()||bi<b.size()&&b[bi]<r[ri]) {
      ~~^~~~~~~~~~
wiring.cpp:18:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ri>=r.size()||bi<b.size()&&b[bi]<r[ri]) {
                    ~~^~~~~~~~~
wiring.cpp:18:31: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   if(ri>=r.size()||bi<b.size()&&b[bi]<r[ri]) {
wiring.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int bi=0; bi<cls.size()-1; ++bi) {
                ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 32 ms 7260 KB Output is correct
4 Correct 31 ms 7288 KB Output is correct
5 Correct 31 ms 6904 KB Output is correct
6 Correct 41 ms 9344 KB Output is correct
7 Correct 41 ms 9336 KB Output is correct
8 Correct 41 ms 9468 KB Output is correct
9 Correct 41 ms 9336 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 43 ms 9044 KB Output is correct
4 Correct 38 ms 8560 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 43 ms 9204 KB Output is correct
19 Correct 42 ms 9076 KB Output is correct
20 Correct 42 ms 8948 KB Output is correct
21 Correct 43 ms 9084 KB Output is correct
22 Correct 43 ms 9072 KB Output is correct
23 Correct 42 ms 9072 KB Output is correct
24 Correct 45 ms 9072 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 32 ms 7928 KB Output is correct
3 Correct 33 ms 8180 KB Output is correct
4 Correct 33 ms 7900 KB Output is correct
5 Correct 34 ms 8180 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 33 ms 8184 KB Output is correct
19 Correct 33 ms 7928 KB Output is correct
20 Correct 32 ms 7928 KB Output is correct
21 Correct 32 ms 8056 KB Output is correct
22 Correct 33 ms 8440 KB Output is correct
23 Correct 33 ms 8568 KB Output is correct
24 Correct 33 ms 8440 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 32 ms 7260 KB Output is correct
20 Correct 31 ms 7288 KB Output is correct
21 Correct 31 ms 6904 KB Output is correct
22 Correct 41 ms 9344 KB Output is correct
23 Correct 41 ms 9336 KB Output is correct
24 Correct 41 ms 9468 KB Output is correct
25 Correct 41 ms 9336 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 43 ms 9044 KB Output is correct
29 Correct 38 ms 8560 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 380 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 43 ms 9204 KB Output is correct
44 Correct 42 ms 9076 KB Output is correct
45 Correct 42 ms 8948 KB Output is correct
46 Correct 43 ms 9084 KB Output is correct
47 Correct 43 ms 9072 KB Output is correct
48 Correct 42 ms 9072 KB Output is correct
49 Correct 45 ms 9072 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 32 ms 7928 KB Output is correct
52 Correct 33 ms 8180 KB Output is correct
53 Correct 33 ms 7900 KB Output is correct
54 Correct 34 ms 8180 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 376 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 33 ms 8184 KB Output is correct
68 Correct 33 ms 7928 KB Output is correct
69 Correct 32 ms 7928 KB Output is correct
70 Correct 32 ms 8056 KB Output is correct
71 Correct 33 ms 8440 KB Output is correct
72 Correct 33 ms 8568 KB Output is correct
73 Correct 33 ms 8440 KB Output is correct
74 Correct 41 ms 9128 KB Output is correct
75 Correct 36 ms 8568 KB Output is correct
76 Correct 41 ms 9092 KB Output is correct
77 Correct 35 ms 8484 KB Output is correct
78 Correct 34 ms 8540 KB Output is correct
79 Correct 35 ms 8448 KB Output is correct
80 Correct 36 ms 8440 KB Output is correct
81 Correct 36 ms 8696 KB Output is correct
82 Correct 35 ms 8696 KB Output is correct
83 Correct 36 ms 8824 KB Output is correct
84 Correct 42 ms 9208 KB Output is correct
85 Correct 43 ms 8832 KB Output is correct
86 Correct 41 ms 9128 KB Output is correct
87 Correct 42 ms 9208 KB Output is correct
88 Correct 43 ms 8968 KB Output is correct
89 Correct 41 ms 8952 KB Output is correct
90 Correct 42 ms 8952 KB Output is correct
91 Correct 41 ms 9212 KB Output is correct
92 Correct 41 ms 9088 KB Output is correct
93 Correct 41 ms 9112 KB Output is correct
94 Correct 42 ms 9128 KB Output is correct
95 Correct 41 ms 8952 KB Output is correct
96 Correct 42 ms 9080 KB Output is correct
97 Correct 44 ms 9216 KB Output is correct
98 Correct 41 ms 9208 KB Output is correct
99 Correct 41 ms 9220 KB Output is correct
100 Correct 41 ms 9088 KB Output is correct
101 Correct 41 ms 9336 KB Output is correct
102 Correct 40 ms 9080 KB Output is correct