답안 #78354 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
78354	2018-10-04T00:19:34 Z	shoemakerjo	전선 연결 (IOI17_wiring)	C++14	100 / 100	93 ms	86540 KB

wiring

#include "wiring.h"
#include <bits/stdc++.h>

using namespace std;
#define prev previousguy
#define ll long long
#define maxn 100010
#define pii pair<int, int>

ll dp[2][maxn];

int prev, cur;
int n, m;
const ll inf = 1LL << 62;
vector<pii> stuff;
ll suf[maxn];
ll pref[maxn];

ll min_total_length(vector<int> r, vector<int> b) {
	n = r.size();
	m = b.size();

	cur = 0; prev = 1;
	
	for (int i = 0; i < n; i++) {
		stuff.push_back(pii(r[i],  0));
	}
	for (int i = 0; i < m; i++) {
		stuff.push_back(pii(b[i], 1));
	}
	sort(stuff.begin(), stuff.end());

	int lastsize = -1;
	for (int i = 0; i < n+m; i++) {
		int cstart = i;
		int cend = i;
		while (cend < n + m - 1 && stuff[cend+1].second == stuff[cend].second) 
			++cend;

		// cout << "group from " << cstart << " " << cend << endl;

		swap(prev, cur);
		int csize = cend - cstart+1;

		if (lastsize == -1) {
			dp[cur][0] = 0;
			for (int j = 1; j <= csize; j++) dp[cur][j] = inf;
		}
		else {
			ll gap = stuff[cstart].first - stuff[cstart-1].first;

			// cout << "GAP: " << gap << endl;

			int oend = cstart-1;
			//do suffix for how many we take
			suf[0] = 0;
			for (int j = 1; j <= lastsize; j++) {
				suf[j] = suf[j-1] + stuff[oend].first - 
					stuff[oend-j+1].first;
			}
			pref[0] = 0; //prefix for how many we take
			for (int j = 1; j <= csize; j++) {
				pref[j] = pref[j-1] + stuff[cstart+j-1].first - 
					stuff[cstart].first;
			}

			for (int j = 0; j <= csize; j++) {
				dp[cur][j] = inf;
			}

			//do minimum from the left
			ll curmin = inf;
			for (int j = 0; j <= csize; j++) {
				//consider taking less than me from the left to connect
				if (lastsize - j >= 0) 
					curmin = min(curmin, dp[prev][lastsize-j] + suf[j]);

				dp[cur][j] = min(dp[cur][j], curmin + pref[j] + gap*j);
				// cout << "   " << j << ":  " << pref[j] << 
				// 	" " << dp[cur][j] << "  -  " << curmin << 
				// 	" suf: " << suf[j] << endl;
			}

			curmin = inf;

			//below considers that previous #fixed is at least current fixed
			for (int j = lastsize; j > csize; j--) {
				//consider taking all but this many
				curmin = min(curmin, j * gap + dp[prev][lastsize-j] + 
					suf[j]);
			}
			for (int j = csize; j >= 0; --j) {
				if (lastsize - j >= 0) //j <= lastsize is same 
					curmin = min(curmin, j * gap + dp[prev][lastsize-j] + 
					suf[j]);

				dp[cur][j] = min(dp[cur][j], curmin + pref[j]);
			}




		}

		// cout << cstart << " to " << cend << endl;
		// for (int j = 0; j <= csize; j++) {
				
		// 	cout << "    " <<  j << " : " << dp[cur][j] << endl;
		// }

		// cout << endl;

		lastsize = csize;
		i = cend;
	}

	return dp[cur][lastsize];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	680 KB	Output is correct
2	Correct	2 ms	796 KB	Output is correct
3	Correct	38 ms	5400 KB	Output is correct
4	Correct	36 ms	5400 KB	Output is correct
5	Correct	64 ms	5656 KB	Output is correct
6	Correct	49 ms	7092 KB	Output is correct
7	Correct	48 ms	7092 KB	Output is correct
8	Correct	62 ms	7092 KB	Output is correct
9	Correct	49 ms	7092 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	7092 KB	Output is correct
2	Correct	2 ms	7092 KB	Output is correct
3	Correct	65 ms	7092 KB	Output is correct
4	Correct	61 ms	7864 KB	Output is correct
5	Correct	3 ms	7864 KB	Output is correct
6	Correct	2 ms	7864 KB	Output is correct
7	Correct	2 ms	7864 KB	Output is correct
8	Correct	2 ms	7864 KB	Output is correct
9	Correct	2 ms	7864 KB	Output is correct
10	Correct	2 ms	7864 KB	Output is correct
11	Correct	2 ms	7864 KB	Output is correct
12	Correct	2 ms	7864 KB	Output is correct
13	Correct	2 ms	7864 KB	Output is correct
14	Correct	2 ms	7864 KB	Output is correct
15	Correct	2 ms	7864 KB	Output is correct
16	Correct	2 ms	7864 KB	Output is correct
17	Correct	2 ms	7864 KB	Output is correct
18	Correct	93 ms	9960 KB	Output is correct
19	Correct	64 ms	12036 KB	Output is correct
20	Correct	64 ms	13852 KB	Output is correct
21	Correct	63 ms	15788 KB	Output is correct
22	Correct	62 ms	17744 KB	Output is correct
23	Correct	67 ms	19664 KB	Output is correct
24	Correct	62 ms	21612 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	21612 KB	Output is correct
2	Correct	53 ms	21612 KB	Output is correct
3	Correct	56 ms	21612 KB	Output is correct
4	Correct	59 ms	22888 KB	Output is correct
5	Correct	56 ms	24168 KB	Output is correct
6	Correct	2 ms	24168 KB	Output is correct
7	Correct	2 ms	24168 KB	Output is correct
8	Correct	2 ms	24168 KB	Output is correct
9	Correct	2 ms	24168 KB	Output is correct
10	Correct	2 ms	24168 KB	Output is correct
11	Correct	2 ms	24168 KB	Output is correct
12	Correct	2 ms	24168 KB	Output is correct
13	Correct	2 ms	24168 KB	Output is correct
14	Correct	3 ms	24168 KB	Output is correct
15	Correct	3 ms	24168 KB	Output is correct
16	Correct	2 ms	24168 KB	Output is correct
17	Correct	3 ms	24168 KB	Output is correct
18	Correct	75 ms	26372 KB	Output is correct
19	Correct	59 ms	26756 KB	Output is correct
20	Correct	50 ms	28008 KB	Output is correct
21	Correct	50 ms	29392 KB	Output is correct
22	Correct	51 ms	32324 KB	Output is correct
23	Correct	45 ms	33712 KB	Output is correct
24	Correct	47 ms	34684 KB	Output is correct

Subtask #5
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	468 KB	Output is correct
3	Correct	2 ms	468 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	2 ms	600 KB	Output is correct
6	Correct	2 ms	600 KB	Output is correct
7	Correct	3 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	2 ms	680 KB	Output is correct
10	Correct	3 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	2 ms	680 KB	Output is correct
13	Correct	2 ms	680 KB	Output is correct
14	Correct	2 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	3 ms	680 KB	Output is correct
17	Correct	2 ms	680 KB	Output is correct
18	Correct	2 ms	796 KB	Output is correct
19	Correct	38 ms	5400 KB	Output is correct
20	Correct	36 ms	5400 KB	Output is correct
21	Correct	64 ms	5656 KB	Output is correct
22	Correct	49 ms	7092 KB	Output is correct
23	Correct	48 ms	7092 KB	Output is correct
24	Correct	62 ms	7092 KB	Output is correct
25	Correct	49 ms	7092 KB	Output is correct
26	Correct	2 ms	7092 KB	Output is correct
27	Correct	2 ms	7092 KB	Output is correct
28	Correct	65 ms	7092 KB	Output is correct
29	Correct	61 ms	7864 KB	Output is correct
30	Correct	3 ms	7864 KB	Output is correct
31	Correct	2 ms	7864 KB	Output is correct
32	Correct	2 ms	7864 KB	Output is correct
33	Correct	2 ms	7864 KB	Output is correct
34	Correct	2 ms	7864 KB	Output is correct
35	Correct	2 ms	7864 KB	Output is correct
36	Correct	2 ms	7864 KB	Output is correct
37	Correct	2 ms	7864 KB	Output is correct
38	Correct	2 ms	7864 KB	Output is correct
39	Correct	2 ms	7864 KB	Output is correct
40	Correct	2 ms	7864 KB	Output is correct
41	Correct	2 ms	7864 KB	Output is correct
42	Correct	2 ms	7864 KB	Output is correct
43	Correct	93 ms	9960 KB	Output is correct
44	Correct	64 ms	12036 KB	Output is correct
45	Correct	64 ms	13852 KB	Output is correct
46	Correct	63 ms	15788 KB	Output is correct
47	Correct	62 ms	17744 KB	Output is correct
48	Correct	67 ms	19664 KB	Output is correct
49	Correct	62 ms	21612 KB	Output is correct
50	Correct	2 ms	21612 KB	Output is correct
51	Correct	53 ms	21612 KB	Output is correct
52	Correct	56 ms	21612 KB	Output is correct
53	Correct	59 ms	22888 KB	Output is correct
54	Correct	56 ms	24168 KB	Output is correct
55	Correct	2 ms	24168 KB	Output is correct
56	Correct	2 ms	24168 KB	Output is correct
57	Correct	2 ms	24168 KB	Output is correct
58	Correct	2 ms	24168 KB	Output is correct
59	Correct	2 ms	24168 KB	Output is correct
60	Correct	2 ms	24168 KB	Output is correct
61	Correct	2 ms	24168 KB	Output is correct
62	Correct	2 ms	24168 KB	Output is correct
63	Correct	3 ms	24168 KB	Output is correct
64	Correct	3 ms	24168 KB	Output is correct
65	Correct	2 ms	24168 KB	Output is correct
66	Correct	3 ms	24168 KB	Output is correct
67	Correct	75 ms	26372 KB	Output is correct
68	Correct	59 ms	26756 KB	Output is correct
69	Correct	50 ms	28008 KB	Output is correct
70	Correct	50 ms	29392 KB	Output is correct
71	Correct	51 ms	32324 KB	Output is correct
72	Correct	45 ms	33712 KB	Output is correct
73	Correct	47 ms	34684 KB	Output is correct
74	Correct	50 ms	37008 KB	Output is correct
75	Correct	56 ms	37532 KB	Output is correct
76	Correct	58 ms	39608 KB	Output is correct
77	Correct	56 ms	41312 KB	Output is correct
78	Correct	50 ms	42840 KB	Output is correct
79	Correct	54 ms	43964 KB	Output is correct
80	Correct	56 ms	45440 KB	Output is correct
81	Correct	79 ms	47812 KB	Output is correct
82	Correct	67 ms	48736 KB	Output is correct
83	Correct	86 ms	50132 KB	Output is correct
84	Correct	49 ms	52236 KB	Output is correct
85	Correct	62 ms	53264 KB	Output is correct
86	Correct	52 ms	55880 KB	Output is correct
87	Correct	52 ms	57700 KB	Output is correct
88	Correct	57 ms	59212 KB	Output is correct
89	Correct	55 ms	61400 KB	Output is correct
90	Correct	62 ms	63324 KB	Output is correct
91	Correct	55 ms	65664 KB	Output is correct
92	Correct	56 ms	67356 KB	Output is correct
93	Correct	54 ms	69416 KB	Output is correct
94	Correct	55 ms	71604 KB	Output is correct
95	Correct	63 ms	72896 KB	Output is correct
96	Correct	48 ms	75340 KB	Output is correct
97	Correct	50 ms	77980 KB	Output is correct
98	Correct	60 ms	79484 KB	Output is correct
99	Correct	64 ms	81412 KB	Output is correct
100	Correct	77 ms	82972 KB	Output is correct
101	Correct	64 ms	85356 KB	Output is correct
102	Correct	60 ms	86540 KB	Output is correct

답안 #78354

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 13.0 / 13.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 45.0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
13.0 / 13.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
45.0 / 45.0