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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <time.h>
#include <unistd.h>
#define NONE -1
static int debug;
typedef struct _InputItem
{
int i; /* item index */
int v; /* item value */
int w; /* item weight */
} InputItem;
typedef struct _SolverItem {
int i; /* index of the selected item */
int v; /* cumulated value */
int w; /* cumulated weight */
} SolverItem;
typedef struct _Solver
{
int k; /* capacity */
int n; /* items # */
InputItem *items; /* items */
SolverItem *column; /* solver column */
} Solver;
static void solve(Solver* solver)
{
int n, k;
int v, w;
int i, j;
const InputItem *item;
SolverItem *data;
const SolverItem *up_left;
unsigned int counter;
n = solver->n;
k = solver->k;
if (debug > 2)
{
printf("\ncurrent V(i,s,W,r)\n");
}
/* SOLVE */
counter = 0;
item = solver->items;
for (i = 0; i < n; i++, item++)
{
v = item->v;
w = item->w;
data = NULL;
data = solver->column + solver->k;
up_left = solver->column + (solver->k - w);
for (j = k; j >= w; j--, data--, up_left--)
{
counter++;
if (data->v < (v + up_left->v))
{
data->i = i;
data->v = v + up_left->v;
data->w = w + up_left->w;
}
}
if (debug > 2)
{
data = solver->column;
for (j = 0; j <= k; j++, data++)
printf(" % 4d(% 2d % 2d)\n",
data->v, data->i, data->w);
printf("\n");
}
}
if (debug == 2)
{
printf("i=%d:\n", solver->n - 1);
data = solver->column;
for (j = 0; j <= k; j++, data++)
printf(" % 4d(% 2d % 2d)\n",
data->v, data->i, data->w);
}
if (debug > 0)
printf("loops count: %u\n", counter);
}
static int check(Solver *solver, int excpected_value)
{
const SolverItem *data;
if (excpected_value == NONE)
return EXIT_SUCCESS;
data = solver->column + solver->k;
if (data->v != excpected_value)
{
fprintf(stderr,"*** ERROR found %d != %d excpected !",
data->v, excpected_value);
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
int main(int argc, char** argv, char** env)
{
FILE *fp;
int ret;
int opt;
int i;
int excpected_value;
uint64_t dt;
struct timespec t0;
struct timespec t1;
Solver solver;
InputItem *item;
debug = 0;
excpected_value = NONE;
while ((opt = getopt(argc, argv, "d:e:")) != -1) {
switch (opt) {
case 'd':
debug = atoi(optarg);
break;
case 'e':
excpected_value = atoi(optarg);
break;
default: /* '?' */
fprintf(stderr, "Usage: %s [-d level] input\n",
argv[0]);
return EXIT_FAILURE;
}
}
if (optind >= argc) {
fprintf(stderr,"input file missing\n");
return EXIT_FAILURE;
}
if (debug > 0) printf("%s\n", argv[optind]);
fp = fopen(argv[optind], "r");
if (fp == NULL)
{
fprintf(stderr, "I couldn't open results.dat for reading.\n");
return EXIT_FAILURE;
}
/* read k and n */
if (fscanf(fp, "%d %d\n", &solver.n, &solver.k) != 2)
{
fprintf(stderr, "ERROR: read first line\n");
return EXIT_FAILURE;
}
if (debug > 0) printf(" K:%d N:%d\n", solver.k, solver.n);
/* allocate */
solver.items = calloc(solver.n, sizeof(InputItem));
if (!solver.items)
{
fprintf(stderr, "ERROR: items calloc\n");
return EXIT_FAILURE;
}
solver.column = calloc((solver.k + 1), sizeof(SolverItem));
if (!solver.column)
{
free(solver.items);
fprintf(stderr, "ERROR: column calloc\n");
return EXIT_FAILURE;
}
for (i = 0; i < (solver.k + 1); i++)
{
solver.column[i].i = NONE;
}
/* read items */
item = solver.items;
for (i = 0; i < solver.n; i++, item++)
{
item->i = i;
fscanf(fp, "%d %d\n", &item->v, &item->w);
}
fclose(fp);
if (debug > 1)
{
item = solver.items;
printf(" index Value Weight\n");
for (i = 0; i < solver.n; i++, item++)
printf(" % 8d % 8d % 8d\n", item->i, item->v, item->w);
}
clock_gettime(CLOCK_MONOTONIC, &t0);
solve(&solver);
clock_gettime(CLOCK_MONOTONIC, &t1);
ret = check(&solver, excpected_value);
if (debug > 0)
{
dt = ((t1.tv_sec * 1000000000) + t1.tv_nsec) -
((t0.tv_sec * 1000000000) + t0.tv_nsec);
printf(" time %7u [ms]\n", (unsigned int)(dt/1000000));
}
free(solver.items);
free(solver.column);
return ret;
}
|
