Submission #1501138


Source Code Expand

#include <stdio.h>
static int n, m, x, y, a[100000], b[100000], ia, ib, t, sum;
int main(void) {
    scanf("%d%d%d%d", &n, &m, &x, &y);
    for (ia = 0; ia < n; ++ia) scanf("%d", a + ia);
    for (ib = 0; ib < m; ++ib) scanf("%d", b + ib);
    ia = ib = 0;
    while (1) {
        while (a[ia] < t) {
            ++ia;
            if (ia >= n) goto end;
        }
        if (ia >= n) goto end;
        t = a[ia++];
        t += x;
        
        while (b[ib] < t) {
            ++ib;
            if (ib >= m) goto end;
        }
        if (ib >= m) goto end;
        t = b[ib++];
        t += y;
        
        ++sum;
    }
end:
    printf("%d\n", sum);
    return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User test20170101
Language C (GCC 5.4.1)
Score 100
Code Size 704 Byte
Status AC
Exec Time 23 ms
Memory 896 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:4: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:5:32: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     for (ia = 0; ia < n; ++ia) scanf("%d", a + ia);
                                ^
./Main.c:6:32: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     for (ib = 0; ib < m; ++ib) scanf("%d", b + ib);
                                ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 18
AC × 33
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 AC 12 ms 640 KB
subtask0_10.txt AC 14 ms 640 KB
subtask0_11.txt AC 16 ms 768 KB
subtask0_12.txt AC 17 ms 768 KB
subtask0_13.txt AC 14 ms 640 KB
subtask0_14.txt AC 17 ms 768 KB
subtask0_2.txt AC 15 ms 768 KB
subtask0_3.txt AC 16 ms 768 KB
subtask0_4.txt AC 15 ms 768 KB
subtask0_5.txt AC 11 ms 640 KB
subtask0_6.txt AC 19 ms 896 KB
subtask0_7.txt AC 16 ms 768 KB
subtask0_8.txt AC 12 ms 640 KB
subtask0_9.txt AC 20 ms 896 KB
subtask0_sample_01.txt AC 1 ms 128 KB
subtask0_sample_02.txt AC 1 ms 128 KB
subtask0_sample_03.txt AC 1 ms 128 KB
subtask1_0.txt AC 23 ms 896 KB
subtask1_1.txt AC 21 ms 768 KB
subtask1_10.txt AC 14 ms 640 KB
subtask1_11.txt AC 20 ms 768 KB
subtask1_12.txt AC 22 ms 896 KB
subtask1_13.txt AC 23 ms 896 KB
subtask1_14.txt AC 17 ms 640 KB
subtask1_2.txt AC 21 ms 768 KB
subtask1_3.txt AC 18 ms 768 KB
subtask1_4.txt AC 21 ms 768 KB
subtask1_5.txt AC 20 ms 768 KB
subtask1_6.txt AC 20 ms 768 KB
subtask1_7.txt AC 20 ms 768 KB
subtask1_8.txt AC 20 ms 768 KB
subtask1_9.txt AC 23 ms 896 KB