Submission #145695

---

Source Code Expand

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

int handleOverflow(int hours, int mins) {
  if (mins >= 60) {
    hours++;
    mins = mins - 60;
  }

  return hours * 100 + mins;
}

// Round down to nearest 5 mins.
int roundStartTime(int value) {
  int hours = value / 100;
  int mins = value % 100;
  int extra = mins % 5;

  return hours * 100 + (mins - extra);
}

// Round up to nearest 5 mins.
int roundEndTime(int value) {
  int hours = value / 100;
  int mins = value % 100;
  int extra = mins % 5;
  int newMins;

  if (extra > 0) {
    newMins = mins + (5 - extra);
  } else {
    newMins = mins;
  }

  return handleOverflow(hours,  newMins);
}

int readLineCount() {
  int num;
  scanf("%d\n", &num);
  return num;
}

void readTimes(int* const start, int* const end) {
  int tmpStart;
  int tmpEnd;
  scanf("%d-%d", &tmpStart, &tmpEnd);

  *start = roundStartTime(tmpStart);
  *end = roundEndTime(tmpEnd);
}

typedef struct {
  int start;
  int end;
} RainTime;

void printTimes(const RainTime* const rt) {
  printf("%04d-%04d\n", rt->start, rt->end);
}

void printAllTimes(const RainTime* const times, const int count) {
  int i = 0;
  for (i = 0; i < count; ++i) {
    printTimes(&times[i]);
  }
}

int compareRainTime(const void* const item1, const void* const item2) {
  RainTime* rt1 = (RainTime*)item1;
  RainTime* rt2 = (RainTime*)item2;

  if (rt1->start > rt2->start) {
    return 1;
  } else if (rt1->start < rt2->start) {
    return -1;
  }

  if (rt1->end > rt2->end) {
    return 1;
  } else if (rt1->end < rt2->end ){
    return -1;
  }

  return 0;
}

int main(const int argc, const char** argv) {
  int lines = readLineCount();

  RainTime* times = (RainTime*)malloc(sizeof(RainTime) * lines);

  int i = 0;
  for (i = 0; i < lines; ++i) {
    int start;
    int end;
    readTimes(&start, &end);
    times[i].start = start;
    times[i].end = end;
  }

  // Sort them based on the start time, end time.
  qsort(times, lines, sizeof(RainTime), compareRainTime);

  RainTime *results = (RainTime*)malloc(sizeof(RainTime) * lines);  // Size can never go over the initial array.

  int resultIndex = -1;

  // Copy the first entry.
  if (lines > 0) {
    results[0] = times[0];
    resultIndex = 0;
  }

  int j = 0;
  for (j = 1; j < lines; ++j) {
    RainTime* curr = &times[j];
    RainTime* currResult = &results[resultIndex];

    if (curr->start <= currResult->end) {
      // Extend the result by the new entry.
      if (curr->end > currResult->end){
        currResult->end = curr->end;
      }
    } else {
      // Move on to the next result.
      resultIndex++;
      results[resultIndex] = *curr;   // Copy over struct data.
    }
  }

  printAllTimes(results, resultIndex+1);

  return 0;
}

Submission Info

Compile Error

./Main.c: In function ‘readTimes’:
./Main.c:47:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c: In function ‘readLineCount’:
./Main.c:40:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result