oj.uz

Submission #172324

# Submission time Handle Problem Language Result Execution time Memory
172324 2020-01-01T08:12:45 Z AlexLuchianov Wiring (IOI17_wiring) C++14
100 / 100
 66 ms 9064 KB 
#include "wiring.h"
#include <vector>
#include <algorithm>
#include <iostream>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 2e5;
int const coordmax = 1e9;
ll const inf = 1LL * coordmax * coordmax;

struct Wire{
  int color;
  int dist;
  bool operator < (Wire const &a) const{
    return dist < a.dist;
  }
};

std::vector<Wire> v;
ll dp[1 + nmax], sum[1 + nmax];
std::vector<int> changes;

ll getsum(int x, int y){
  if(x == 0)
    return sum[y];
  else
    return sum[y] - sum[x - 1];
}


long long min_total_length(std::vector<int> r, std::vector<int> b) {
  int n = r.size() + b.size();
  v.push_back({0, -1}); ///just for filling the empty space
  for(int i = 0; i < r.size(); i++)
    v.push_back({1, r[i]});
  for(int i = 0; i < b.size(); i++)
    v.push_back({2, b[i]});
  v.push_back({0, coordmax + 1});

  std::sort(v.begin(), v.end());
  for(int i = 1; i <= n; i++)
    sum[i] = sum[i - 1] + v[i].dist;
  for(int i = 1; i <= n; i++)
    if(v[i - 1].color != v[i].color)
      changes.push_back(i);
  changes.push_back(n + 1);
  for(int i = 1; i <= n; i++)
    dp[i] = inf;
  dp[0] = 0;

  for(int group = 1; group < changes.size() - 1; group++){
    int x = changes[group], y = changes[group + 1] - 1, lim = changes[group - 1];
    ll result = inf;
    for(int i = y; x <= i; i--){
      if(i < y)
        result = result - v[i + 1].dist + v[x].dist;

      int x2 = x - 1 - (i - x);
      if(lim <= x2) {
        result = MIN(result, MIN(dp[x2], dp[x2 - 1]) + getsum(x, i) - getsum(x2, x - 1));
        ll adaos = 0;
        while(i == y && lim <= x2){
          result = MIN(result, MIN(dp[x2], dp[x2 - 1]) + getsum(x, i) - getsum(x2, x - 1) + adaos);
          x2--;
          adaos += v[x].dist;
        }
      }
      dp[i] = MIN(dp[i], result);
    }
    result = inf;
    for(int i = x; i <= y; i++){
      result = result + v[i].dist - v[x - 1].dist;
      int x2 = x - 1 - (i - x);
      if(lim <= x2)
        result = MIN(result, MIN(dp[x2], dp[x2 - 1]) + getsum(x, i) - getsum(x2, x - 1));
      dp[i] = MIN(dp[i], result);
    }
    /*
    std::cout << group << " " << x << " " << y << '\n';
    for(int i = x; i <= y; i++)
      std::cout << dp[i] << " ";
    std::cout << '\n' << '\n';
    //*/

  }
  return dp[n];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:37:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < r.size(); i++)
                  ~~^~~~~~~~~~
wiring.cpp:39:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < b.size(); i++)
                  ~~^~~~~~~~~~
wiring.cpp:54:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int group = 1; group < changes.size() - 1; group++){
                      ~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 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 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 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 380 KB Output is correct
3 Correct 36 ms 5224 KB Output is correct
4 Correct 36 ms 5096 KB Output is correct
5 Correct 36 ms 5224 KB Output is correct
6 Correct 48 ms 6812 KB Output is correct
7 Correct 56 ms 6760 KB Output is correct
8 Correct 48 ms 6760 KB Output is correct
9 Correct 48 ms 6652 KB Output is correct

Subtask #3
10.0 / 10.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 63 ms 7116 KB Output is correct
4 Correct 61 ms 8556 KB Output is correct
5 Correct 2 ms 376 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 256 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 376 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 62 ms 9064 KB Output is correct
19 Correct 62 ms 8936 KB Output is correct
20 Correct 66 ms 8936 KB Output is correct
21 Correct 62 ms 9036 KB Output is correct
22 Correct 62 ms 9064 KB Output is correct
23 Correct 63 ms 8936 KB Output is correct
24 Correct 66 ms 9064 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 51 ms 6752 KB Output is correct
3 Correct 54 ms 6760 KB Output is correct
4 Correct 57 ms 6760 KB Output is correct
5 Correct 54 ms 6760 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 376 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 376 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 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 51 ms 7908 KB Output is correct
19 Correct 52 ms 8040 KB Output is correct
20 Correct 50 ms 7940 KB Output is correct
21 Correct 48 ms 8040 KB Output is correct
22 Correct 51 ms 8044 KB Output is correct
23 Correct 56 ms 7904 KB Output is correct
24 Correct 52 ms 7912 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 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 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 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 380 KB Output is correct
19 Correct 36 ms 5224 KB Output is correct
20 Correct 36 ms 5096 KB Output is correct
21 Correct 36 ms 5224 KB Output is correct
22 Correct 48 ms 6812 KB Output is correct
23 Correct 56 ms 6760 KB Output is correct
24 Correct 48 ms 6760 KB Output is correct
25 Correct 48 ms 6652 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 63 ms 7116 KB Output is correct
29 Correct 61 ms 8556 KB Output is correct
30 Correct 2 ms 376 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 256 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 376 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 62 ms 9064 KB Output is correct
44 Correct 62 ms 8936 KB Output is correct
45 Correct 66 ms 8936 KB Output is correct
46 Correct 62 ms 9036 KB Output is correct
47 Correct 62 ms 9064 KB Output is correct
48 Correct 63 ms 8936 KB Output is correct
49 Correct 66 ms 9064 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 51 ms 6752 KB Output is correct
52 Correct 54 ms 6760 KB Output is correct
53 Correct 57 ms 6760 KB Output is correct
54 Correct 54 ms 6760 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 376 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 380 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 51 ms 7908 KB Output is correct
68 Correct 52 ms 8040 KB Output is correct
69 Correct 50 ms 7940 KB Output is correct
70 Correct 48 ms 8040 KB Output is correct
71 Correct 51 ms 8044 KB Output is correct
72 Correct 56 ms 7904 KB Output is correct
73 Correct 52 ms 7912 KB Output is correct
74 Correct 49 ms 8680 KB Output is correct
75 Correct 57 ms 8268 KB Output is correct
76 Correct 58 ms 8680 KB Output is correct
77 Correct 53 ms 8196 KB Output is correct
78 Correct 56 ms 8168 KB Output is correct
79 Correct 54 ms 8040 KB Output is correct
80 Correct 45 ms 8044 KB Output is correct
81 Correct 51 ms 8168 KB Output is correct
82 Correct 58 ms 8168 KB Output is correct
83 Correct 45 ms 8424 KB Output is correct
84 Correct 49 ms 8680 KB Output is correct
85 Correct 63 ms 8676 KB Output is correct
86 Correct 51 ms 8680 KB Output is correct
87 Correct 64 ms 8708 KB Output is correct
88 Correct 55 ms 8808 KB Output is correct
89 Correct 55 ms 8716 KB Output is correct
90 Correct 62 ms 8680 KB Output is correct
91 Correct 61 ms 8680 KB Output is correct
92 Correct 56 ms 8680 KB Output is correct
93 Correct 52 ms 8680 KB Output is correct
94 Correct 56 ms 8680 KB Output is correct
95 Correct 58 ms 8820 KB Output is correct
96 Correct 50 ms 8680 KB Output is correct
97 Correct 60 ms 8680 KB Output is correct
98 Correct 61 ms 8680 KB Output is correct
99 Correct 61 ms 8680 KB Output is correct
100 Correct 61 ms 8808 KB Output is correct
101 Correct 53 ms 8680 KB Output is correct
102 Correct 60 ms 8680 KB Output is correct