-
Notifications
You must be signed in to change notification settings - Fork 0
/
problem.c
137 lines (109 loc) · 3.58 KB
/
problem.c
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
/*
Written by William Sutherland for
COMP20007 Assignment 1 2023 Semester 1
Modified by Grady Fitzpatrick
Implementation for module which contains problem
specification data structures and functions.
*/
/*
It is highly recommended that you do not change these files as it may make your tests
not run
*/
#include "problem.h"
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#define INT_CHAR_SIZE 12
struct problemA *readProblemA(FILE *f) {
struct problemA *problem = (struct problemA *) malloc(sizeof(struct problemA));
assert(problem);
// First line of input represents the number of points we are testing
assert(scanf("%d", &(problem->numPoints)) == 1);
problem->testPoints = (struct point *) malloc(problem->numPoints * sizeof(struct point));
assert(problem->testPoints);
// Scans all the points
for (int i = 0; i < problem->numPoints; i++) {
assert(scanf("%d %d", &(problem->testPoints[i].x), &(problem->testPoints[i].y)) == 2);
}
int height; int width;
assert(scanf("%d %d", &width, &height) == 2);
problem->m = newMap(height, width);
return problem;
}
struct map *readProblemB(FILE *f) {
return readMap(f);
}
struct problemD *readProblemD(FILE *f) {
struct problemD *problem = (struct problemD *) malloc(sizeof(struct problemD));
assert(problem);
problem->start = (struct point *) malloc(sizeof(struct point));
assert(problem->start);
problem->end = (struct point *) malloc(sizeof(struct point));
assert(problem->end);
assert(scanf("%d %d", &(problem->start->x), &(problem->start->y)) == 2);
assert(scanf("%d %d", &(problem->end->x), &(problem->end->y)) == 2);
problem->m = readMap(f);
return problem;
}
struct problemE *readProblemE(FILE *f) {
struct problemE *problem = (struct problemE *) malloc(sizeof(struct problemE));
assert(problem);
problem->start = (struct point *) malloc(sizeof(struct point));
assert(problem->start);
problem->end = (struct point *) malloc(sizeof(struct point));
assert(problem->end);
assert(scanf("%d %d", &(problem->start->x), &(problem->start->y)) == 2);
assert(scanf("%d %d", &(problem->end->x), &(problem->end->y)) == 2);
assert(scanf("%d", &(problem->numAirports)) == 1);
problem->airports = (struct point *) malloc(problem->numAirports * sizeof(struct point));
assert(problem->airports);
for (int i = 0; i < problem->numAirports; i++) {
assert(scanf("%d %d", &(problem->airports[i].x), &(problem->airports[i].y)) == 2);
}
problem->m = readMap(f);
return problem;
}
struct map *readMap(FILE *f) {
int height; int width;
assert(scanf("%d %d ", &width, &height) == 2);
struct map *m = newMap(height, width);
size_t lineLength = 0;
char *line = NULL;
int i = 0;
while (getline(&line, &lineLength, f) > 0) {
char *curr = line;
int read;
int j = 0;
int currHeight = i;
int nextVal;
while (sscanf(curr, "%d%n", &nextVal, &read) == 1) {
m->points[j][currHeight] = nextVal;
j++;
curr += read;
currHeight = m->height - currHeight - 1;
}
i++;
}
if(line){
free(line);
}
return m;
}
void freeProblemA(struct problemA *p) {
freeMap(p->m);
free(p->testPoints);
free(p);
}
void freeProblemD(struct problemD *p) {
freeMap(p->m);
free(p->start);
free(p->end);
free(p);
}
void freeProblemE(struct problemE *p) {
freeMap(p->m);
free(p->airports);
free(p->start);
free(p->end);
free(p);
}