oj.uz

Submission #122798

# Submission time Handle Problem Language Result Execution time Memory
122798 2019-06-29T09:44:57 Z IOrtroiii Wiring (IOI17_wiring) C++14
100 / 100
 101 ms 16908 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const ll inf = 1e18;

ll min_total_length(vector<int> r, vector<int> b) {
   vector<pair<int, int>> vals;
   for (int v : r) {
      vals.emplace_back(v, 0);
   }
   for (int v : b) {
      vals.emplace_back(v, 1);
   }
   sort(vals.begin(), vals.end());
   vector<vector<int>> sub;
   vector<vector<ll>> pref;
   vector<vector<ll>> f;
   int l = 0;
   while (l < vals.size()) {
      vector<int> csub;
      int r = l;
      while (r < vals.size() && vals[r].second == vals[l].second) {
         csub.push_back(vals[r++].first);
      }
      int sz = csub.size();
      vector<ll> cpref(sz + 1);
      for (int i = 0; i < sz; ++i) {
         cpref[i + 1] = cpref[i] + csub[i];
      }
      vector<ll> cf(sz + 1, inf);
      sub.push_back(csub);
      pref.push_back(cpref);
      f.push_back(cf);
      l = r;
   }
   int n = sub.size();
   f[0][0] = 0;
   for (int i = 0; i < n; ++i) {
      int sz = sub[i].size();
      for (int j = 0; j < sz; ++j) {
         if (i > 0) {
            f[i][j + 1] = min(f[i][j + 1], f[i][j] + sub[i][j] - sub[i - 1].back());
         }
         if (i + 1 < n) {
            f[i][j + 1] = min(f[i][j + 1], f[i][j] + sub[i + 1].front() - sub[i][j]);
            if (sz - j <= sub[i + 1].size()) {
               f[i + 1][sz - j] = min(f[i + 1][sz - j], f[i][j] + pref[i + 1][sz - j] - pref[i][sz] + pref[i][j]);
            }
         }
      }
      if (i + 1 < n) {
         f[i + 1][0] = f[i].back();
      }
   }
   return f.back().back();
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:21:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while (l < vals.size()) {
           ~~^~~~~~~~~~~~~
wiring.cpp:24:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       while (r < vals.size() && vals[r].second == vals[l].second) {
              ~~^~~~~~~~~~~~~
wiring.cpp:48:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (sz - j <= sub[i + 1].size()) {
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 38 ms 8296 KB Output is correct
4 Correct 38 ms 8296 KB Output is correct
5 Correct 39 ms 9448 KB Output is correct
6 Correct 51 ms 12008 KB Output is correct
7 Correct 50 ms 11880 KB Output is correct
8 Correct 50 ms 11880 KB Output is correct
9 Correct 50 ms 11880 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 97 ms 16908 KB Output is correct
4 Correct 84 ms 14900 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 95 ms 16736 KB Output is correct
19 Correct 97 ms 16744 KB Output is correct
20 Correct 86 ms 15208 KB Output is correct
21 Correct 101 ms 16744 KB Output is correct
22 Correct 96 ms 15976 KB Output is correct
23 Correct 97 ms 15464 KB Output is correct
24 Correct 96 ms 15464 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 52 ms 8756 KB Output is correct
3 Correct 69 ms 11212 KB Output is correct
4 Correct 57 ms 8936 KB Output is correct
5 Correct 70 ms 11240 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 52 ms 9320 KB Output is correct
19 Correct 56 ms 8680 KB Output is correct
20 Correct 52 ms 8936 KB Output is correct
21 Correct 49 ms 9192 KB Output is correct
22 Correct 52 ms 9900 KB Output is correct
23 Correct 45 ms 9832 KB Output is correct
24 Correct 46 ms 9448 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 360 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 38 ms 8296 KB Output is correct
20 Correct 38 ms 8296 KB Output is correct
21 Correct 39 ms 9448 KB Output is correct
22 Correct 51 ms 12008 KB Output is correct
23 Correct 50 ms 11880 KB Output is correct
24 Correct 50 ms 11880 KB Output is correct
25 Correct 50 ms 11880 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 97 ms 16908 KB Output is correct
29 Correct 84 ms 14900 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 380 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 95 ms 16736 KB Output is correct
44 Correct 97 ms 16744 KB Output is correct
45 Correct 86 ms 15208 KB Output is correct
46 Correct 101 ms 16744 KB Output is correct
47 Correct 96 ms 15976 KB Output is correct
48 Correct 97 ms 15464 KB Output is correct
49 Correct 96 ms 15464 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 52 ms 8756 KB Output is correct
52 Correct 69 ms 11212 KB Output is correct
53 Correct 57 ms 8936 KB Output is correct
54 Correct 70 ms 11240 KB Output is correct
55 Correct 2 ms 256 KB Output is correct
56 Correct 2 ms 380 KB Output is correct
57 Correct 2 ms 256 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 3 ms 256 KB Output is correct
60 Correct 2 ms 380 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 256 KB Output is correct
63 Correct 2 ms 256 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 52 ms 9320 KB Output is correct
68 Correct 56 ms 8680 KB Output is correct
69 Correct 52 ms 8936 KB Output is correct
70 Correct 49 ms 9192 KB Output is correct
71 Correct 52 ms 9900 KB Output is correct
72 Correct 45 ms 9832 KB Output is correct
73 Correct 46 ms 9448 KB Output is correct
74 Correct 51 ms 10856 KB Output is correct
75 Correct 58 ms 9576 KB Output is correct
76 Correct 58 ms 9932 KB Output is correct
77 Correct 54 ms 9704 KB Output is correct
78 Correct 51 ms 10344 KB Output is correct
79 Correct 54 ms 10064 KB Output is correct
80 Correct 47 ms 9960 KB Output is correct
81 Correct 52 ms 11496 KB Output is correct
82 Correct 45 ms 9324 KB Output is correct
83 Correct 45 ms 10600 KB Output is correct
84 Correct 49 ms 10856 KB Output is correct
85 Correct 60 ms 9992 KB Output is correct
86 Correct 52 ms 10344 KB Output is correct
87 Correct 53 ms 10192 KB Output is correct
88 Correct 55 ms 9704 KB Output is correct
89 Correct 54 ms 9704 KB Output is correct
90 Correct 63 ms 10856 KB Output is correct
91 Correct 54 ms 10600 KB Output is correct
92 Correct 55 ms 10572 KB Output is correct
93 Correct 53 ms 9576 KB Output is correct
94 Correct 55 ms 10728 KB Output is correct
95 Correct 58 ms 9780 KB Output is correct
96 Correct 53 ms 10216 KB Output is correct
97 Correct 52 ms 11368 KB Output is correct
98 Correct 55 ms 10600 KB Output is correct
99 Correct 55 ms 10724 KB Output is correct
100 Correct 61 ms 10600 KB Output is correct
101 Correct 57 ms 10856 KB Output is correct
102 Correct 62 ms 9832 KB Output is correct