double val= value_route(ni, ia, 0);
printf("route value is %g\n", val);
} else if (!strcmp(arg,"search")) {
- results= mcalloc(sizeof(*results)*argc);
+ MCALLOC(results, argc);
+
max_dist= atoi(*argv++);
+ nhighscores_absolute= atoi(*argv++);
+ nhighscores_perleague= atoi(*argv++);
+
+ MCALLOC(highscores_absolute, nhighscores_absolute);
+ MCALLOC(highscores_perleague, nhighscores_perleague);
+
int resultsix= 0;
- while ((arg= *argv++)) {
+ while ((arg= argv[resultsix])) {
search(atoi(arg), &results[resultsix]);
resultsix++;
}
int i, midarch, finarch;
for (i=0; i<resultsix; i++) {
- fprintf(stderr,"================== start #%d ==================\n",i);
+ fprintf(stderr,"============== start #%d %s ==============\n",
+ i, argv[i]);
PotentialResult ***strat_resultsix= results[i];
if (!strat_resultsix) continue;
fprintf(stderr," ");
fprintf(stderr,"\n");
}
}
+
+ int pos;
+#define OUT(absperl) \
+ fprintf(stderr,"\n================== " #absperl " ==================\n"); \
+ for (pos=0; pos<nhighscores_##absperl; pos++) { \
+ HighScoreEntry *hs= &highscores_##absperl[pos]; \
+ PotentialResult *pr= hs->pr; \
+ if (!pr) continue; \
+ const int *const ports= pr->absperl##_ports; \
+ int nports; \
+ for (nports=0; nports<MAX_ROUTELEN && ports[nports]>=0; nports++); \
+ int finisle= ports[nports-1]; int finarch= isle2arch(finisle); \
+ int midisle= ports[nports/2]; int midarch= isle2arch(midisle); \
+ fprintf(stderr, \
+ " @%2d #%2d | start%3d mid %d:%3d f%d:%3d | %5d %5d %4d |", \
+ pos, nhighscores_##absperl - 1 - pos, \
+ ports[0], midarch,midisle, finarch,finisle, \
+ (int)hs->value, (int)pr->absolute, (int)pr->perleague); \
+ for (i=0; i<nports; i++) fprintf(stderr," %d",ports[i]); \
+ fprintf(stderr,"\n"); \
+ }
+ OUT(absolute)
+ OUT(perleague)
+
} else {
abort();
}