Submission #2710510


Source Code Expand

#include <stdio.h>

int main(void)
{
    int N, M, X, Y, a[100000] = {0}, b[100000] = {0}, i, j, count = 0,
        position = 0;

    scanf("%d %d %d %d ", &N, &M, &X, &Y);
    for(i=0; i<N; i++) {
        scanf("%d", &a[i]);
    }
    for(i=0; i<M; i++) {
        scanf("%d", &b[i]);
    }
    int times = a[0];
    i = 0, j = 0; 
    while(a[i] || b[j]) {
        if(position%2) {
            if(times <= b[j]) {
                times = b[j] + Y ;
                position++;
                count++;
            }
            j++;
        }else {
            if(times <= a[i]) {
                times = a[i] + X;
                position++;
            }
            i++;
        }
    }
    printf("%d\n", count);

    return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User testsute
Language C (GCC 5.4.1)
Score 0
Code Size 770 Byte
Status RE
Exec Time 119 ms
Memory 896 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:8:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d ", &N, &M, &X, &Y);
     ^
./Main.c:10:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ^
./Main.c:13:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &b[i]);
         ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 2
RE × 1
AC × 3
WA × 1
RE × 14
AC × 8
WA × 4
RE × 21
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 20 ms 896 KB
subtask0_1.txt RE 109 ms 896 KB
subtask0_10.txt RE 111 ms 896 KB
subtask0_11.txt RE 112 ms 896 KB
subtask0_12.txt RE 114 ms 896 KB
subtask0_13.txt RE 110 ms 896 KB
subtask0_14.txt RE 113 ms 896 KB
subtask0_2.txt RE 112 ms 896 KB
subtask0_3.txt RE 113 ms 896 KB
subtask0_4.txt WA 15 ms 896 KB
subtask0_5.txt RE 109 ms 896 KB
subtask0_6.txt RE 116 ms 896 KB
subtask0_7.txt RE 112 ms 896 KB
subtask0_8.txt RE 107 ms 896 KB
subtask0_9.txt RE 116 ms 896 KB
subtask0_sample_01.txt RE 97 ms 896 KB
subtask0_sample_02.txt AC 1 ms 896 KB
subtask0_sample_03.txt AC 1 ms 896 KB
subtask1_0.txt AC 23 ms 896 KB
subtask1_1.txt WA 21 ms 896 KB
subtask1_10.txt RE 110 ms 896 KB
subtask1_11.txt RE 117 ms 896 KB
subtask1_12.txt AC 23 ms 896 KB
subtask1_13.txt RE 119 ms 896 KB
subtask1_14.txt WA 18 ms 896 KB
subtask1_2.txt WA 22 ms 896 KB
subtask1_3.txt AC 19 ms 896 KB
subtask1_4.txt RE 117 ms 896 KB
subtask1_5.txt RE 115 ms 896 KB
subtask1_6.txt AC 20 ms 896 KB
subtask1_7.txt AC 20 ms 896 KB
subtask1_8.txt RE 118 ms 896 KB
subtask1_9.txt RE 119 ms 896 KB