Submission #681562

---

Source Code Expand

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

char *temp[30010];

void Round(char*);
void MergeSort(char *p[], int left, int right);

int main(){
	int i, j, n, t1, t2;
	char *p[30010];
	char input[30010][10];
	char *ans[30010];

	scanf("%d", &n);
	for(i=0;i<n;i++) {
		scanf("%s", input[i]);
		Round(input[i]);
		p[i]=input[i];
	}

	MergeSort(p, 0, n-1);
	for(i=0;i<n-1;i++) {
		t1=atoi(p[i]+5);
		t2=atoi(p[i+1]);
		if(t1>=t2) {
			sprintf(p[i+1],"%04d-%04d",atoi(p[i]),(t1>atoi(p[i+1]+5))?t1:atoi(p[i+1]+5));
		}
	}

	ans[0]=p[0];
	for(i=1,j=1;j<n;i++) {
		ans[i]=p[j++];
		if(atoi(ans[i-1])==atoi(ans[i])) {
			ans[i-1]=p[j-1];
			i--;
		}
	}

	for(j=0;j<i;j++) {
		printf("%s\n", ans[j]);
	}

	return 0;
}

void Round(char* t) {
	int x;
	if(atoi(t+3)<5) *(t+3)='0';
	if(5<atoi(t+3)) *(t+3)='5';

	if(0<atoi(t+8)&&atoi(t+8)<5) *(t+8)='5';
	if(5<atoi(t+8)) {
		x=atoi(t+5);
		x+=(10-x%10);
		if(x%100==60) x+=40;
		sprintf(t+5,"%04d",x);
	}
}

void MergeSort(char *p[], int left, int right) {
    int i, j, k, mid;

    if (left >= right) return;

    mid = (left + right) / 2;
    MergeSort(p, left, mid);
    MergeSort(p, mid + 1, right);

    for (i = left; i <= mid; i++)
        temp[i] = p[i];

    for (i = mid + 1, j = right; i <= right; i++, j--)
        temp[i] = p[j];

    i = left;
    j = right;

    for (k = left; k <= right; k++)
        if (atoi(temp[i]) <= atoi(temp[j]))
            p[k] = temp[i++];
        else
            p[k] = temp[j--];
}

Submission Info

Compile Error

./Main.c: In function ‘main’:
./Main.c:15:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:17:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result