oj.uz

답안 #970284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970284 2024-04-26T10:16:07 Z CSQ31 전선 연결 (IOI17_wiring) C++17
100 / 100
 53 ms 12484 KB 
#include "wiring.h"
#include <bits/stdc++.h>
#define sz(a) a.size()
using namespace std;
typedef long long int ll;
const ll INF = 1e16;
const int MAXN = 2e5+5;
ll pre[MAXN],suff[MAXN]; //pre and suff min
ll min_total_length(vector<int> R,vector<int> B) {
	vector<array<int,2>>a;
	for(int x:R)a.push_back({x,0});
	for(int x:B)a.push_back({x,1});
	sort(a.begin(),a.end());
	vector<vector<int>>b;

	int n = sz(a);
	for(int i=0;i<n;i++){
		int j = i;
		b.push_back({a[i][0]});
		while(j+1<n && a[j][1] == a[j+1][1]){
			j++;
			b.back().push_back(a[j][0]);
		}
		i = j;
	}

	vector<int>s;
	for(auto x:b)s.push_back(sz(x));
	for(int i=0;i<=n;i++)suff[i] = pre[i] = INF;
	pre[s[0]] = suff[s[0]] = 0;

	for(int i=0;i<s[0];i++){
		pre[s[0]] += b[0].back() - b[0][i];
		suff[s[0]] += b[0].back() - b[0][i];
	}
	//compute prefix and suffix min
	suff[s[0]] += 1LL * s[0] * (b[1][0] - b[0].back()); //distance in between
	int t = max(s[0],s[1]);
	for(int i=1;i<=t;i++)pre[i] = min(pre[i],pre[i-1]);
	for(int i=t-1;i>=0;i--)suff[i] = min(suff[i],suff[i+1]);

    /*
	for(auto x:b){
		for(int y:x)cout<<y<<" ";
		cout<<'\n';
	}*/
	for(int i=1;i<sz(s);i++){
		vector<ll>tmp(s[i]+1,0);
		//tmp[i] = min cost if i guys from this batch is assigned to the left
		ll cur = 0;
		for(int j=0;j<=s[i];j++){
			if(j)cur += b[i][j-1] - b[i][0];
			ll x = pre[j] + 1LL * j * (b[i][0] - b[i-1].back()); //distance in between
			ll y = suff[j];

			tmp[j] = cur + min(x,y);
		}
		cur = 0;
		reverse(tmp.begin(),tmp.end());
		for(int j=0;j<=s[i];j++){
			if(j)cur += b[i].back() - b[i][s[i]-j];
			tmp[j] += cur;
		}
		/*
		cout<<"at "<<i<<'\n';
		for(ll x:tmp)cout<<x<<" ";
		cout<<'\n';*/
		//tmp[i] = min cost if i guys assigned to the right
		if(i == sz(s)-1)return tmp[0];

		int t = max(s[i],s[i+1]);
		for(int j=0;j<=t;j++)pre[j] = suff[j] = INF;
		for(int j=0;j<=s[i];j++){
			pre[j] = suff[j] = tmp[j];
			suff[j] += 1LL * j * (b[i+1][0] - b[i].back());
		}
		for(int j=1;j<=t;j++)pre[j] = min(pre[j],pre[j-1]);
		for(int j=t-1;j>=0;j--)suff[j] = min(suff[j],suff[j+1]);
	}
	return 0;
	
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:47:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |  for(int i=1;i<sz(s);i++){
      |               ^
wiring.cpp:69:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   if(i == sz(s)-1)return tmp[0];
      |      ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 27 ms 6504 KB Output is correct
4 Correct 21 ms 6604 KB Output is correct
5 Correct 21 ms 7532 KB Output is correct
6 Correct 30 ms 9160 KB Output is correct
7 Correct 28 ms 8836 KB Output is correct
8 Correct 28 ms 8908 KB Output is correct
9 Correct 29 ms 9032 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 50 ms 10432 KB Output is correct
4 Correct 49 ms 11180 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2488 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 51 ms 12484 KB Output is correct
19 Correct 53 ms 12448 KB Output is correct
20 Correct 49 ms 11628 KB Output is correct
21 Correct 50 ms 12484 KB Output is correct
22 Correct 50 ms 12028 KB Output is correct
23 Correct 53 ms 11972 KB Output is correct
24 Correct 50 ms 12228 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 37 ms 7544 KB Output is correct
3 Correct 43 ms 9920 KB Output is correct
4 Correct 41 ms 8900 KB Output is correct
5 Correct 43 ms 10080 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 36 ms 9136 KB Output is correct
19 Correct 39 ms 8772 KB Output is correct
20 Correct 37 ms 8904 KB Output is correct
21 Correct 34 ms 9020 KB Output is correct
22 Correct 36 ms 9668 KB Output is correct
23 Correct 29 ms 9520 KB Output is correct
24 Correct 31 ms 9676 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2492 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 27 ms 6504 KB Output is correct
20 Correct 21 ms 6604 KB Output is correct
21 Correct 21 ms 7532 KB Output is correct
22 Correct 30 ms 9160 KB Output is correct
23 Correct 28 ms 8836 KB Output is correct
24 Correct 28 ms 8908 KB Output is correct
25 Correct 29 ms 9032 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 50 ms 10432 KB Output is correct
29 Correct 49 ms 11180 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2488 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 51 ms 12484 KB Output is correct
44 Correct 53 ms 12448 KB Output is correct
45 Correct 49 ms 11628 KB Output is correct
46 Correct 50 ms 12484 KB Output is correct
47 Correct 50 ms 12028 KB Output is correct
48 Correct 53 ms 11972 KB Output is correct
49 Correct 50 ms 12228 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 37 ms 7544 KB Output is correct
52 Correct 43 ms 9920 KB Output is correct
53 Correct 41 ms 8900 KB Output is correct
54 Correct 43 ms 10080 KB Output is correct
55 Correct 1 ms 2396 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 1 ms 2392 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2396 KB Output is correct
61 Correct 1 ms 2396 KB Output is correct
62 Correct 1 ms 2396 KB Output is correct
63 Correct 1 ms 2396 KB Output is correct
64 Correct 1 ms 2396 KB Output is correct
65 Correct 1 ms 2396 KB Output is correct
66 Correct 1 ms 2392 KB Output is correct
67 Correct 36 ms 9136 KB Output is correct
68 Correct 39 ms 8772 KB Output is correct
69 Correct 37 ms 8904 KB Output is correct
70 Correct 34 ms 9020 KB Output is correct
71 Correct 36 ms 9668 KB Output is correct
72 Correct 29 ms 9520 KB Output is correct
73 Correct 31 ms 9676 KB Output is correct
74 Correct 30 ms 10444 KB Output is correct
75 Correct 42 ms 9668 KB Output is correct
76 Correct 37 ms 10184 KB Output is correct
77 Correct 39 ms 9460 KB Output is correct
78 Correct 35 ms 9916 KB Output is correct
79 Correct 40 ms 9664 KB Output is correct
80 Correct 33 ms 9864 KB Output is correct
81 Correct 40 ms 10196 KB Output is correct
82 Correct 39 ms 9456 KB Output is correct
83 Correct 29 ms 9924 KB Output is correct
84 Correct 35 ms 9912 KB Output is correct
85 Correct 43 ms 9724 KB Output is correct
86 Correct 33 ms 10240 KB Output is correct
87 Correct 38 ms 10108 KB Output is correct
88 Correct 46 ms 9888 KB Output is correct
89 Correct 36 ms 9932 KB Output is correct
90 Correct 41 ms 10252 KB Output is correct
91 Correct 33 ms 10160 KB Output is correct
92 Correct 38 ms 10280 KB Output is correct
93 Correct 35 ms 9900 KB Output is correct
94 Correct 37 ms 10224 KB Output is correct
95 Correct 38 ms 9772 KB Output is correct
96 Correct 31 ms 10188 KB Output is correct
97 Correct 31 ms 10700 KB Output is correct
98 Correct 36 ms 10388 KB Output is correct
99 Correct 44 ms 10492 KB Output is correct
100 Correct 39 ms 10180 KB Output is correct
101 Correct 34 ms 10436 KB Output is correct
102 Correct 41 ms 9932 KB Output is correct