oj.uz

답안 #151800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151800 2019-09-04T17:55:18 Z qkxwsm 전선 연결 (IOI17_wiring) C++14
100 / 100
 110 ms 26940 KB 
/*
PROG: ffff
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
 */
#include <bits/stdc++.h>

using namespace std;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long randomize(long long mod)
{
	return ((1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}

#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-20;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 200013

long long normalize(long long x, long long mod = INF)
{
	return (((x % mod) + mod) % mod);
}

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N, M, K = -1;
vector<ll> A, B;
vector<pll> pts;
vector<ll> group[MAXN];
vector<ll> psum[MAXN];
ll dp[2][MAXN];
int pref[MAXN];

ll rsum(int idx, int lt, int rt)
{
	return psum[idx][rt + 1] - psum[idx][lt];
}
ll cost(int idx, int a, int b)
{
	if (a == group[idx].size())
	{
		if (b < 0) return 0ll;
		a--;
	}
	if (b < 0) b++;
	ll res = 0;
	res += rsum(idx + 1, 0, b);
	res -= rsum(idx, a, group[idx].size() - 1);
	ll na = group[idx].size() - a;
	if (na >= b + 1)
	{
		res += (na - (b + 1)) * group[idx + 1][0];
	}
	else
	{
		res -= ((b + 1) - na) * group[idx].back();
	}
	return res;
}
void solve(int i, int L, int R, int optl, int optr)
{
	if (L > R)
	{
		return;
	}
	int mid = (L + R)/2, opt = -1;
	for (int j = optl; j <= optr; j++)
	{
		if (dp[0][j] + cost(i, j, mid - 1) < dp[1][mid])
		{
			dp[1][mid] = dp[0][j] + cost(i, j, mid - 1);
			opt = j;
		}
	}
	solve(i, L, mid - 1, opt, optr);
	solve(i, mid + 1, R, optl, opt);
}
ll min_total_length(vector<int> a, vector<int> b)
{
	N = a.size(), M = b.size();
	if (N == 0 || M == 0) return LLINF;
	for (int i = 0; i < N; i++)
	{
		A.PB(a[i]);
		pts.PB(MP(a[i], 0));
	}
	for (int i = 0; i < M; i++)
	{
		B.PB(b[i]);
		pts.PB(MP(b[i], 1));
	}
	sort(pts.begin(), pts.end());
	for (int i = 0; i < N + M; i++)
	{
		if (i == 0 || pts[i].se != pts[i - 1].se)
		{
			K++;
		}
		group[K].PB(pts[i].fi);
	}
	K++;
	for (int i = 0; i < K; i++)
	{
		psum[i].resize(group[i].size() + 1);
		for (int j = 0; j < group[i].size(); j++)
		{
			psum[i][j + 1] = psum[i][j] + group[i][j];
		}
	}
	pref[0] = 0;
	for (int i = 0; i < K; i++)
	{
		pref[i + 1] = pref[i] + group[i].size();
	}
	//	cerr << cost(2, 0, 0) << endl;
//	for (int i = 0; i < K; i++)
//	{
//		cout << "group " << i << ":";
//		for (int x : group[i])
//		{
//			cout << ' ' << x;
//		}
//		cout << '\n';
//	}
	for (int i = 0; i <= N + M; i++)
	{
		dp[0][i] = LLINF;
		dp[1][i] = LLINF;
	}
	dp[0][0] = 0;
	for (int i = 0; i < K - 1; i++)
	{
//		for (int j = 0; j <= group[i].size(); j++)
//		{
//			cerr << dp[0][j] << ' ';
//		}
//		cerr << endl;
		//		cerr << i << endl;
		solve(i, 0, group[i + 1].size(), 0, group[i].size());
//		for (int j = 0; j <= group[i].size(); j++)
//		{
//			//you already have 0...j-1 covered
//			for (int k = 0; k <= group[i + 1].size(); k++)
//			{
//				ckmin(dp[1][k], dp[0][j] + cost(i, j, k - 1));
//				continue;
//			}
//		}
		for (int j = 0; j <= group[i].size(); j++)
		{
			dp[0][j] = LLINF;
		}
		for (int j = 0; j <= group[i + 1].size(); j++)
		{
			dp[0][j] = dp[1][j];
			dp[1][j] = LLINF;
		}
	}
	//	for (int i = 0; i <= K; i++)
	//	{
	//		cerr << pref[i] << endl;
	//	}
	return dp[0][group[K - 1].size()];
}

Compilation message

wiring.cpp: In function 'll cost(int, int, int)':
wiring.cpp:129:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (a == group[idx].size())
      ~~^~~~~~~~~~~~~~~~~~~~
wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:194:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < group[i].size(); j++)
                   ~~^~~~~~~~~~~~~~~~~
wiring.cpp:238:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j <= group[i].size(); j++)
                   ~~^~~~~~~~~~~~~~~~~~
wiring.cpp:242:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j <= group[i + 1].size(); j++)
                   ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 11 ms 9768 KB Output is correct
6 Correct 16 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 10 ms 9720 KB Output is correct
12 Correct 10 ms 9720 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 11 ms 9724 KB Output is correct
15 Correct 11 ms 9720 KB Output is correct
16 Correct 10 ms 9740 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 60 ms 20888 KB Output is correct
4 Correct 60 ms 20872 KB Output is correct
5 Correct 58 ms 21392 KB Output is correct
6 Correct 73 ms 24456 KB Output is correct
7 Correct 75 ms 24372 KB Output is correct
8 Correct 74 ms 24452 KB Output is correct
9 Correct 73 ms 24456 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9848 KB Output is correct
3 Correct 110 ms 26912 KB Output is correct
4 Correct 95 ms 25476 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct
6 Correct 10 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 12 ms 9720 KB Output is correct
12 Correct 10 ms 9720 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 10 ms 9720 KB Output is correct
15 Correct 10 ms 9720 KB Output is correct
16 Correct 10 ms 9692 KB Output is correct
17 Correct 10 ms 9720 KB Output is correct
18 Correct 102 ms 26884 KB Output is correct
19 Correct 102 ms 26940 KB Output is correct
20 Correct 98 ms 25856 KB Output is correct
21 Correct 102 ms 26884 KB Output is correct
22 Correct 109 ms 26624 KB Output is correct
23 Correct 107 ms 26596 KB Output is correct
24 Correct 108 ms 26684 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9720 KB Output is correct
2 Correct 89 ms 24112 KB Output is correct
3 Correct 92 ms 24948 KB Output is correct
4 Correct 84 ms 24072 KB Output is correct
5 Correct 89 ms 24888 KB Output is correct
6 Correct 11 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 11 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 11 ms 9720 KB Output is correct
11 Correct 10 ms 9720 KB Output is correct
12 Correct 11 ms 9720 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 10 ms 9720 KB Output is correct
15 Correct 10 ms 9720 KB Output is correct
16 Correct 11 ms 9720 KB Output is correct
17 Correct 11 ms 9792 KB Output is correct
18 Correct 83 ms 23892 KB Output is correct
19 Correct 81 ms 23724 KB Output is correct
20 Correct 79 ms 24112 KB Output is correct
21 Correct 80 ms 23992 KB Output is correct
22 Correct 82 ms 24068 KB Output is correct
23 Correct 73 ms 24072 KB Output is correct
24 Correct 76 ms 23816 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 11 ms 9768 KB Output is correct
6 Correct 16 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 10 ms 9720 KB Output is correct
12 Correct 10 ms 9720 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 11 ms 9724 KB Output is correct
15 Correct 11 ms 9720 KB Output is correct
16 Correct 10 ms 9740 KB Output is correct
17 Correct 10 ms 9720 KB Output is correct
18 Correct 10 ms 9720 KB Output is correct
19 Correct 60 ms 20888 KB Output is correct
20 Correct 60 ms 20872 KB Output is correct
21 Correct 58 ms 21392 KB Output is correct
22 Correct 73 ms 24456 KB Output is correct
23 Correct 75 ms 24372 KB Output is correct
24 Correct 74 ms 24452 KB Output is correct
25 Correct 73 ms 24456 KB Output is correct
26 Correct 10 ms 9720 KB Output is correct
27 Correct 10 ms 9848 KB Output is correct
28 Correct 110 ms 26912 KB Output is correct
29 Correct 95 ms 25476 KB Output is correct
30 Correct 10 ms 9720 KB Output is correct
31 Correct 10 ms 9720 KB Output is correct
32 Correct 10 ms 9720 KB Output is correct
33 Correct 10 ms 9720 KB Output is correct
34 Correct 10 ms 9720 KB Output is correct
35 Correct 10 ms 9720 KB Output is correct
36 Correct 12 ms 9720 KB Output is correct
37 Correct 10 ms 9720 KB Output is correct
38 Correct 10 ms 9720 KB Output is correct
39 Correct 10 ms 9720 KB Output is correct
40 Correct 10 ms 9720 KB Output is correct
41 Correct 10 ms 9692 KB Output is correct
42 Correct 10 ms 9720 KB Output is correct
43 Correct 102 ms 26884 KB Output is correct
44 Correct 102 ms 26940 KB Output is correct
45 Correct 98 ms 25856 KB Output is correct
46 Correct 102 ms 26884 KB Output is correct
47 Correct 109 ms 26624 KB Output is correct
48 Correct 107 ms 26596 KB Output is correct
49 Correct 108 ms 26684 KB Output is correct
50 Correct 12 ms 9720 KB Output is correct
51 Correct 89 ms 24112 KB Output is correct
52 Correct 92 ms 24948 KB Output is correct
53 Correct 84 ms 24072 KB Output is correct
54 Correct 89 ms 24888 KB Output is correct
55 Correct 11 ms 9720 KB Output is correct
56 Correct 10 ms 9720 KB Output is correct
57 Correct 11 ms 9720 KB Output is correct
58 Correct 10 ms 9720 KB Output is correct
59 Correct 11 ms 9720 KB Output is correct
60 Correct 10 ms 9720 KB Output is correct
61 Correct 11 ms 9720 KB Output is correct
62 Correct 10 ms 9720 KB Output is correct
63 Correct 10 ms 9720 KB Output is correct
64 Correct 10 ms 9720 KB Output is correct
65 Correct 11 ms 9720 KB Output is correct
66 Correct 11 ms 9792 KB Output is correct
67 Correct 83 ms 23892 KB Output is correct
68 Correct 81 ms 23724 KB Output is correct
69 Correct 79 ms 24112 KB Output is correct
70 Correct 80 ms 23992 KB Output is correct
71 Correct 82 ms 24068 KB Output is correct
72 Correct 73 ms 24072 KB Output is correct
73 Correct 76 ms 23816 KB Output is correct
74 Correct 79 ms 24580 KB Output is correct
75 Correct 85 ms 24324 KB Output is correct
76 Correct 89 ms 24452 KB Output is correct
77 Correct 85 ms 23912 KB Output is correct
78 Correct 83 ms 24068 KB Output is correct
79 Correct 83 ms 24072 KB Output is correct
80 Correct 78 ms 23944 KB Output is correct
81 Correct 78 ms 24836 KB Output is correct
82 Correct 74 ms 23940 KB Output is correct
83 Correct 73 ms 24580 KB Output is correct
84 Correct 76 ms 24708 KB Output is correct
85 Correct 90 ms 24540 KB Output is correct
86 Correct 82 ms 24452 KB Output is correct
87 Correct 88 ms 24708 KB Output is correct
88 Correct 87 ms 24456 KB Output is correct
89 Correct 85 ms 24384 KB Output is correct
90 Correct 92 ms 24580 KB Output is correct
91 Correct 83 ms 24916 KB Output is correct
92 Correct 87 ms 24580 KB Output is correct
93 Correct 84 ms 24384 KB Output is correct
94 Correct 86 ms 24580 KB Output is correct
95 Correct 91 ms 24616 KB Output is correct
96 Correct 82 ms 24708 KB Output is correct
97 Correct 82 ms 24400 KB Output is correct
98 Correct 87 ms 24712 KB Output is correct
99 Correct 86 ms 24808 KB Output is correct
100 Correct 93 ms 24452 KB Output is correct
101 Correct 85 ms 24624 KB Output is correct
102 Correct 93 ms 24580 KB Output is correct