Submission #425952

# Submission time Handle Problem Language Result Execution time Memory
425952 2021-06-13T12:33:15 Z arayi Wiring (IOI17_wiring) C++17
100 / 100
69 ms 8744 KB
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define lli long long
#define ad push_back
#define MP make_pair
#define sc second
#define fr first

const int N = 1e6 + 30;
const lli mod = 1e17;
int n, m;
lli dp[N], sum[N];
vector<pair<int, int> > a;
lli s(int l, int r)
{
	lli ret = sum[r];
	if(l) ret -= sum[l - 1];
	return ret;
}
lli sm(int i1, int i2, int l)
{
	lli sum1 = s(i1, l), sum2 = s(l + 1, i2); 
	lli s1 = l-i1+1, s2=i2-l;
	if(s1 > s2)
		sum2 += (s1-s2) * a[l+1].fr;
	else
		sum1 += (s2-s1) * a[l].fr;
	sum2 -= sum1;
	if(i1 == 0) return sum2;
	return sum2 + min(dp[i1], dp[i1-1]);

}
long long min_total_length(vector<int> r, vector<int> b) 
{
	n=r.size(), m=b.size();
	for(auto p : r) a.ad(MP(p, 0));
	for(auto p : b) a.ad(MP(p, 1));
	sort(a.begin(), a.end());
	for (int i = 0; i < a.size(); i++)
	{
		sum[i]=a[i].fr;
		if(i) sum[i] += sum[i-1];
	}
	int i;
	for (i = 0; i < a.size(); i++)
	{
		dp[i] = mod;
		if(a[i].sc != a[i+1].sc) break;
	}
	int l = i, i1 = 0;
	i++;
	for (; i < a.size(); i++)
	{
		while (i1 > 0 && a[i1].sc == a[i1-1].sc)
		{
			if(sm(i1 - 1, i, l) < sm(i1, i, l)) i1--;
			else break;
		}
		dp[i] = sm(i1, i, l);
		if(i < a.size() - 1 && a[i].sc != a[i+1].sc) i1=l=i;
	}
	return dp[n + m - 1];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for (int i = 0; i < a.size(); i++)
      |                  ~~^~~~~~~~~~
wiring.cpp:46:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for (i = 0; i < a.size(); i++)
      |              ~~^~~~~~~~~~
wiring.cpp:53:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |  for (; i < a.size(); i++)
      |         ~~^~~~~~~~~~
wiring.cpp:61:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   if(i < a.size() - 1 && a[i].sc != a[i+1].sc) i1=l=i;
      |      ~~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 29 ms 5100 KB Output is correct
4 Correct 31 ms 5032 KB Output is correct
5 Correct 30 ms 5096 KB Output is correct
6 Correct 38 ms 6576 KB Output is correct
7 Correct 40 ms 6700 KB Output is correct
8 Correct 38 ms 6704 KB Output is correct
9 Correct 41 ms 6688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 57 ms 6996 KB Output is correct
4 Correct 55 ms 8168 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 58 ms 8600 KB Output is correct
19 Correct 57 ms 8568 KB Output is correct
20 Correct 69 ms 8600 KB Output is correct
21 Correct 53 ms 8612 KB Output is correct
22 Correct 56 ms 8628 KB Output is correct
23 Correct 57 ms 8620 KB Output is correct
24 Correct 58 ms 8572 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 62 ms 7040 KB Output is correct
3 Correct 64 ms 7960 KB Output is correct
4 Correct 52 ms 7960 KB Output is correct
5 Correct 50 ms 7916 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 58 ms 7844 KB Output is correct
19 Correct 48 ms 7932 KB Output is correct
20 Correct 47 ms 7972 KB Output is correct
21 Correct 44 ms 7844 KB Output is correct
22 Correct 46 ms 7840 KB Output is correct
23 Correct 45 ms 7860 KB Output is correct
24 Correct 41 ms 7852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 29 ms 5100 KB Output is correct
20 Correct 31 ms 5032 KB Output is correct
21 Correct 30 ms 5096 KB Output is correct
22 Correct 38 ms 6576 KB Output is correct
23 Correct 40 ms 6700 KB Output is correct
24 Correct 38 ms 6704 KB Output is correct
25 Correct 41 ms 6688 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 57 ms 6996 KB Output is correct
29 Correct 55 ms 8168 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 308 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 58 ms 8600 KB Output is correct
44 Correct 57 ms 8568 KB Output is correct
45 Correct 69 ms 8600 KB Output is correct
46 Correct 53 ms 8612 KB Output is correct
47 Correct 56 ms 8628 KB Output is correct
48 Correct 57 ms 8620 KB Output is correct
49 Correct 58 ms 8572 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 62 ms 7040 KB Output is correct
52 Correct 64 ms 7960 KB Output is correct
53 Correct 52 ms 7960 KB Output is correct
54 Correct 50 ms 7916 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 308 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 58 ms 7844 KB Output is correct
68 Correct 48 ms 7932 KB Output is correct
69 Correct 47 ms 7972 KB Output is correct
70 Correct 44 ms 7844 KB Output is correct
71 Correct 46 ms 7840 KB Output is correct
72 Correct 45 ms 7860 KB Output is correct
73 Correct 41 ms 7852 KB Output is correct
74 Correct 43 ms 8612 KB Output is correct
75 Correct 53 ms 8204 KB Output is correct
76 Correct 49 ms 8572 KB Output is correct
77 Correct 51 ms 8096 KB Output is correct
78 Correct 44 ms 7988 KB Output is correct
79 Correct 51 ms 7988 KB Output is correct
80 Correct 40 ms 7972 KB Output is correct
81 Correct 47 ms 8100 KB Output is correct
82 Correct 39 ms 8060 KB Output is correct
83 Correct 39 ms 8244 KB Output is correct
84 Correct 39 ms 8600 KB Output is correct
85 Correct 54 ms 8580 KB Output is correct
86 Correct 43 ms 8608 KB Output is correct
87 Correct 45 ms 8628 KB Output is correct
88 Correct 46 ms 8604 KB Output is correct
89 Correct 45 ms 8604 KB Output is correct
90 Correct 55 ms 8604 KB Output is correct
91 Correct 42 ms 8628 KB Output is correct
92 Correct 46 ms 8632 KB Output is correct
93 Correct 44 ms 8608 KB Output is correct
94 Correct 46 ms 8624 KB Output is correct
95 Correct 49 ms 8628 KB Output is correct
96 Correct 42 ms 8604 KB Output is correct
97 Correct 44 ms 8612 KB Output is correct
98 Correct 45 ms 8620 KB Output is correct
99 Correct 45 ms 8592 KB Output is correct
100 Correct 51 ms 8744 KB Output is correct
101 Correct 46 ms 8616 KB Output is correct
102 Correct 66 ms 8628 KB Output is correct