Submission #2211315

---

Source Code Expand

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

typedef struct {
  int s;
  int e;
} Time;

void merge(Time *arr, Time *tmp, int left, int right)
{
  int mid = (left + right) / 2, i, j, k;

  if (left >= right)
    return;

  merge(arr, tmp, left, mid);
  merge(arr, tmp, mid + 1, right);

  for (i = left; i <= mid; i++)
    tmp[i] = arr[i];
  for (i = mid + 1, j = right; i <= right; i++, j--)
    tmp[j] = arr[i];

  j = left;
  k = right;
  for (i = left; i <= right; i++)
    arr[i] = (tmp[j].s < tmp[k].s) ? tmp[j++] : tmp[k--];
}

void mergesort(Time *arr, int arr_size)
{
  Time *tmp = (Time *)malloc(sizeof(Time) * arr_size);
  merge(arr, tmp, 0, arr_size - 1);
  free(tmp);
}

int main(void)
{
  int n, count = 0;
  Time tmp;
  Time *x;

  scanf("%d", &n);
  x = (Time *)malloc(sizeof(Time) * n);
  for (int i = 0; i < n; i++)
    scanf("%d-%d", &x[i].s, &x[i].e);

  mergesort(x, n);

  for (int i = 0; i < n; i++) {
    x[i].s -= x[i].s % 5;
    x[i].e += x[i].e % 5 ? (5 - x[i].e % 5) : 0;
    if (x[i].e % 100 == 60)
      x[i].e += 40;
  }

  for (int i = 1; i < n; i++) {
    if (x[count].e >= x[i].s) {
      if (x[count].e < x[i].e)
        x[count].e = x[i].e;
    } else {
      x[++count] = x[i];
    }
  }

  for (int i = 0; i <= count; i++)
    printf("%04d-%04d\n", x[i].s, x[i].e);

  return 0;
}

Submission Info

Compile Error

./Main.c: In function ‘main’:
./Main.c:43:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ^
./Main.c:46:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d-%d", &x[i].s, &x[i].e);
     ^

Judge Result