oj.uz

Submission #217071

# Submission time Handle Problem Language Result Execution time Memory
217071 2020-03-28T21:54:48 Z davitmarg Wiring (IOI17_wiring) C++17
100 / 100
 108 ms 22880 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()


#ifndef death
#include "wiring.h"
#endif // !death


using namespace std;

const int N = 200005;

vector<pair<LL, int>> a;
int n, k;
vector<vector<LL>> block, sf,pr,dp;

LL last(int i, int j)
{
	if (i+j == 0)
		return 0;
	if (j == 0)
		return dp[i - 1].back();
	return dp[i][j - 1];
}

LL min_total_length(vector<int> r, vector<int> b)
{
	for (int i = 0; i < r.size(); i++)
		a.push_back(MP(r[i], 0));
	for (int i = 0; i < b.size(); i++)
		a.push_back(MP(b[i], 1));
	n = r.size() + b.size();
	sort(all(a));
	for (int i = 0; i < n; i++)
	{
		if (!i || a[i].second != a[i - 1].second)
		{
			block.push_back(vector<LL>(0));
			sf.push_back(vector<LL>(0));
			pr.push_back(vector<LL>(0));
			dp.push_back(vector<LL>(0));
		}
		block.back().push_back(a[i].first);
	}

	k = block.size();
	for (int i = 0; i < k; i++)
	{
		LL dist;
		LL sum;

		dp[i].resize(block[i].size(), mod * mod);
		if (i)
		{
			sum = 0;
			dist = block[i][0] - block[i - 1].back();
			for (LL j = 0; j < block[i].size(); j++)
			{
				sum += block[i][j] - block[i][0];
				dp[i][j] = min(dp[i][j], sf[i - 1][max((int)sf[i - 1].size() - (int)j - 1,0)] + (j + 1ll) * dist + sum);
				if (j + 1 < block[i - 1].size())
					dp[i][j] = min(dp[i][j], pr[i - 1][pr[i - 1].size() - j - 2] + sum);
			}
		}

		if (i == k - 1)
			break;
		sum = 0;
		dist = block[i + 1][0] - block[i].back();

		sf[i].resize(block[i].size() + 1, mod * mod);
		pr[i].resize(block[i].size(), mod * mod);

		for (LL j = block[i].size() - 1; j >= 0; j--)
		{
			sum += block[i].back() - block[i][j];
			sf[i][j] = min(sf[i][j + 1], sum + min(last(i, j), dp[i][j]));
			pr[i][j] = sum + min(last(i, j), dp[i][j]) + (block[i].size() - j) * dist;
		}
		sf[i].pop_back();
		for (LL j = 1; j < block[i].size(); j++)
			pr[i][j] = min(pr[i][j], pr[i][j - 1]);

	}
	return dp.back().back();
}


#ifdef death

int main()
{
	int X, Y;
	vector<int> x, y;
	cin >> X >> Y;
	while (X--)
	{
		x.push_back(0);
		cin >> x.back();
	}
	while (Y--)
	{
		y.push_back(0);
		cin >> y.back();
	}
	cout << "!!!! " << min_total_length(x, y) << endl;
	return 0;
}

#endif // death


/*
	
4 5
1 2 3 7
0 4 5 9 10

3 2
1 10 11
2 13

1 2
5
0 10

*/

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:50:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < r.size(); i++)
                  ~~^~~~~~~~~~
wiring.cpp:52:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < b.size(); i++)
                  ~~^~~~~~~~~~
wiring.cpp:79:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (LL j = 0; j < block[i].size(); j++)
                   ~~^~~~~~~~~~~~~~~~~
wiring.cpp:83:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (j + 1 < block[i - 1].size())
         ~~~~~~^~~~~~~~~~~~~~~~~~~~~
wiring.cpp:103:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (LL j = 1; j < block[i].size(); j++)
                  ~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 44 ms 8036 KB Output is correct
4 Correct 40 ms 8036 KB Output is correct
5 Correct 41 ms 7524 KB Output is correct
6 Correct 52 ms 9956 KB Output is correct
7 Correct 52 ms 9956 KB Output is correct
8 Correct 51 ms 9956 KB Output is correct
9 Correct 53 ms 9956 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 108 ms 21104 KB Output is correct
4 Correct 83 ms 19424 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 372 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 97 ms 22880 KB Output is correct
19 Correct 95 ms 22880 KB Output is correct
20 Correct 90 ms 19808 KB Output is correct
21 Correct 100 ms 22880 KB Output is correct
22 Correct 93 ms 21728 KB Output is correct
23 Correct 95 ms 21728 KB Output is correct
24 Correct 94 ms 21728 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 57 ms 11488 KB Output is correct
3 Correct 75 ms 15072 KB Output is correct
4 Correct 63 ms 11876 KB Output is correct
5 Correct 74 ms 15072 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 62 ms 12644 KB Output is correct
19 Correct 59 ms 12896 KB Output is correct
20 Correct 58 ms 12896 KB Output is correct
21 Correct 54 ms 12768 KB Output is correct
22 Correct 56 ms 12644 KB Output is correct
23 Correct 51 ms 12132 KB Output is correct
24 Correct 53 ms 12388 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 44 ms 8036 KB Output is correct
20 Correct 40 ms 8036 KB Output is correct
21 Correct 41 ms 7524 KB Output is correct
22 Correct 52 ms 9956 KB Output is correct
23 Correct 52 ms 9956 KB Output is correct
24 Correct 51 ms 9956 KB Output is correct
25 Correct 53 ms 9956 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 4 ms 256 KB Output is correct
28 Correct 108 ms 21104 KB Output is correct
29 Correct 83 ms 19424 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 4 ms 256 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 5 ms 256 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 372 KB Output is correct
37 Correct 4 ms 256 KB Output is correct
38 Correct 4 ms 256 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 97 ms 22880 KB Output is correct
44 Correct 95 ms 22880 KB Output is correct
45 Correct 90 ms 19808 KB Output is correct
46 Correct 100 ms 22880 KB Output is correct
47 Correct 93 ms 21728 KB Output is correct
48 Correct 95 ms 21728 KB Output is correct
49 Correct 94 ms 21728 KB Output is correct
50 Correct 5 ms 256 KB Output is correct
51 Correct 57 ms 11488 KB Output is correct
52 Correct 75 ms 15072 KB Output is correct
53 Correct 63 ms 11876 KB Output is correct
54 Correct 74 ms 15072 KB Output is correct
55 Correct 4 ms 384 KB Output is correct
56 Correct 5 ms 256 KB Output is correct
57 Correct 4 ms 256 KB Output is correct
58 Correct 4 ms 256 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 5 ms 256 KB Output is correct
61 Correct 4 ms 256 KB Output is correct
62 Correct 5 ms 256 KB Output is correct
63 Correct 5 ms 384 KB Output is correct
64 Correct 4 ms 384 KB Output is correct
65 Correct 4 ms 384 KB Output is correct
66 Correct 5 ms 384 KB Output is correct
67 Correct 62 ms 12644 KB Output is correct
68 Correct 59 ms 12896 KB Output is correct
69 Correct 58 ms 12896 KB Output is correct
70 Correct 54 ms 12768 KB Output is correct
71 Correct 56 ms 12644 KB Output is correct
72 Correct 51 ms 12132 KB Output is correct
73 Correct 53 ms 12388 KB Output is correct
74 Correct 55 ms 13668 KB Output is correct
75 Correct 63 ms 13028 KB Output is correct
76 Correct 64 ms 13540 KB Output is correct
77 Correct 60 ms 12900 KB Output is correct
78 Correct 58 ms 12772 KB Output is correct
79 Correct 59 ms 12900 KB Output is correct
80 Correct 52 ms 12900 KB Output is correct
81 Correct 57 ms 13540 KB Output is correct
82 Correct 52 ms 12776 KB Output is correct
83 Correct 54 ms 12260 KB Output is correct
84 Correct 56 ms 12772 KB Output is correct
85 Correct 65 ms 13412 KB Output is correct
86 Correct 57 ms 13284 KB Output is correct
87 Correct 59 ms 12644 KB Output is correct
88 Correct 61 ms 13540 KB Output is correct
89 Correct 59 ms 13412 KB Output is correct
90 Correct 67 ms 13644 KB Output is correct
91 Correct 56 ms 13288 KB Output is correct
92 Correct 61 ms 13412 KB Output is correct
93 Correct 58 ms 13540 KB Output is correct
94 Correct 60 ms 13284 KB Output is correct
95 Correct 64 ms 13412 KB Output is correct
96 Correct 55 ms 12904 KB Output is correct
97 Correct 57 ms 13540 KB Output is correct
98 Correct 59 ms 13540 KB Output is correct
99 Correct 59 ms 13536 KB Output is correct
100 Correct 64 ms 13408 KB Output is correct
101 Correct 62 ms 13796 KB Output is correct
102 Correct 67 ms 13540 KB Output is correct