oj.uz

답안 #831573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831573 2023-08-20T10:35:16 Z WLZ 전선 연결 (IOI17_wiring) C++17
100 / 100
 56 ms 9916 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const ll LINF = (ll) 1e18;

long long min_total_length(std::vector<int> a, std::vector<int> b) {
  int n = (int) a.size(), m = (int) b.size();
  vector< pair<int, int> > v;
  for (int i = 0; i < n; i++) v.emplace_back(a[i], 0);
  for (int i = 0; i < m; i++) v.emplace_back(b[i], 1);
  sort(v.begin(), v.end());
  v.insert(v.begin(), {0, -1});
  vector<int> seg(n + m + 1); seg[1] = 0; seg[0] = -5;
  vector<int> sz;
  vector<int> first(n + m + 1), last(n + m + 1);
  first[0] = v[1].first; last[0] = v[1].first;
  int len = 1;
  for (int i = 2; i <= n + m; i++) {
    seg[i] = seg[i - 1];
    len++;
    if (v[i].second != v[i - 1].second) {
      sz.push_back(len - 1);
      seg[i]++, len = 1;
      first[seg[i]] = v[i].first;
    }
    last[seg[i]] = v[i].first;
  }
  sz.push_back(len);
  vector<ll> dp(n + m + 1, LINF); dp[0] = 0;
  vector<int> cnt = {0, 0};
  vector<ll> sum = {0, 0};
  int j = 0;
  for (int i = 1; i <= n + m; i++) {
    cnt[v[i].second]++;
    sum[v[i].second] += v[i].first;
    if (seg[i] == 0) continue;
    if (seg[i] != seg[i - 1]) {
      j = i - 1;
      cnt = {1, 1};
      sum[v[i].second] = v[i].first;
      sum[v[j].second] = v[j].first;
    }
    ll cur_cost = sum[v[i].second] - sum[!v[i].second];
    if (cnt[v[i].second] > cnt[!v[i].second]) cur_cost -= (ll) (cnt[v[i].second] - cnt[!v[i].second]) * last[seg[i] - 1];
    else cur_cost += (ll) (cnt[!v[i].second] - cnt[v[i].second]) * first[seg[i]];
    while (seg[j - 1] == seg[i] - 1) {
      dp[i] = min(dp[i], dp[j - 1] + cur_cost);
      dp[i] = min(dp[i], dp[j] + cur_cost);  
      auto tmp_cnt = cnt; auto tmp_sum = sum;
      tmp_cnt[v[j - 1].second]++; tmp_sum[v[j - 1].second] += v[j - 1].first;
      ll new_cost = tmp_sum[v[i].second] - tmp_sum[!v[i].second];
      if (tmp_cnt[v[i].second] > tmp_cnt[!v[i].second]) new_cost -= (ll) (tmp_cnt[v[i].second] - tmp_cnt[!v[i].second]) * last[seg[i] - 1];
      else new_cost += (ll) (tmp_cnt[!v[i].second] - tmp_cnt[v[i].second]) * first[seg[i]];
      if (dp[j - 2] + new_cost <= dp[j - 1] + cur_cost || dp[j - 1] == LINF) {
        cnt = tmp_cnt;
        sum = tmp_sum;
        cur_cost = new_cost;
        j--;
      } else break;
    }
    dp[i] = min(dp[i], dp[j - 1] + cur_cost);
    dp[i] = min(dp[i], dp[j] + cur_cost);
  }
  return dp[n + m];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 23 ms 6120 KB Output is correct
4 Correct 23 ms 6820 KB Output is correct
5 Correct 28 ms 6768 KB Output is correct
6 Correct 29 ms 8568 KB Output is correct
7 Correct 29 ms 8572 KB Output is correct
8 Correct 30 ms 8628 KB Output is correct
9 Correct 28 ms 8508 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 50 ms 8516 KB Output is correct
4 Correct 46 ms 9292 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 292 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 44 ms 9720 KB Output is correct
19 Correct 50 ms 9720 KB Output is correct
20 Correct 48 ms 9712 KB Output is correct
21 Correct 43 ms 9624 KB Output is correct
22 Correct 46 ms 9680 KB Output is correct
23 Correct 56 ms 9916 KB Output is correct
24 Correct 49 ms 9604 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 40 ms 8544 KB Output is correct
3 Correct 47 ms 8796 KB Output is correct
4 Correct 42 ms 8604 KB Output is correct
5 Correct 43 ms 8812 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 37 ms 8512 KB Output is correct
19 Correct 41 ms 8508 KB Output is correct
20 Correct 40 ms 8508 KB Output is correct
21 Correct 37 ms 8508 KB Output is correct
22 Correct 37 ms 8676 KB Output is correct
23 Correct 32 ms 8516 KB Output is correct
24 Correct 36 ms 8488 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 23 ms 6120 KB Output is correct
20 Correct 23 ms 6820 KB Output is correct
21 Correct 28 ms 6768 KB Output is correct
22 Correct 29 ms 8568 KB Output is correct
23 Correct 29 ms 8572 KB Output is correct
24 Correct 30 ms 8628 KB Output is correct
25 Correct 28 ms 8508 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 50 ms 8516 KB Output is correct
29 Correct 46 ms 9292 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 292 KB Output is correct
37 Correct 0 ms 304 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 44 ms 9720 KB Output is correct
44 Correct 50 ms 9720 KB Output is correct
45 Correct 48 ms 9712 KB Output is correct
46 Correct 43 ms 9624 KB Output is correct
47 Correct 46 ms 9680 KB Output is correct
48 Correct 56 ms 9916 KB Output is correct
49 Correct 49 ms 9604 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 40 ms 8544 KB Output is correct
52 Correct 47 ms 8796 KB Output is correct
53 Correct 42 ms 8604 KB Output is correct
54 Correct 43 ms 8812 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 300 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 300 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 0 ms 300 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 37 ms 8512 KB Output is correct
68 Correct 41 ms 8508 KB Output is correct
69 Correct 40 ms 8508 KB Output is correct
70 Correct 37 ms 8508 KB Output is correct
71 Correct 37 ms 8676 KB Output is correct
72 Correct 32 ms 8516 KB Output is correct
73 Correct 36 ms 8488 KB Output is correct
74 Correct 32 ms 9248 KB Output is correct
75 Correct 41 ms 8864 KB Output is correct
76 Correct 40 ms 9256 KB Output is correct
77 Correct 39 ms 8684 KB Output is correct
78 Correct 42 ms 8612 KB Output is correct
79 Correct 49 ms 8616 KB Output is correct
80 Correct 33 ms 8636 KB Output is correct
81 Correct 34 ms 8784 KB Output is correct
82 Correct 31 ms 8744 KB Output is correct
83 Correct 35 ms 8864 KB Output is correct
84 Correct 32 ms 9252 KB Output is correct
85 Correct 45 ms 9248 KB Output is correct
86 Correct 32 ms 9248 KB Output is correct
87 Correct 34 ms 9244 KB Output is correct
88 Correct 44 ms 9352 KB Output is correct
89 Correct 43 ms 9288 KB Output is correct
90 Correct 41 ms 9284 KB Output is correct
91 Correct 34 ms 9252 KB Output is correct
92 Correct 38 ms 9276 KB Output is correct
93 Correct 34 ms 9248 KB Output is correct
94 Correct 36 ms 9248 KB Output is correct
95 Correct 38 ms 9260 KB Output is correct
96 Correct 33 ms 9248 KB Output is correct
97 Correct 32 ms 9252 KB Output is correct
98 Correct 35 ms 9276 KB Output is correct
99 Correct 36 ms 9252 KB Output is correct
100 Correct 42 ms 9260 KB Output is correct
101 Correct 34 ms 9212 KB Output is correct
102 Correct 40 ms 9276 KB Output is correct