Submission #259578


Source Code Expand

#include <stdio.h>
#include <math.h>

int main(void){
    
    int stime[100] = {0},ttime[100] = {0},stest[100]={0},ttest[100]={0},data[100];
    int n,i,z,s1=0,t1=0,s2,t2,r,q =0,count,count2,amari = 0,number=0;
    
    scanf("%d", &n);
    
    for (i = 0; i < n; i++){
        scanf("%d-%d", &stime[i], &ttime[i]);
        for (; stime[i] % 5 != 0; stime[i]--);
        for (; ttime[i] % 5 != 0; ttime[i]++);
    }
        
        s1 = stime[0];
        t1 = ttime[0];
        
        for(z = 0; z < n; z++){
            
            if(s1 <=stime[z] && ttime[z] <= t1){
                
            }else if(stime[z] <= s1 && t1 <=ttime[z]){
                s1 = stime[z];
                t1 = ttime[z];
            } else if (stime[z] <= s1 && (ttime[z] <= t1 && s1 <= ttime[z])){
                s1 = stime[z];
            } else if (t1 <= ttime[z]&& (stime[z] <= t1 && s1 <= stime[z])){
                t1 =stime[z];
            } else {
                
                
                stest[count] = stime[z];
                //printf("st %d\n", stest[amari]);
                ttest[count] = ttime[z];
                count++;
               
                
                
            }

        }
    
    /*for(i = 0; i < count; i++){
        printf("test %d-%d\n", stest[i],ttest[i]);
    }*/
    //printf("s1 %d\n", s1);
    //printf("t1 %d\n", t1);
    //printf("count %d\n", count);
    /*for(i = 0; i < count; i++){
        printf("st[%d] %d\n", i,stest[i]);
    }*/
    
    if (s1 != stime[0] || t1 != ttime[0]){
        
        while(1){

            for (q = 0; q < count; q++){
                
                
                if(s1 <=stime[z] && ttime[z] <= t1){
                    
                }else if(stime[z] <= s1 && t1 <=ttime[z]){
                    s1 = stime[z];
                    t1 = ttime[z];
                }else if (stest[q] <= s1 && (ttest[q] <= t1 && s1 <= ttest[q])){
                    s1 = stest[q];
                    //printf("s1x %d\n", stest[q]);
                    data[number] = q;
                    number++;
                    
                } else if (t1 <= ttest[q]&& (stest[q] <= t1 && s1 <= stest[q])) {
                    t1 = ttest[q];
                    //printf("t1x %d\n", ttest[q]);
                    data[q] = q;
                } else {
                    
                    //printf("s1x %d\n", stest[q]);
                    //printf("t1x %d\n", ttest[q]);
                    count2++;

                }
                
            }
    
            if(count2 == count){
                break;
            }
            
            
        }
    }
    
    //printf("s1 %d\n", s1);
    //printf("data %d\n",number);
    //printf("t1 %d\n", t1);
    //printf("count2 %d\n", count2);
    
    
    for (q = 0; q < number; q++){
        stest[data[q]]=0;
        ttest[data[q]]=0;
    }
        if (count == n-1){
            printf("%04d-%04d\n", stime[0], ttime[0]);
        } else {
            printf("%04d-%04d\n", s1, t1);
        }
        
        for (r = 0; r < n; r++){
            if (stest[r] != 0 && ttest[r] != 0){
                printf("%04d-%04d\n",stest[r], ttest[r]);
            }
        }
    
    return 0;
    
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User ne260037
Language C (GCC 4.6.4)
Score 0
Code Size 3356 Byte
Status RE
Exec Time 2034 ms
Memory 808 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:9:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:12:14: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 2
TLE × 1
RE × 45
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt RE 273 ms 676 KB
00_sample_02.txt AC 24 ms 708 KB
00_sample_03.txt RE 266 ms 656 KB
cho_cho_chokudai.txt RE 266 ms 804 KB
chokudai_ga_cho.txt RE 267 ms 808 KB
test_01.txt RE 266 ms 800 KB
test_02.txt RE 266 ms 800 KB
test_03.txt RE 266 ms 804 KB
test_04.txt RE 268 ms 796 KB
test_05.txt RE 263 ms 804 KB
test_06.txt RE 265 ms 680 KB
test_07.txt RE 268 ms 676 KB
test_08.txt RE 264 ms 676 KB
test_09.txt RE 266 ms 800 KB
test_10.txt RE 266 ms 672 KB
test_11.txt RE 267 ms 676 KB
test_12.txt RE 277 ms 676 KB
test_13.txt RE 267 ms 800 KB
test_14.txt RE 314 ms 680 KB
test_15.txt RE 276 ms 804 KB
test_16.txt RE 265 ms 672 KB
test_17.txt RE 268 ms 804 KB
test_18.txt RE 270 ms 804 KB
test_19.txt RE 268 ms 672 KB
test_20.txt RE 268 ms 668 KB
test_21.txt RE 267 ms 680 KB
test_22.txt RE 266 ms 804 KB
test_23.txt RE 267 ms 676 KB
test_24.txt RE 267 ms 668 KB
test_25.txt RE 266 ms 676 KB
test_26.txt RE 267 ms 676 KB
test_27.txt TLE 2034 ms 808 KB
test_28.txt RE 270 ms 804 KB
test_29.txt AC 23 ms 800 KB
test_30.txt RE 266 ms 676 KB
test_31.txt RE 267 ms 800 KB
test_32.txt RE 265 ms 676 KB
test_33.txt RE 265 ms 680 KB
test_34.txt RE 265 ms 804 KB
test_35.txt RE 265 ms 676 KB
test_36.txt RE 266 ms 676 KB
test_37.txt RE 265 ms 676 KB
test_38.txt RE 268 ms 712 KB
test_39.txt RE 266 ms 676 KB
test_40.txt RE 266 ms 676 KB
test_41.txt RE 267 ms 652 KB
test_42.txt RE 267 ms 672 KB
test_43.txt RE 268 ms 648 KB