oj.uz

Submission #249885

# Submission time Handle Problem Language Result Execution time Memory
249885 2020-07-16T09:17:18 Z fedoseevtimofey Wiring (IOI17_wiring) C++14
100 / 100
 71 ms 9860 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>

using namespace std;

typedef long long ll;

#include "wiring.h"

const ll Inf = 1e18;

long long min_total_length(vector <int> r, vector <int> b) {
  int n = r.size();
  int m = b.size();
  vector <pair <int, int>> gs;
  for (int i = 0; i < n; ++i) {
    gs.push_back({r[i], 0});
  }
  for (int i = 0; i < m; ++i) {
    gs.push_back({b[i], 1});
  }
  sort(gs.begin(), gs.end());
  int k = gs.size();
  vector <int> g_sz;

  for (int i = 0; i < k; ++i) {
    int uk = i;
    while (uk < k && gs[i].second == gs[uk].second) {
      ++uk;
    }
    g_sz.push_back(uk - i);
    i = uk - 1;
  }
  int cnt = g_sz.size();

  vector <int> where(k); 
  {
    int uk = 0;
    for (int i = 0; i < cnt; ++i) {
      for (int j = uk; j < uk + g_sz[i]; ++j) {
        where[j] = i;
      }
      uk += g_sz[i];
    }
  }
  vector <int> ps(cnt);
  for (int i = 0; i < cnt; ++i) {
    if (i > 0) ps[i] += ps[i - 1];
    ps[i] += g_sz[i];
  }
  vector <ll> pref(k + 1);

  for (int i = 0; i < k; ++i) {
    pref[i + 1] = pref[i] + gs[i].first;
  }

  vector <ll> dp(k + 1, Inf);
  dp[0] = 0;
  for (int i = 1; i <= k; ++i) {
    int id = where[i - 1];
    if (id > 0) {
      dp[i] = min(dp[i], dp[i - 1] + abs(gs[i - 1].first - gs[ps[id - 1] - 1].first));
    }
    if (id + 1 < cnt) {
      dp[i] = min(dp[i], dp[i - 1] + abs(gs[i - 1].first - gs[ps[id]].first));
    }
    if (id + 1 < cnt) {
      int have_free = ps[id] - i + 1;
      if (g_sz[id + 1] >= have_free) {
        ll delta = 0;
        delta += pref[ps[id] + have_free] - pref[ps[id]];
        delta -= pref[i - 1 + have_free] - pref[i - 1];
        /*for (int j = 0; j < have_free; ++j) {
          delta += abs(gs[i - 1 + j].first - gs[ps[id] + j].first);
        }*/
        dp[ps[id] + have_free] = min(dp[ps[id] + have_free], dp[i - 1] + delta);
      }
    }
  }   
  return dp[k];
}

#ifdef LOCAL
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int n, m;
	cin >> n >> m;
	vector<int> r(n), b(m);
	for(int i = 0; i < n; i++)
    cin >> r[i];
	for(int i = 0; i < m; i++)
    cin >> b[i];
	long long res = min_total_length(r, b);
  cout << res << '\n';
}
#endif

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 34 ms 7016 KB Output is correct
4 Correct 34 ms 7144 KB Output is correct
5 Correct 35 ms 7004 KB Output is correct
6 Correct 48 ms 9320 KB Output is correct
7 Correct 45 ms 9320 KB Output is correct
8 Correct 53 ms 9448 KB Output is correct
9 Correct 46 ms 9320 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 71 ms 9860 KB Output is correct
4 Correct 57 ms 9320 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 59 ms 9832 KB Output is correct
19 Correct 58 ms 9704 KB Output is correct
20 Correct 62 ms 9708 KB Output is correct
21 Correct 57 ms 9704 KB Output is correct
22 Correct 58 ms 9704 KB Output is correct
23 Correct 60 ms 9704 KB Output is correct
24 Correct 59 ms 9704 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 50 ms 8680 KB Output is correct
3 Correct 49 ms 8808 KB Output is correct
4 Correct 50 ms 8684 KB Output is correct
5 Correct 50 ms 8808 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 46 ms 8680 KB Output is correct
19 Correct 49 ms 8680 KB Output is correct
20 Correct 46 ms 8680 KB Output is correct
21 Correct 51 ms 8680 KB Output is correct
22 Correct 57 ms 8680 KB Output is correct
23 Correct 40 ms 8680 KB Output is correct
24 Correct 42 ms 8680 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 34 ms 7016 KB Output is correct
20 Correct 34 ms 7144 KB Output is correct
21 Correct 35 ms 7004 KB Output is correct
22 Correct 48 ms 9320 KB Output is correct
23 Correct 45 ms 9320 KB Output is correct
24 Correct 53 ms 9448 KB Output is correct
25 Correct 46 ms 9320 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 71 ms 9860 KB Output is correct
29 Correct 57 ms 9320 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 0 ms 256 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 0 ms 256 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 59 ms 9832 KB Output is correct
44 Correct 58 ms 9704 KB Output is correct
45 Correct 62 ms 9708 KB Output is correct
46 Correct 57 ms 9704 KB Output is correct
47 Correct 58 ms 9704 KB Output is correct
48 Correct 60 ms 9704 KB Output is correct
49 Correct 59 ms 9704 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 50 ms 8680 KB Output is correct
52 Correct 49 ms 8808 KB Output is correct
53 Correct 50 ms 8684 KB Output is correct
54 Correct 50 ms 8808 KB Output is correct
55 Correct 0 ms 256 KB Output is correct
56 Correct 0 ms 256 KB Output is correct
57 Correct 0 ms 256 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 0 ms 256 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 0 ms 256 KB Output is correct
67 Correct 46 ms 8680 KB Output is correct
68 Correct 49 ms 8680 KB Output is correct
69 Correct 46 ms 8680 KB Output is correct
70 Correct 51 ms 8680 KB Output is correct
71 Correct 57 ms 8680 KB Output is correct
72 Correct 40 ms 8680 KB Output is correct
73 Correct 42 ms 8680 KB Output is correct
74 Correct 50 ms 9320 KB Output is correct
75 Correct 51 ms 8936 KB Output is correct
76 Correct 54 ms 9320 KB Output is correct
77 Correct 47 ms 8816 KB Output is correct
78 Correct 45 ms 8680 KB Output is correct
79 Correct 46 ms 8680 KB Output is correct
80 Correct 42 ms 8680 KB Output is correct
81 Correct 46 ms 8808 KB Output is correct
82 Correct 44 ms 8808 KB Output is correct
83 Correct 41 ms 8980 KB Output is correct
84 Correct 45 ms 9320 KB Output is correct
85 Correct 65 ms 9320 KB Output is correct
86 Correct 52 ms 9320 KB Output is correct
87 Correct 49 ms 9320 KB Output is correct
88 Correct 66 ms 9320 KB Output is correct
89 Correct 49 ms 9320 KB Output is correct
90 Correct 57 ms 9320 KB Output is correct
91 Correct 48 ms 9320 KB Output is correct
92 Correct 50 ms 9320 KB Output is correct
93 Correct 48 ms 9320 KB Output is correct
94 Correct 49 ms 9320 KB Output is correct
95 Correct 52 ms 9320 KB Output is correct
96 Correct 47 ms 9320 KB Output is correct
97 Correct 47 ms 9320 KB Output is correct
98 Correct 49 ms 9320 KB Output is correct
99 Correct 50 ms 9320 KB Output is correct
100 Correct 54 ms 9320 KB Output is correct
101 Correct 49 ms 9320 KB Output is correct
102 Correct 54 ms 9320 KB Output is correct