algorithms-laboratory/intervalos.cpp at master · urucoder/algorithms-laboratory · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
/* 5008417 */

#include "include/intervalos.h"

#include <stdlib.h>
#include <stdio.h>

struct set{
  intervalo_t interval;
  uint origin;
  uint depend;
  bool excluded;
};

set *copy_intervals(const intervalo_t *intervals, uint len) {
  set *copy = new set[len];
  for(uint i=0; i < len; i++){
    copy[i].interval = intervals[i];
    copy[i].origin = i;
  }
  return copy;
}

void merger(set *copy, uint left, uint mid, uint right){
  uint t1 = left;
  uint t2 = mid + 1;
  uint N1 = mid;
  uint N2 = right;
  uint counter = 0;
  set *sortedArr = new set[right-left+1];

  while(t1 <= N1 && t2 <= N2){
    if(copy[t1].interval.fin <= copy[t2].interval.fin)
      sortedArr[counter++] = copy[t1++];
    else
      sortedArr[counter++] = copy[t2++];
  }

  while(t1 <= N1)
    sortedArr[counter++] = copy[t1++];

  while(t2 <= N2)
    sortedArr[counter++] = copy[t2++];

  uint len = right-left+1;
  for(uint i = 0; i < len; i++)
    copy[left++] = sortedArr[i];

  delete[] sortedArr;
}

void mergeSort(set *copy, uint left, uint right){
  if(left >= right)
    return;

  uint mid = left+(right-left)/2;
  mergeSort(copy, left, mid);
  mergeSort(copy, mid+1, right);
  merger(copy, left, mid, right);
}

set *orderer(const intervalo_t *intervalos, uint n){
  set *copy = copy_intervals(intervalos, n);
  mergeSort(copy, 0, n-1);
  return copy;
}

bool *max_cantidad(const intervalo_t *intervalos, uint n){
  bool *ret = new bool[n];
  set *ord = orderer(intervalos, n);
  uint reference = ord[0].interval.fin;
  ret[ord[0].origin] = true;

  for(uint i=1; i < n; i++){
    if(ord[i].interval.inicio < reference)
      ret[ord[i].origin] = false;
    else{
      ret[ord[i].origin] = true;
      reference = ord[i].interval.fin;
    }
  }

  delete[] ord;
  return ret;
}

bool search(set *ord, uint i, uint &Noverlap){
  uint lo = 0;
  uint hi = i-1;

  while(lo <= hi){
    uint mid = (lo + hi) / 2;
    if(ord[mid].interval.fin <= ord[i].interval.inicio){
      if(ord[mid + 1].interval.fin <= ord[i].interval.inicio)
        lo = mid + 1;
      else{
        Noverlap = mid;
        return true;
      }
    }else if(mid > 0)
      hi = mid - 1;
    else
      return false;
  }

  return false;
}

uint *weight(set *ord, uint n){
  uint *values = new uint[n];
  ord[0].depend = 0;
  ord[0].excluded = false;
  values[0] = ord[0].interval.volumen;

  for(uint i=1; i < n; i++){
    uint vol = ord[i].interval.volumen;
    uint Noverlap;
    bool finded = search(ord, i, Noverlap);

    if(finded){
      vol += values[Noverlap];

      uint x = Noverlap;
      while(ord[x].excluded)
        x = ord[x].depend;

      ord[i].depend = x;
    }else
      ord[i].depend = i;

    if(vol > values[i-1]){
      values[i] = vol;
      ord[i].excluded = false;
    }else{
      values[i] = values[i-1];
      ord[i].excluded = true;
      ord[i].depend = i-1;
    }
  }

  return values;
}

bool *max_volumen(const intervalo_t *intervalos, uint n){
  bool *ret = new bool[n];
  for(uint x=0; x<n; x++)
    ret[x] = false;

  set *ord = orderer(intervalos, n);
  uint *val = weight(ord, n);
  uint j = n;

  while(j > 0){
    j--;
    if(j == 0 || (j > 0 && val[j] > val[j-1])){
      ret[ord[j].origin] = true;
      if(j == ord[j].depend)
        j = 0;
      else{
        j = ord[j].depend + 1;
        if(j == 0)
          ret[ord[j].origin] = true;
      }
    }else
      ret[ord[j].origin] = false;
  }

  delete[] val;
  delete[] ord;
  return ret;
}