/
mesa.c
92 lines (78 loc) · 1.72 KB
/
mesa.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
/**********************************/
/* MAC0328 - Algoritmos em grafos */
/* */
/* rafamz */
/* macacada */
/* Rafael Reggiani Manzo */
/* 6797150 */
/**********************************/
#include<stdlib.h>
#include "ed/vertex.h"
#include "ed/digraph.h"
#include "ed/graph.h"
#include "io.h"
#include "mesa.h"
void solver(){
int instance;
Graph G;
instance = 1;
G = inputInstance();
while(G != NULL){
outInstance(instance, processInstance(G));
instance++;
GRAPHdestroy(G);
G = inputInstance();
}
}
int processInstance(Graph G){
int *flag, *side, i, j;
side = malloc((G->V)*sizeof(int));
flag = malloc((G->V)*sizeof(int));
for(i = 0; i < G->V; i++){
side[i] = STANDING;
}
for(i = 1; i < G->V; i++){
if(!recursiveCheck(G, i, side, flag)){
free(side);
free(flag);
return 0;
}
for(j = 1; j < G->V; j++){
if(!flag[j]){
i = j - 1;
j = G->V;
}
}
}
free(side);
free(flag);
return 1;
}
int recursiveCheck(Graph G, Vertex actual, int *side, int *flag){
int i;
flag[actual] = 1;
if(side[actual] == STANDING){
for(i = 1; i < G->V; i++){
if(G->adj[actual][i]){
if(side[i] != STANDING){
side[actual] = (side[i] % 2) + 1;
i = G->V;
}
}
}
if(side[actual] == STANDING){
side[actual] = LEFT;
}
}
for(i = 1; i < G->V; i++){
if(G->adj[actual][i]){
if(side[i] == side[actual]){
return 0;
}else if(side[i] == STANDING){
side[i] = (side[actual] % 2) + 1;
return recursiveCheck(G, i, side, flag);
}
}
}
return 1;
}